Ruggiero Cavallo, David C. Parkes, and Satinder Singh. 2010. “Efficient Mechanisms with Dynamic Populations and Dynamic Types”.

Ian A. Kash and David C. Parkes. 2010. “Impersonation Strategies in Auctions (Short Paper).” In Proceedings of the Sixth Workshop on Internet and Network Economics (WINE’10), Pp. 492-495.

Benjamin Lubin, David C. Parkes, Jeff Kephart, and Rajarshi Das. 2009. “Expressive Power-Based Resource Allocation for Data Centers.” In Twenty-First International Joint Conference on Artificial Intelligence (IJCAI’09), Pp. 1451–1456.

Haoqi Zhang, David C. Parkes, and Yiling Chen. 2009. “Policy Teaching Through Reward Function Learning.” In 10th ACM Electronic Commerce Conference (EC’09), Pp. 295–304.

Erik Schultink, Ruggiero Cavallo, and David C. Parkes. 2008. “Economic hierarchical Q-learning.” In Proc. 23rd AAAI Conference on Artificial Intelligence (AAAI’08), Pp. 689–695.

Sébastien Lahaie and David C. Parkes. 2008. “A Modular Framework for Iterative Combinatorial Auctions.” SIGecom Exchanges, 7.2.

Katherine L. Milkman, James Burns, David C. Parkes, Greg Barron, and Kagan Tumer. 2008. “Testing a Purportedly More Learnable Auction Mechanism.” Applied Economics Research Bulletin, Special Issue I, Pp. 106–141.

Ruggiero Cavallo, David C. Parkes, and Satinder Singh. 2006. “Optimal Coordinated Planning Amongst Self-Interested Agents with Private State.” In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI’06), Pp. 55–62. Cambridge, MA.

Sébastien Lahaie, Florin Constantin, and David C. Parkes. 2005. “More on the Power of Demand Queries in Combinatorial Auctions: Learning Atomic Languages and Handling Incentives.” In Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI’05), Pp. 959–964.

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.

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.

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. 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.

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.

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.

David C. Parkes and Lyle H. Ungar. 1997. “Learning and Adaption in Multiagent Systems.” In Proc. AAAI’97 Multiagent Learning Workshop. Providence, USA.