[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3328526.3329613acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
extended-abstract

Obvious Dominance and Random Priority

Published: 17 June 2019 Publication History

Abstract

We introduce a general class of simplicity concepts that vary the foresight abilities required of agents in extensive-form games, and use it to provide characterizations of simple mechanisms in social choice environments with and without transfers. We show that obvious strategy-proofness---an important simplicity concept included in our class---is characterized by clinch-or-pass games we call millipede games. Some millipede games are indeed simple and widely-used, though others may be complex, requiring significant foresight on the part of the agents, and are rarely observed. Weakening the foresight abilities assumed of the agents eliminates these complex millipede games, leaving monotonic games as the only simple games, a class which includes ascending auctions. As an application, we explain the widespread popularity of the well-known Random Priority mechanism by showing it is the unique mechanism that is efficient, fair, and simple to play.

Supplementary Material

MP4 File (p1-pycia.mp4)

Cited By

View all
  • (2023)On the Connection between Greedy Algorithms and Imperfect RationalityProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597755(657-677)Online publication date: 9-Jul-2023
  • (2022)Obvious Strategyproofness, Bounded Rationality and ApproximationTheory of Computing Systems10.1007/s00224-022-10071-266:3(696-720)Online publication date: 1-Jun-2022
  • (2021)Exponential communication separations between notions of selfishnessProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451127(947-960)Online publication date: 15-Jun-2021
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation
June 2019
947 pages
ISBN:9781450367929
DOI:10.1145/3328526
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2019

Check for updates

Author Tags

  1. mechanism design
  2. obvious dominance
  3. random priority
  4. simplicity

Qualifiers

  • Extended-abstract

Conference

EC '19
Sponsor:
EC '19: ACM Conference on Economics and Computation
June 24 - 28, 2019
AZ, Phoenix, USA

Acceptance Rates

EC '19 Paper Acceptance Rate 106 of 382 submissions, 28%;
Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25
The 25th ACM Conference on Economics and Computation
July 7 - 11, 2025
Stanford , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)On the Connection between Greedy Algorithms and Imperfect RationalityProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597755(657-677)Online publication date: 9-Jul-2023
  • (2022)Obvious Strategyproofness, Bounded Rationality and ApproximationTheory of Computing Systems10.1007/s00224-022-10071-266:3(696-720)Online publication date: 1-Jun-2022
  • (2021)Exponential communication separations between notions of selfishnessProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451127(947-960)Online publication date: 15-Jun-2021
  • (2020)On obvious strategy-proofness and single-peakednessJournal of Economic Theory10.1016/j.jet.2020.104992186(104992)Online publication date: Mar-2020
  • (2020)Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility LocationAlgorithmica10.1007/s00453-020-00771-xOnline publication date: 3-Oct-2020
  • (2019)Obvious Strategyproofness, Bounded Rationality and ApproximationAlgorithmic Game Theory10.1007/978-3-030-30473-7_6(77-91)Online publication date: 16-Sep-2019

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media