Ruggiero Cavallo, David C. Parkes, Adam I. Juda, Adam Kirsch, Alex Kulesza, Sébastien Lahaie, Benjamin Lubin, Loizos Michael, and Jeffrey Shneidman. 2005. “TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges.” In Multidisciplinary Workshop on Advances in Preference Handling (IJCAI).

Jeffrey Shneidman, Chaki Ng, David C. Parkes, Alvin AuYoung, Alex C. Snoeren, Amin Vahdat, and Brent Chun. 2005. “Why Markets Could (But Don’t Currently) Solve Resource Allocation Problems in Systems.” In Proc. 10th Workshop on Hot Topics in Operating Systems (HotOS-X). Santa Fe, NM.

Peyman Faratin, David C. Parkes, Juan A. Rodriguez-Aguilar, and William E Walsh. 2004. Agent Mediated Electronic Commerce V. Edited by Peyman Faratin, David C. Parkes, Juan A. Rodriguez-Aguilar, and William E Walsh. Springer-Verlag.

Sébastien Lahaie and David C. Parkes. 2004. “Applying Learning Algorithms to Preference Elicitation.” In Proceedings of the 5th ACM Conference on Electronic Commerce, Pp. 180–188. ACM Press.

William E. Walsh, David C. Parkes, and Rajarshi Das. 2004. “Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium.” In Agent Mediated Electronic Commerce (LNAI 3048), edited by Peyman Faratin, David C. Parkes, Juan A. Rodriguez-Aguilar, and William E Walsh, Pp. 109. Springer-Verlag.

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.

Jeffrey Shneidman, David C. Parkes, and Laurent Massoulie. 2004. “Faithfulness in Internet Algorithms.” In Proc. SIGCOMM Workshop on Practice and Theory of Incentives and Game Theory in Networked Systems (PINS’04), Pp. 220-227. Portland, USA.

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.

Saurabh Sanghvi and David C. Parkes. 2004. “Hard-to-Manipulate Combinatorial Auctions”.

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.

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.

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.

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.

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.