2005

2005
Geoffrey Mainland, David C. Parkes, and Matt Welsh. 2005. “Adaptive Resource Allocation for Sensor Networks.” In Proc. 2nd USENIX/ACM Symposium on Networked Systems Design and Implementation (NSDI’05), 2: Pp. 315-328.
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.
Brent N. Chun, Philip Buonadonna, Alvin AuYoung, Chaki Ng, David C. Parkes, Jeffrey Shneidman, Alex C. Snoeren, and Amin Vahdat. 2005. “Mirage: A Microeconomic Resource Allocation System for SensorNet Testbeds.” In Proceedings of 2nd IEEE Workshop on Embedded Networked Sensors (EmNetsII), Pp. 19-28.
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.