Mechanism Design

2005
Mohammad T. Hajiaghayi, Robert Kleinberg, Mohammad Mahdian, and David C. Parkes. 2005. “Online Auctions with Re-usable Goods.” In Proc. 6th ACM Conf. on Electronic Commerce (EC'05), Pp. 165–174. Download
Florin Constantin and David C. Parkes. 2005. “Preference-Based Characterizations of Truthfulness and the Limited Expressiveness of Order-Based Domains.” In Proc. Workshop on Preference Handling, Pp. 2. Edinburgh, Scotland. Download
2004
Mohammad T. Hajiaghayi, Robert Kleinberg, and David C. Parkes. 2004. “Adaptive Limited-Supply Online Auctions.” In Proc. ACM Conf. on Electronic Commerce, Pp. 71–80. Download
David C. Parkes, Satinder Singh, and Dimah Yanovsky. 2004. “Approximately Efficient Online Mechanism Design.” In Proc. 18th Annual Conf. on Neural Information Processing Systems (NIPS'04), Pp. 1049-1056. Download
Ed Naim. 2004. “Consensus Mechanisms: Anytime Strategyproof Mechanisms for Combinatorial Auctions”. Download
David C. Parkes and Jeffrey Shneidman. 2004. “Distributed Implementations of Vickrey-Clarke-Groves Mechanisms.” In Proc. 3rd Int. Joint Conf. on Autonomous Agents and Multi Agent Systems, Pp. 261–268. Download
David C. Parkes and Grant Schoenebeck. 2004. “GrowRange: Anytime VCG-Based Mechanisms.” In Proc. 19th National Conference on Artificial Intelligence (AAAI'04), Pp. 34–41. Download
Saurabh Sanghvi and David C. Parkes. 2004. “Hard-to-Manipulate Combinatorial Auctions”. Download
David C. Parkes. 2004. “On Learnable Mechanism Design.” In Collectives and the Design of Complex Systems, edited by Kagan Tumer and David Wolpert, Pp. 107–131. Springer-Verlag. Download
Jeffrey Shneidman and David C. Parkes. 2004. “Specification Faithfulness in Networks with Rational Nodes.” In Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC'04), Pp. 88-97. St. John's, Canada. Download
2003
Anshul Kothari, David C. Parkes, and Subhash Suri. 2003. “Approximately-Strategyproof and Tractable Multi-Unit Auctions.” In Fourth ACM Conf. on Electronic Commerce (EC'03), Pp. 166–175. Download
Rajdeep K Dash, Nicholas R. Jennings, and David C. Parkes. 2003. “Computational-Mechanism Design: A Call to Arms.” IEEE Intelligent Systems, Pp. 40–47. Download
David C. Parkes and Satinder Singh. 2003. “An MDP-Based Approach to Online Mechanism Design.” In Proc. 17th Annual Conf. on Neural Information Processing Systems (NIPS'03), Pp. 791-798. Download
Eric Friedman and David C. Parkes. 2003. “Pricing WiFi at Starbucks– Issues in Online Mechanism Design.” In Fourth ACM Conf. on Electronic Commerce (EC'03), Pp. 240–241. Download
Jason Woodard and David C. Parkes. 2003. “Strategyproof Mechanisms for Ad Hoc Network Formation (Extended Abstract).” In 1st Workshop on Economics of Peer-to-Peer Systems, Pp. 1-5. Download
Jeffrey Shneidman and David C. Parkes. 2003. “Using Redundancy to Improve Robustness of Distributed Mechanism Implementations.” In Fourth ACM Conf. on Electronic Commerce (EC'03), Pp. 276–277. Download
Chaki Ng, David C. Parkes, and Margo Seltzer. 2003. “Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation.” In Fourth ACM Conf. on Electronic Commerce (EC'03), Pp. 238–239. Download
2002
Julian A. Padget, David C. Parkes, Norman M. Sadeh, Onn Shehory, and William E. Walsh. 2002. Agent Mediated Electronic Commerce IV: Designing Mechanisms and Systems, AAMAS 2002 Workshop. Edited by Julian A. Padget, David C. Parkes, Norman M. Sadeh, Onn Shehory, and William E. Walsh. Springer-Verlag. Download
David C. Parkes. 2002. “Challenge Problem: Agent-Mediated Decentralized Information Mechanisms.” In Proc. AAMAS'02 Workshop on AgentCities: Challenges in Open Agent Environments. Bologna, Italy. Download
Chaki Ng, David C. Parkes, and Margo Seltzer. 2002. “Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation”. Download

Pages