2005
Bibliographic References tagged with 2005
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
D. C. Parkes and J. R. Kalagnanam,
“Models for Iterative Multiattribute Procurement Auctions”, Management Science, vol. 51, pp. 435–451, 2005.
D. C. Parkes and J. R. Kalagnanam,
“Models for Iterative Multiattribute Procurement Auctions”, Management Science, vol. 51, pp. 435–451, 2005.
J. Bredin and D. C. Parkes,
“Models for Truthful Online Double Auctions”, in Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI’05), 2005, pp. 50–59.
J. Bredin and D. C. Parkes,
“Models for Truthful Online Double Auctions”, in Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI’05), 2005, pp. 50–59.
S. Lahaie, F. Constantin, and D. C. Parkes,
“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), 2005, pp. 959–964.
S. Lahaie, F. Constantin, and D. C. Parkes,
“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), 2005, pp. 959–964.
M. T. Hajiaghayi, R. Kleinberg, M. Mahdian, and D. C. Parkes,
“Online Auctions with Re-usable Goods”, in Proc. 6th ACM Conf. on Electronic Commerce (EC’05), 2005, pp. 165–174.
M. T. Hajiaghayi, R. Kleinberg, M. Mahdian, and D. C. Parkes,
“Online Auctions with Re-usable Goods”, in Proc. 6th ACM Conf. on Electronic Commerce (EC’05), 2005, pp. 165–174.
D. C. Parkes and T. Sandholm,
“Optimize-and-Dispatch Architecture for Expressive Ad Auctions”, in Proceedings of First Workshop on Sponsored Search Auctions, 2005.
D. C. Parkes and T. Sandholm,
“Optimize-and-Dispatch Architecture for Expressive Ad Auctions”, in Proceedings of First Workshop on Sponsored Search Auctions, 2005.
F. Constantin and D. C. Parkes,
“Preference-Based Characterizations of Truthfulness and the Limited Expressiveness of Order-Based Domains”, in Proc. Workshop on Preference Handling, Edinburgh, Scotland, 2005, p. 2.
F. Constantin and D. C. Parkes,
“Preference-Based Characterizations of Truthfulness and the Limited Expressiveness of Order-Based Domains”, in Proc. Workshop on Preference Handling, Edinburgh, Scotland, 2005, p. 2.
J. Corbo and D. C. Parkes,
“The Price of Selfish Behavior in Bilateral Network Formation”, in Proc. 24rd ACM Symp. on Principles of Distributed Computing (PODC’05), Las Vegas, Nevada, USA, 2005, pp. 99–107.
J. Corbo and D. C. Parkes,
“The Price of Selfish Behavior in Bilateral Network Formation”, in Proc. 24rd ACM Symp. on Principles of Distributed Computing (PODC’05), Las Vegas, Nevada, USA, 2005, pp. 99–107.
A. Anandalingam, J. R. Kalagnanam, D. C. Parkes, M. Rothkopf, and T. Sandholm,
Special Issue on Electronic Markets, vol. 51, no. 3. INFORMS, 2005.
A. Anandalingam, J. R. Kalagnanam, D. C. Parkes, M. Rothkopf, and T. Sandholm,
Special Issue on Electronic Markets, vol. 51, no. 3. INFORMS, 2005.
R. Cavallo et al.,
“TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges”, in Multidisciplinary Workshop on Advances in Preference Handling (IJCAI), 2005.
R. Cavallo et al.,
“TBBL: A Tree-Based Bidding Language for Iterative Combinatorial Exchanges”, in Multidisciplinary Workshop on Advances in Preference Handling (IJCAI), 2005.
J. Shneidman et al.,
“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, 2005.
J. Shneidman et al.,
“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, 2005.