Bidding Algorithms for Simultaneous Auctions: A Case Study
暂无分享,去创建一个
[1] Peter Stone,et al. Autonomous Bidding Agents in the Trading Agent Competition , 2001, IEEE Internet Comput..
[2] Subhash Suri,et al. Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations , 2000, AAAI/IAAI.
[3] Bruce Abramson,et al. Expected-Outcome: A General Model of Static Evaluation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[4] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[5] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[6] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[7] Gerald Tesauro,et al. On-line Policy Improvement using Monte-Carlo Search , 1996, NIPS.
[8] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[9] D. Cliff,et al. Zero is Not Enough: On The Lower Limit of Agent Intelligence For Continuous Double Auction Markets† , 1997 .
[10] Amy Greenwald,et al. Bidding algorithms for simultaneous auctions , 2001, EC '01.
[11] A. Greenwald. Bid Determination in Simultaneous Auctions , 2007 .
[12] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[13] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[14] Shou-De Lin,et al. A trading agent competition , 2000 .