~/talk

Obviously Strategy-Proof Mechanisms

links:none on file
slides:none on file

Proposes obviously strategy-proof (OSP) as a stricter concept than weak dominance: a strategy is OSP if at any earliest divergence point the deviation’s best outcome ≤ the strategy’s worst outcome. Proves two characterizations: a behavioral one using agents who only distinguish games by their own experiences, and a mechanism one showing OSP equals implementability with bilateral commitments. Shows ascending clock auctions are OSP, second‑price sealed bids are not, and lab play rates are substantially higher under OSP mechanisms.

AI-written summary · about

  1. 0:00Start
  2. 5:27New Solution Concept: OSP
  3. 8:22Notation
  4. 15:57Model: An agent unable to use contingent reasoning
  5. 18:17Generate the same experiences
  6. 19:23First characterization theorem
  7. 23:37A Partial Commitment Game
  8. 25:24Supported by bilateral commitments
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.