Repeated Auctions with Complementarities
There is an extensive body of literature concerning optimal bidding strategies for agents participating in single shot auctions for single, individually valued goods. However, it remains a largely open question how a bidder should formulate his bidding strategy when there is a sequence of auctions and, furthermore, there are complementarities in the valuation for the bundle of items acquired in the separate auctions. We investigate conditions for which adjusting the bidding horizon beyond the immediate auction is profitable for a bidder. We show how such a strategy, in the limit, reduces agents to zero marginal profits as predicted by the Bertrand economic theory. We support our experimental results by drawing a parallel to the nIPD.
Unable to display preview. Download preview PDF.
- 2.Anthony, P., Hall, W., Dang, V.D., Jennings, N.R.: Autonomous agents for participating in multiple on-line auctions. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) Workshop on E-Business and the Intelligent Web, pp. 54–64 (2001)Google Scholar
- 3.Axelrod, R.: The Evolution of Co-operation. Basic Books, Inc., New York (1984)Google Scholar
- 4.Boutilier, C., Goldszmidt, M., Sabata, B.: Continuous value function approximation for sequential bidding policies. In: Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 1999), pp. 81–90 (1999)Google Scholar
- 5.Boutilier, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 527–534 (1999)Google Scholar
- 8.Greenwald, A., Boyan, J.: Bidding under uncertainty: Theory and experiments. In: Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence, pp. 209–216 (2004)Google Scholar
- 9.Van Hemert, J.I., La Poutré, J.A.: Dynamic routing problems with fruitful regions: Models and evolutionary computation. In: Proceedings of the eigth conference on Parallel Problem Solving from Nature (PPSN VIII). LNCS, pp. 690–699. Springer, Heidelberg (2004)Google Scholar
- 12.MacKie-Mason, J., Osepayshvili, A., Reeves, D., Wellman, M.: Price prediction strategies for market-based scheduling. In: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 244–252. AAAI Press, Menlo Park (2004)Google Scholar
- 13.Redondo, F.: Game Theory and Economics. Cambridge University Press, Cambridge (2001)Google Scholar
- 14.Sandholm, T.: IJCAI computers and thought award 2003, award talk writeup: Making markets and democracy work: A story of incentives and computing. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 1649–1671 (2003)Google Scholar
- 17.Yao, X., Darwen, P.J.: An experimental study of n-person iterated prisoner’s dilemma games. In: Evo Workshops, pp. 90–108 (1994)Google Scholar