Foundations of mechanism design: A tutorial Part 1 - Key concepts and classical results

Sadhana - Academy Proceedings in Engineering Sciences

Volumn 33, Issue 2, 2008, Pages 83-130

  Garg, Dinesh ^a   Narahari, Y ^b   Gujar, Sujit ^b  

^a IBM INDIA RESEARCH LAB   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Auctions; Game theory; Mechanism design; Social choice functions

Indexed keywords

AUCTIONS; MECHANISM DESIGN THEORY; MICROECONOMICS; NETWORK ECONOMICS; SOCIAL CHOICE FUNCTIONS;

COMPUTER SCIENCE; DECISION THEORY; ELECTRONIC COMMERCE; GAME THEORY; PROBLEM SOLVING; STRATEGIC PLANNING;

KNOWLEDGE BASED SYSTEMS;

EID: 44349165140     PISSN: 02562499     EISSN: None     Source Type: Journal    
DOI: 10.1007/s12046-008-0008-3     Document Type: Article

References (77)

1. Aggarwal G, Goel A, Motwani R 2006 Truthful auctions for pricing search keywords. In EC'06: Proceedings of the 7th ACM Conference on Electronic Commerce, (New York, USA: ACM) 1-7
2. Altman A, Tennenholtz M 2005 Ranking systems: The pagerank axioms. In 6th ACM Conference on Electronic Commerce (EC'05) 1-8
3. Altman A, Tennenholtz M 2006 Quantifying incentive compatibility of ranking systems. In Proceedings of The Twenty-First National Conference on Artificial Intelligence 21: 586-591
4. Anderegg L, Eidenbenz 2003 Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In 9th ACM Annual International Conference on Mobile Computing and Networking (MobiCom'03), San Diego, California, USA, September 14-19, 245-259
5. Arrow K 1979 The property rights doctrine and demand revelation under incomplete information. In M Boskin, (ed), Economics and Human Welfare. (New York: Academic Press)
6. Baar T, Olsder G J 1999 Dynamic Nuncooperative Game Theory. SIAM Series in Classics in Applied Mathematics
7. Brandt F 2003 Social choice and preference protection -towards fully private mechanism design. In 4th ACM Conference on Electronic Commerce (EC'03) 220-221
8. Buyya R 2002 Economic-based distributed resource management and scheduling for grid computing. PhD diesis, School of Computer Science and Software Engineering, Monash University, Australia
9. Caplice C, Sheffi Y 2005 Combinatorial auctions for truckload transportation. In P Cramton, Y Shoham, R Steinberg, (eds.), Combinatorial Auctions, (Cambridge, Massachusetts, USA: The MIT Press) 539-572
10. Chandrashekar T S, Narahari Y, Rosa C H, Kulkami D, Tew J D, Dayama P 2006 Auction based mechanisms for electronic procurement. IEEE Transactions on Automation Science and Engineering 4(3): 297-321
11. Clarke E 1971 Multi-part pricing of public goods. Public Choice 11: 17-23
12. Cramton P 2005 Simultaneous ascending auctions. In P Cramton, Y Shoham, R Steinberg, (eds.), Combinatorial Auctions, (Cambridge, Massachusetts, USA: The MIT Press) 99-114
13. Das A, Grosu D 2005 Combinatorial auction-based protocols for resource allocation in grids. In IPDPS'05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS '05) - Workshop 13, (Washington, DC: USA, IEEE Computer Society) 2511
14. d' Aspremont C, Gérard-Varet L A 1979 Incentives and incomplete information. J. Public Econ. 11: 25-45
15. de Vries S, Vohra R V 2003 Combinatorial auctions: A survey. INFORMS J. Computing 15(1): 284-309
16. de Vries S, Vohra R V 2005 Design of combinatorial auctions. In Handbook of Quantitative Supply Chain Analysis: Modelling in the E-Business Era. International Series in Operations Research and Management Science, (Norwell: MA, USA: Kluwer Academic Publishers) 247-292
17. Edelman B, Ostrovsky M, Schwarz M 2006 Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. In 2nd Workshop on Sponsored Search Auctions in conjunction with the ACM Conference on Electronic Commerce (EC '06), Ann Arbor, MI
18. Eidenbenz S, Santi P, Resta G 2005 COMMIT: A sender centric truthful and energy-efficient routing protocol for ad hoc networks. In Workshop on Wireless, Mobile, and Ad hoc Networks (WMAN) in conjunction with 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)
19. Eso M, Kalagnanam J, Ladanyi L, Li Y G 2001 Winner determination in bandwidth exchanges. Technical report, IBM TJ Watson Research Center
20. Feigenbaum J and Shenker S 2002 Distributed algorithmic mechanism design: Recent results and future directions. In 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (MobiCom'02), New York: 1-13
21. Feigenbaum J, Papadimitriou C H, Sami R, Shenker S 2002 A BGP-based mechanism for lowest-cost routing. In 21st ACM Symposium on Principles of Distributed Computing (PODC'02), New York: June 30-July 4, 173-182
22. Garg D 2006 Design of Innovative Mechanisms for Contemporary Game Theoretic Problems in Electronic Commerce. PhD thesis, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
23. Garg D, Narahari Y 2005 Design of incentive compatible mechanisms for stackelberg problems. In First Workshop on Network and Internet Economics, WINE-2005, Springer, Lecture Notes in Computer Science, Decemeber 3828: 718-727
24. Garg D, Narahari Y, Gujar S 2008 Foundations of mechanism design: A tutorial - Part 2: Advanced concepts results. Sādhanā 33: 131-174
25. Gautam Raghav, Hemachandra N, Narahari Y, Hastagiri Prakash 2007 Optimal auctions for multi-unit procurement with volume discount bidders. In Proceedings of IEEE Conference on Electronic Commerce (IEEE CEC-2007) 21-28
26. Gibbard A 1973 Manipulation of voting schemes. Econometrica 41: 587-601
27. Green J R, Laffont J J 1979 Incentives in Public Decision Making. (Amsterdam: North-Holland Publishing Company)
28. Grosu D, Chronopoulos A T 2003 A load balancing mechanism with verification. In IPDPS'03: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, (Washington, DC: USA, IEEE Computer Society) 163-170
29. Grosu D, Chronopoulos A T 2004 Algorithmic mechanism design for load balancing in distributed systems. Systems, Man, and Cybernetics, Part B, IEEE Transactions on 34(1): 77-84
30. Groves T 1973 Incentives in teams. Econométrica 41: 617-631
31. Gyongyi Z, Garcia-Molina H 2005 Link spam alliances. In 31st International Conference on Very Large Data Bases (VLDB'05), Trondheim, Norway
32. Hershberger J, Suri S 2001 Vickrey prices and shortest paths: What is an edge worth? In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'0I) 252-259
33. Hurwicz L 1960 Optimality and informational efficiency in resource allocation processes. In Mathematical Methods in the Social Sciences. Arrow, Karlin and Suppes (eds.). Stanford University Press
34. Hurwicz L 1972 On informationally decentralized systems. In Decision and Organization. Radner and McGuire. North-Holland, Amsterdam
35. Jackson M O 2001 A crash course in implementation theory. Social Choice and Welfare 18: 655-708
36. Jackson M O 2003 Mechanism theory. In Ulrich Derigs, (ed.), Optimizations and Operations Research. Oxford, UK
37. Jayant K, Parkes D C 2005 Auctions, bidding, and exchange design. In David Simchi-Levi, David S Wu, and Max Shen, (eds.), Handbook of Quantitative Supply Chain Analysis: Modelling in the E-Business Era, Int. Series in Operations Research and Management Science. (Norwell, USA: Kluwer Academic Publishers)
38. John C Harsanyi 1967 Games with incomplete information played by Bayesian players. Part I: The basic model. Management Sci. 14:159-182
39. John C Harsanyi 1968a Games with incomplete information played by Bayesian players. Part II: Bayesian equilibrium points. Management Sci. 14: 320-334
40. John C Harsanyi 1968b Games with incomplete information played by Bayesian players. Part III: The basic probability distribution of the game. Management Sci. 14:486-502
41. Kameshwaran S, Narahari Y, Rosa C H, Kulkarni D, Tew J D 2006 Multi-attribute electronic procurement using goal programming. European J. Operational Res. 179: 518-536
42. Karabuk S, David Wu S 2005 Incentive schemes for semiconductor capacity allocation: A game theoretic analysis. Production and Operations Management 14(2): 175-188
43. Krishna V 2002 Auction Theory. (Burlington, USA: Academic Press)
44. Laffont J J 1988 Fundamentals of Public Economics (Cambridge: The MIT Press)
45. Martin J Osborne 2003 An Introduction to Game Theory. (Cambridge: The MIT Press)
46. Maskin E 1999 Nash equilibrium and welfare optimality. Rev. Econ. Studies 66: 23-38
47. Mas-Colell A, Whinston M D, Green J R 1995 Microeconomic Theory. (New York: Oxford University Press)
48. McAfee P R, McMillan J 1987 Auctions and bidding. J. Econ. Literat. 25(2): 699-738
49. Milgrom P 1989 Auctions and bidding: A primer. J. Econ. Perspectives 3(3): 3-22
50. Milgrom P 2004 Putting Auction Theory to Work. (New York, USA: Cambridge University Press)
51. Myerson R B 1981 Optimal auction design. Mathematics of Operations Research 6(1): 58-73
52. Myerson R 1989 Mechanism design. In J Eatwell, M Milgate, P Newman, (eds.), The New Palgrave: Allocation, Information, and Markets, Norton, New York 191-206
53. Myerson R B 1997 Game Theory: Analysis of Conflict. (Cambridge, Massachusetts: Harvard University Press)
54. Naor M 2001 Cryptography and mechanism design. In 8th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), Certosa di Pontignano, University of Siena, Italy
55. Naor M, Pinkas B, Sumner R 1999 Privacy preserving auctions and mechanism design. In EC'99: Proceedings of the 1st ACM conference on Electronic commerce, (New York, USA: ACM Press) 129-139
56. Narahari Y, Dayama P 2005 Combinatorial auctions for electronic business. Sādhanā 30(2-3): 179-212
57. Narahari Y, Srivastava N K 2007 Incentive compatible mechanisms for decentralized supply chain formation. In Proceedings of IEEE Conference on Electronic Commerce (IEEE CEC-2007) 315-322
58. Narahari Y, Garg D, Rama Suri N, Prakash H 2008 Game Theoretic Problems in Network Economics and Mechanism Design Solutions. Advanced Information and Knowledge Processing Series, (London: Springer)
59. Nisan N 2007 Introduction to mechanism design (for computer scientists). In E Tardos, N Nisan, T Roughgarden, V Vazerani, (eds.), Algorithmic Game Theory (New York, USA: Cambridge University Press) 209-242
60. Nisan N, Ronen A 2000 Computationally feasible VCG mechanisms. In 2nd ACM Conference on Electronic Commerce (EC' 00), New York 242-252
61. Nisan N, Ronen A 2001 Algorithmic mechanism design. Games and Economic Behaviour 35:166-196
62. Nisan N, Roughgarden T, Tardos E, Vazerani V 2007 Algorithmic Game Theory. Cambridge University Press
63. Nisan N 1999 Algorithms for selfish agents, mechanism design for distributed computation. In 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), Heidelberg 1-15
64. Paul Klemperer 2004 Auctions: Theory and Practice. The Toulouse Lectures in Economics. Princeton University Press
65. Pekec A, Rothkopf M H 2003 Combinatorial auction design. Management Sci. 49: 1485-1503
66. Prakash H V, Narahari Y 2005 A strategy-proof auction mechanism for grid scheduling with self-ish entities. In 2nd International Conference on Web Information Systems and Technologies (WEBIST'05), Satubal, Portugal 178-183
67. Roughgarden T 2005 Selfish Routing and the Price of Anarchy. (Cambridge: The MIT Press)
68. Satterthwaite M A 1975 Strategy-proofness and arrow's conditions: Existence and correspondence theorem for voting procedure and social welfare functions. J. Econ. Theory 10: 187-217
69. Suri Rama N 2006 Design of incentive compatible broadcast protocols for wireless ad-hoc networks. Technical report, Master's Dissertation, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
70. The Nobel Foundation 2007 The Sveriges Riksbank Prize in Economic Sciences in memory of Alfred Nobel 2007: Scientific Background. Technical report. The Nobel Foundation, Stockholm, Sweden
71. Varian H R 1995 Economic mechanism design for computerized agents. In 1st USENIX Workshop on Electronic Commerce Berkeley, CA, USA
72. Vickrey W 1961 Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1): 8-37
73. Walsh W E, Wellman M P, Wurman P R, MacKie-Mason J K 1998 Some economics of market-based distributed scheduling. In ICDCS'98: Proceedings of the The 18th International Conference on Distributed Computing Systems, (Washington, DC, USA: IEEE Computer Society) 612
74. Walsh W E, Wellman M P, Ygge F 2000 Combinatorial auctions for supply chain formation. In 2nd ACM Conference on Electronic Commerce (EC '00), Minneapolis, Minnesota 260-269
75. Walsh W E, Wellman M P 2003 Decentralized supply chain formation: A market protocol and competitive equilibrium analysis. J. Artificial Intell. Res. 19: 513-567
76. Wang W, Xiang-Yang Li, Wang Y 2004 Truthful multicast routing in selfish wireless networks. In MobiCom'04: Proceedings of the 10th annual international conference on Mobile computing and networking, (New York, USA: ACM) 245-259
77. Wolfstetter E 1996 Auctions: An introduction. Econ. Surv. 10: 367-421