Anshul Kothari, David C. Parkes, and Subhash Suri. 2005. “Approximately-Strategyproof and Tractable Multi-Unit Auctions.” Decision Support Systems, 39, Pp. 105–121.

David C. Parkes. 2005. “Auction Design with Costly Preference Elicitation.” Annals of Mathematics and AI, 44, Pp. 269–302.

David C. Parkes, Ruggiero Cavallo, Nick Elprin, Adam I. Juda, Sebastien Lahaie, Benjamin Lubin, Loizos Michael, Jeffrey Shneidman, and Hassan Sultan. 2005. “ICE: An Iterative Combinatorial Exchange.” In Proc. 6th ACM Conf. on Electronic Commerce (EC’05), Pp. 249–258.

David C. Parkes and Jayant R. Kalagnanam. 2005. “Models for Iterative Multiattribute Procurement Auctions.” Management Science, 51, Pp. 435–451.

Jonathan Bredin and David C. Parkes. 2005. “Models for Truthful Online Double Auctions.” In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI’05), Pp. 50–59.

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.

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.

David C. Parkes and Tuomas Sandholm. 2005. “Optimize-and-Dispatch Architecture for Expressive Ad Auctions.” In Proceedings of First Workshop on Sponsored Search Auctions.

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.

Anand Anandalingam, Jayant R. Kalagnanam, David C. Parkes, Michael Rothkopf, and Tuomas Sandholm. 2005. Special Issue on Electronic Markets. Edited by Anand Anandalingam, Jayant R. Kalagnanam, David C. Parkes, Michael Rothkopf, and Tuomas Sandholm. INFORMS.

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

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.

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.

Jayant R. Kalagnanam and David C. Parkes. 2004. “Auctions, Bidding and Exchange Design.” In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, edited by David Simchi-Levi, S. David Wu, and Max Shen, Pp. 143-212. Kluwer.

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.

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.

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.

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