Minimal Preference Elicitation in Combinatorial Auctions
暂无分享,去创建一个
[1] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[2] E. H. Clarke. Multipart pricing of public goods , 1971 .
[3] Theodore Groves,et al. Incentives in Teams , 1973 .
[4] Subhash Suri,et al. Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.
[5] David Levine,et al. CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.
[6] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[7] Michael P. Wellman,et al. AkBA: a progressive, anonymous-price combinatorial auction , 2000, EC '00.
[8] Tuomas Sandholm,et al. Computationally Limited Agents in Auctions , 2001 .
[9] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[10] Tuomas Sandholm,et al. Issues in Computational Vickrey Auctions , 2000, Int. J. Electron. Commer..
[11] David C. Parkes,et al. Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment , 2000, AAAI/IAAI.
[12] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[13] David C. Parkes,et al. Optimal Auction Design for Agents with Hard Valuation Problems , 1999, Agent Mediated Electronic Commerce.
[14] Phz eMKMLafgZ,et al. iBundle: An Efficient Ascending Price Bundle Auction , 1999 .
[15] David C. Parkes,et al. Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.
[16] David Levine,et al. Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.