Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
暂无分享,去创建一个
[1] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[2] Tuomas Sandholm,et al. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.
[3] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[4] Mark Allen Weiss,et al. Data structures and algorithm analysis in Ada , 1993 .
[5] Jeremy P. Spinrad,et al. An O(n2 algorithm for circular-arc graph recognition , 1993, SODA '93.
[6] Mark Allen Weiss,et al. Data structures and algorithm analysis in C , 1991 .
[7] Rolf H. Möhring,et al. An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..
[8] T. Sandholm. Limitations of the Vickrey Auction in Computational Multiagent Systems , 1996 .
[9] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[10] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[11] Tuomas Sandholm,et al. eMediator: A Next Generation Electronic Commerce Server , 1999, AGENTS '00.
[12] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[13] S. Rassenti,et al. A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .
[14] Noam Nisan,et al. Bidding and Allocation in Combinatorial Auctions Preliminary Version , 1999 .