Bidtree ordering in IDA* Combinatorial auction winner-determination with side constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2531, Issue , 2002, Pages 17-33

  Collins, John ^a   Demir, Güleser ^a,b   Gini, Maria ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b DOKUZ EYLUL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC COMMERCE; QUERY PROCESSING;

BRANCHING FACTORS; COMBINATORIAL AUCTION; PRECEDENCE CONSTRAINTS; SEARCH TREES; SIDE CONSTRAINTS; WINNER DETERMINATION;

INTELLIGENT AGENTS;

EID: 84921441375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36378-5_2     Document Type: Conference Paper

References (17)

1. Arne Andersson, Mattias Tenhunen, and Fredrik Ygge. Integer programming for combinatorial auction winner determination. In Proc. of 4th Int’l Conf on Multi- Agent Systems, pages 39-46, July 2000.
2. John Collins. Solving Combinatorial Auctions with Temporal Constraints in Economic Agents. PhD thesis, University of Minnesota, June 2002.
3. John Collins and Maria Gini. An integer programming formulation of the bid evaluation problem for coordinated tasks. In Brenda Dietrich and Rakesh V. Vohra, editors, Mathematics of the Internet: E-Auction and Markets, volume 127 of IMA Volumes in Mathematics and its Applications, pages 59-74. Springer-Verlag, New York, 2001.
4. John Collins, Maria Gini, and Bamshad Mobasher. Multi-agent negotiation using combinatorial auctions with precedence constraints. Technical Report 02-009, University of Minnesota, Department of Computer Science and Engineering, Minneapolis, Minnesota, February 2002.
5. John Collins, Wolfgang Ketter, and Maria Gini. A multi-agent negotiation testbed for contracting tasks with temporal and precedence constraints. Int’l Journal of Electronic Commerce, 2002.
6. John Collins, Ben Youngdahl, Scott Jamison, Bamshad Mobasher, and Maria Gini. A market architecture for multi-agent contracting. In Proc. of the Second Int’l Conf. on Autonomous Agents, pages 285-292, May 1998.
7. Yuzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proc. of the 16th Joint Conf. on Artificial Intelligence, 1999.
8. Alyssa Glass and Barbara J. Grosz. Socially conscious decision-making. In Proc. of the Fourth Int’l Conf. on Autonomous Agents, pages 217-224, June 2000.
9. Holger H. Hoos and Craig Boutilier. Solving combinatorial auctions using stochastic local search. In Proc. of the Seventeen Nat’l Conf. on Artificial Intelligence, pages 22-29, 2000.
10. Luke Hunsberger and Barbara J. Grosz. A combinatorial auction for collaborative planning. In Proc. of 4th Int’l Conf on Multi-Agent Systems, pages 151-158, Boston, MA, 2000. IEEE Computer Society Press.
11. Averill M Law and W. David Kelton. Simulation Modeling and Analysis. McGraw- Hill, second edition, 1991.
12. Noam Nisan. Bidding and allocation in combinatorial auctions. In 1999 NWU Microeconomics Workshop, 1999.
13. David C. Parkes and Lyle H. Ungar. An auction-based method for decentralized train scheduling. In Proc. of the Fifth Int’l Conf. on Autonomous Agents, pages 43-50, Montreal, Quebec, May 2001. ACM Press.
14. S. J. Rassenti, V. L. Smith, and R. L. Bulfin. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics, 13:402-417, 1982.
15. Michael H. Rothkopf, Alexander Pekeč, and Ronald M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147, 1998.
16. Tuomas Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, 2002.
17. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, and David Levine. CABOB: A fast optimal algorithm for combinatorial auctions. In Proc. of the 17th Joint Conf. on Artificial Intelligence, Seattle, WA, USA, August 2001.