Computationally Limited Agents in Auctions
暂无分享,去创建一个
[1] Moshe Tennenholtz,et al. Mechanism design for resource bounded agents , 2000, Proceedings Fourth International Conference on MultiAgent Systems.
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Tuomas Sandholm,et al. Issues in Computational Vickrey Auctions , 2000, Int. J. Electron. Commer..
[4] Tuomas Sandholm,et al. An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.
[5] Tuomas Sandholm,et al. Deliberation in Equilibrium: Bargaining in Computationally Complex Problems , 2000, AAAI/IAAI.
[6] Y. Shoham,et al. Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .
[7] H. Simon,et al. A Behavioral Model of Rational Choice , 1955 .
[8] Shlomo Zilberstein,et al. Monitoring and control of anytime algorithms: A dynamic programming approach , 2001, Artif. Intell..
[9] A. Rubinstein. Modeling Bounded Rationality , 1998 .
[10] Paul R. Milgrom,et al. Auctions and Bidding: A Primer , 1989 .
[11] Eric Horvitz,et al. Reasoning about beliefs and actions under computational resource constraints , 1987, Int. J. Approx. Reason..