2. Approximate Mechanism Design Without Money

3. App. Mech. Design Without Money Mechanism Truthfulness Without money 2 VCG

4. Money is the root of all evil! Security issues Banking issues Ethical Considerations Legal Considerations 3

5. App. Mech. Design Without Money Mechanism Truthfulness Without money Approximation 4 VCG

6. Problem Classes 5 Opt Sp Mechanism With money & Intractable Class 1 Opt SP Mechanism With money Intractable Class 2 No Opt SP Mechanism With Money Class 3 No opt SP Mechanism Without Money Picture is from slides of [1]

7. Facility Location - Definitions Network, Graph Agents Location Profile Deterministic Mechanism Randomized Mechanism SP and GSP 6

8. NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC UB 1 GSP rand UB 2 GSP LB 2 SP UB 2 GSP LB 2 SP UB 2 GSP LB 2 SP UB 2 GSP LB 2 SP det MC UB 2 GSP LB 2-o(1) SP UB 3/2 SP LB 3/2 SP UB 3/2 GSP LB 3/2 SP ran NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC LB open rand UB 2 GSP LB 2 SP det MC UB 3/2 SP UB 3/2 GSP LB 3/2 SP ran Facility Location - Summary 7 Picture is from slides of [1]

9. Trees – Median is optimum 8 E E C C B B A A G G F F D D F F C C B B A A Picture is from slides of [1]

10. NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC LB open rand UB 2 GSP LB 2 SP det MC UB 3/2 SP UB 3/2 GSP LB 3/2 SP ran Facility Location - Summary 9 Picture is from slides of [1]

11. Social Cost 10

12. NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC LB open rand UB 2 GSP LB 2 SP det MC UB 3/2 SP UB 3/2 GSP LB 3/2 SP ran Facility Location - Summary 11 Picture is from slides of [1]

13. Maximum Cost 12 A A B B y y

14. NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC LB open rand UB 2 GSP LB 2 SP det MC UB 3/2 SP UB 3/2 GSP LB 3/2 SP ran Facility Location - Summary 13 Picture is from slides of [1]

15. Maximum Cost – Randomized UB 14 E E D D A A C C 1/4 1/2 1/4 B B B B 1/2 d 2d Picture is from slides of [1]

16. NETWORK TOPOLOGY generalcircletreeline Mechanism Target LB  (n) SP UB 1 GSP det SC LB open rand UB 2 GSP LB 2 SP det MC UB 3/2 SP UB 3/2 GSP LB 3/2 SP ran Facility Location - Summary 15 Picture is from slides of [1]

17. Election - Definitions Voters Candidates Preference List Preference Profile Approximation 16

18. Single Mechanism Benefit Election – Definitions (cont.) 17 Matching Mechanism Benefit

19. Election - Summary 18 RndDet Single Matching

20. Single – Deterministic UB 19

21. Single – Randomized UB 20

22. Matching 21 C1 C2 1 1 2 2 3 3 n n 1 12 22 1 2 1 OPT=3 OPT’=4

23. ? 22 Thanks

24. Refrences 1.N. Alon, M. Feldman, A. D. Procaccia, M. Tennenholtz. Strategyproof Approximation Mechanisms for Location on Networks. CoRR, 2009 2.A. D. Procaccia, M. Tennenholtz. Approximate mechanism design without money. In Proceedings of the 10th ACM Conference on Electronic Commerce (ACM-EC), 2009 3.J. Schummer and R. V. Vohra. Mechanism design without money. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 10. Cambridge University Press, 2007. 23

25. 24 B B C C D D E E 1/4 F F 1/2 1/4 A A

26. 25 B B 3/8 B B A A C C C C A A 1/4