Secure Implementation Experiments: Do Strategy-proof Mechanisms ...

More documents

Recommendations

Info

u 1 r = 12 ~ r 2 b 12 a 4 1 ~ r 1 Figure 3: Payoff function of a Groves Mechanism with Single-Peaked Preferences
35 30 25 20 15 Frequency 10 5 25 22 19 Type 2 16 13 10 7 4 1 1 3 5 7 9 11 13 15 0 21 23 25 19 17 Type 1 Figure 4: Treatment P -- All Pairs Choices
Page 1 and 2: Secure Implementation Experiments:
Page 3 and 4: 1. Introduction Strategy-proofness,
Page 5 and 6: preferences are single-peaked (wher
Page 7 and 8: 2. Experimental Results on Strategy
Page 9 and 10: less than 10 percent of the bids re
Page 11 and 12: Second, let ( v , v ) = ( , ) be th
Page 13 and 14: g g g g 2 1 2 2 1 2 2 1 2 2 1 2 v (
Page 15 and 16: Theorem 1. An SCF is securely imple
Page 17 and 18: ----------------------------------
Page 19 and 20: on her own choices, she did not kno
Page 21 and 22: Let the strategy space of each type
Page 23 and 24: After deciding which number she cho
Page 25 and 26: strategy equilibria. Table 8 of ove
Page 27 and 28: This is likely to have reduced the
Page 29 and 30: (a) Individuals play dominant strat
Page 31 and 32: the pivotal mechanism has Nash equi
Page 33 and 34: Treatment S is both secure and supe
Page 35 and 36: Gibbard, A., 1973. Manipulation of
Page 37: Agent 2 7 5 Bad Nash area true valu
Page 41 and 42: Percent Playing Dominant Strategy 1
Page 43 and 44: P1 The number which you choose (Typ
Page 45 and 46: Dominant Strategy Equilibrium Good
Page 47 and 48: Dominant Strategy Equilibrium Good
Page 49 and 50: Payoff Table (for the Actual Experi
Page 51: (1) (2) Dummy variable=1 for Treatm

Secure Implementation Experiments: Do Strategy-proof Mechanisms ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?