Skip to main content

Designing Bidding Strategies in Sequential Auctions for Risk Averse Agents: A Theoretical and Experimental Investigation

  • Conference paper

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 13))

Abstract

Designing efficient bidding strategies for sequential auctions remains an important, open problem area in agent-mediated electronic markets. In existing literature, a variety of bidding strategies have been proposed and have been shown to perform with increasing degrees of efficiency. However, most of strategies proposed so far do not explicitly model bidders’ attitudes towards risk which, in mainstream economic literature, is considered an essential attribute in modeling agent preferences and decision making under uncertainty. This paper studies the effect that risk profiles (modeled through the standard Arrow-Pratt risk aversion measure), have on the bidders’ strategies in sequential auctions.

We model the sequential bidding decision process as an MDP and we analyze, for a category of expectations of future price distributions, the effect that a bidder’s risk aversion profile has on her decision-theoretic optimal bidding policy. This analysis is performed separately for the case of first-price and second-price sequential auctions. Next, we simulate the above strategies, and we study the effect that an agent’s risk aversion has on the chances of winning the desired items. We conclude the paper with an experimental study of how the presence of risk-averse bidders in a market affects allocation efficiency and expected seller revenue.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Osepayshvili, A., Wellman, M.P., Reeves, D.M., MacKie-Mason, J.K.: Self-confirming price prediction for bidding in simultaneous ascending auctions. In: Proc. of the 21st Conf. on Uncertainty in AI (UAI-2005) (2005)

    Google Scholar 

  2. Arrow, K.J.: Aspects of the Theory of Risk-Bearing. Y. Hahnsson Foundation, Helsinki (1965)

    Google Scholar 

  3. Babanov, A., Collins, J., Gini, M.: Harnessing the search for rational bid schedules with stochastic search. In: Kudenko, D., Kazakov, D., Alonso, E. (eds.) AAMAS 2004. LNCS (LNAI), vol. 3394, pp. 355–368. Springer, Heidelberg (2005)

    Google Scholar 

  4. Boutilier, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: Proc. of the 16th Int. Joint Conf. on AI (IJCAI-1999), Stockholm, pp. 527–534 (1999)

    Google Scholar 

  5. Green, W.H.: Econometric Analysis. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  6. Greenwald, A., Boyan, J.: Bidding under uncertainty: Theory and experiments. In: Proceedings of the 20th Conf. on Uncertainty in AI (UAI-2004), pp. 209–216 (2004)

    Google Scholar 

  7. Jiang, A.X., Leyton-Brown, K.: Bidding agents for online auctions with hidden bids. Machine Learning (2007)

    Google Scholar 

  8. Juda, A., Parkes, D.: An options-based method to solve the composability problem in sequential auctions. In: Faratin, P., Rodríguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS (LNAI), vol. 3435, pp. 44–58. Springer, Heidelberg (2006)

    Google Scholar 

  9. Liu, Y., Goodwin, R., Koenig, S.: Risk-averse auction agents. In: Proc. of AAMAS 2003, Melbourne, Australia, pp. 353–360 (2003)

    Google Scholar 

  10. Mas-Collel, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  11. Milgrom, P.: Putting Auction Theory to Work. Cambridge University Press, Cambridge (2004)

    Google Scholar 

  12. Milgrom, P., Weber, R.J.: A theory of auctions and competitive bidding - part 2. Economic Theory of Auctions (2000)

    Google Scholar 

  13. Paarsch, H.J., Hong, H.: An Introduction to the Structural Econometrics of Auction Data. MIT Press, Cambridge (2006)

    Google Scholar 

  14. Reeves, D.M., Wellman, M.P., MacKie-Mason, J.K., Osepayshvili, A.: Exploring bidding strategies for market based scheduling. Decision Support Syst. 39, 67–85 (2005)

    Article  Google Scholar 

  15. ’t.Hoen, P.J., La Poutré, J.A.: Repeated auctions with complementarities. In: La Poutré, H., Sadeh, N.M., Janson, S. (eds.) AMEC 2005 and TADA 2005. LNCS (LNAI), vol. 3937. Springer, Heidelberg (2006)

    Google Scholar 

  16. Vytelingum, P., Dash, R.K., David, E., Jennings, N.R.: A risk-based bidding strategy for continuous double auctions. In: Proc. of 16th ECAI, Valencia, Spain, pp. 79–83 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robu, V., La Poutré, H. (2008). Designing Bidding Strategies in Sequential Auctions for Risk Averse Agents: A Theoretical and Experimental Investigation. In: Collins, J., et al. Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis. AMEC TADA 2007 2007. Lecture Notes in Business Information Processing, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88713-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88713-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88712-6

  • Online ISBN: 978-3-540-88713-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics