A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions

  • Andrew Byde
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2232)


In this paper we study algorithms for agents participating in multiple simultaneous auctions for a single private-value good; we use stochastic dynamic programming to derive formal methods for optimal algorithm specification; we study a number of algorithms of complementary complexity and effectiveness, and report preliminary tests on them. The methods and analysis in this paper extend naturally to more complicated scenarios, such as the purchase of multiple complementary goods, although different problem areas bring their own challenges with respect to computational complexity.


Optimal Policy Bidding Strategy Stochastic Dynamic Programming Closing Price Double Auction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Binmore and N. Vulkan. Applying game theory to automated negotiation. Netnomics, 1:1–9, 1999.CrossRefGoogle Scholar
  2. 2.
    C. Boutilier. Sequential optimality and coordination in multi-agent systems. In Proc. IJCAI 99, 1999.Google Scholar
  3. 3.
    C. Boutilier, M. Goldszmidt, and B. Sabata. Continuous value function approximation for sequential bidding policies. In Proc. UAI’ 99, 1999.Google Scholar
  4. 4.
    C. Boutilier, M. Goldszmidt, and B. Sabata. Sequential auctions for the allocation of resources with complementarities. In Proc. IJCAI’ 99, 1999.Google Scholar
  5. 5.
    P. Garcia, E. Giminez, L. Godo, and J. Rodriguez-Aguilar. Possibilistic-based design of bidding strategies in electronic auctions. In Proc. 13th Biennial European Conference on Artificial Intelligence, 1998.Google Scholar
  6. 6.
    S. Gjerstad and J. Dickhaut. Price formation in double auctions. Games and Economic Behaviour, 22(1):1–29, 1998.CrossRefGoogle Scholar
  7. 7.
    P. Klemperer. Auction theory: A guide to the literature. Journal of Economic Surveys, 13(3):227–286, July 1999.CrossRefGoogle Scholar
  8. 8.
    R. P. McAfee and J. McMillan. Auctions and bidding. Journal of Economic Literature, 25:699–738, June 1987.Google Scholar
  9. 9.
    C. Preist, C. Bartolini, and I. Philips. Algorithm design for agents which participate in multiple simultaneous auctions. In F. Dignum and U. Cortes, editors, Agent Mediated Electronic Commerce III, Lecture Notes in AI. Springer Verlag, September 2001.Google Scholar
  10. 10.
    C. Preist, A. Byde, and C. Bartolini. Economic dynamics of agents in multiple auctions. To appear at Autonomous Agents 2001, 2001.Google Scholar
  11. 11.
    N. Vulkan and C. Preist. Automated trading in agents-based markets for communication bandwidth. In Proc. UKMAS, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Andrew Byde
    • 1
  1. 1.HP LabsBristolUK

Personalised recommendations