Publications

2004
Rui Dong, Terry Tai, Wilfred Yeung, and David C. Parkes. 2004. “HarTAC– The Harvard TAC SCM’03 Agent.” In Proc. Second Workshop on Trading Agent Design and Analysis (TADA’04), Pp. 1–8. New York, USA.
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.
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.
Geoffrey Mainland, Laura Kang, Sébastien Lahaie, David C. Parkes, and Matt Welsh. 2004. “Using Virtual Markets to Program Global Behavior in Sensor Networks.” In Proc. 11th ACM SIGOPS European Workshop, Pp. 1. Leuven, Belgium.
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.
Rajdeep K Dash, Nicholas R. Jennings, and David C. Parkes. 2003. “Computational-Mechanism Design: A Call to Arms.” IEEE Intelligent Systems, Pp. 40–47.
David C. Parkes. 2003. “Five AI Challenges in Strategyproof Computing.” In Proc. IJCAI’03 Workshop on Autonomic Computing. Aculpulco, Mexico.
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.
Aditya V. Sunderam and David C. Parkes. 2003. “Preference Elicitation in Proxied Multiattribute Auctions.” In Fourth ACM Conf. on Electronic Commerce (EC’03), Pp. 214–215.
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.
Jeffrey Shneidman and David C. Parkes. 2003. “Rationality and Self-Interest in Peer to Peer Networks.” In 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03), Pp. 139–148.
Chaki Ng, David C. Parkes, and Margo Seltzer. 2003. “Strategyproof Computing: Systems Infrastructures for Self-Interested Parties.” In 1st Workshop on Economics of Peer-to-Peer Systems. Berkeley, CA.
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.
James Aspnes, Joan Feigenbaum, Michael Mitzenmacher, and David C. Parkes. 2003. “Towards Better Definitions and Measures of Internet Security.” In Proc. Workshop on Large-Scale-Network Security and Deployment Obstacles. Landsdowne VA.
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.
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.
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.
David C. Parkes and Lyle H. Ungar. 2002. “An Ascending-Price Generalized Vickrey Auction.” In Proc. Stanford Institute for Theoretical Economics Workshop on The Economics of the Internet. Stanford, CA.
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.
David C. Parkes. 2002. “On Indirect and Direct Implementations of Core Outcomes in Combinatorial Auctions”.

Pages