Publications

2005
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.
Jacomo Corbo and David C. Parkes. 2005. “The Price of Selfish Behavior in Bilateral Network Formation.” In Proc. 24rd ACM Symp. on Principles of Distributed Computing (PODC’05), Pp. 99–107. Las Vegas, Nevada, USA.
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).
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.
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.
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.
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.
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”.

Pages