A Faster Optimal Allocation Algorithm in Combinatorial Auctions
暂无分享,去创建一个
[1] Arne Andersson,et al. Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.
[2] C. Plott,et al. A BINARY CONFLICT ASCENDING PRICE (BICAP) MECHANISM FOR THE DECENTRALIZED ALLOCATION OF THE RIGHT TO USE RAILROAD TRACKS. , 1996 .
[3] Moshe Tennenholtz. Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.
[4] Noam Nisan,et al. An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.
[5] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[6] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[7] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[8] David Levine,et al. CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.
[9] S. Clearwater. Market-based control: a paradigm for distributed resource allocation , 1996 .
[10] Daniel Lehmann,et al. Linear Programming helps solving large multi-unit combinatorial auctions , 2002, ArXiv.
[11] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[12] Subhash Suri,et al. BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..
[13] Paul R. Milgrom,et al. Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.
[14] S. Rassenti,et al. A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .