Skip to main content

Online Auction and Optimal Stopping Game with Imperfect Observation

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2020)

Abstract

The paper examines a multi-stage game-theoretic model of an auction where the participants (players) set minimum threshold price levels above which they are ready to sell. Price offerings are a sequence of independent and identically distributed random variables. A two-person game in which each player is interested in selling at a price higher than the competitor’s is considered. Optimal threshold pricing strategies and expected payoffs of the players are determined. Numerical modeling results are presented.

Supported by “The Double-Hundred Talent Plan” of the Shandong Province, China (grant no. WST2017009).

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Solan, E., Vieille, N.: Quitting games. Math. Oper. Res. 26(2), 265–285 (2001). https://doi.org/10.1287/moor.26.2.265.10549

    Article  MathSciNet  MATH  Google Scholar 

  2. Sofronov, G.: An optimal sequential procedure for a multiple selling problem with independent observations. Eur. J. Oper. Res. 225(2), 332–336 (2013). https://doi.org/10.1016/j.ejor.2012.09.042

    Article  MathSciNet  MATH  Google Scholar 

  3. Immorlica, N., Kleinberg, R., Mahdian, M.: Secretary problems with competing employers. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds.) WINE 2006. LNCS, vol. 4286, pp. 389–400. Springer, Heidelberg (2006). https://doi.org/10.1007/11944874_35

    Chapter  Google Scholar 

  4. Alpern, S., Katrantzi, I., Ramsey, D.: Partnership formation with age-dependent preferences. Eur. J. Oper. Res. 225(1), 91–99 (2013). https://doi.org/10.1016/j.ejor.2012.09.012

    Article  MathSciNet  MATH  Google Scholar 

  5. Whitmeyer, M.: A competitive optimal stopping game. B.E. J. Theor. Econ. 18(1), 1–15 (2018). https://doi.org/10.1515/bejte-2016-0128

    Article  MathSciNet  Google Scholar 

  6. Riedel, F.: Optimal stopping with multiple priors. Econometrica 77(3), 857–908 (2009). https://doi.org/10.3982/ECTA7594

    Article  MathSciNet  MATH  Google Scholar 

  7. Harrell, G., Harrison, J., Mao, G., Wang, J.: Online auction and secretary problem. In: International Conference on Scientific Computing, pp. 241–244 (2015)

    Google Scholar 

  8. Seregina, T., Ivashko, A., Mazalov, V.: Optimal stopping strategies in the game “the price is right”. Proc. Steklov Inst. Math. 307(Suppl. 1), 1–15 (2019)

    Google Scholar 

  9. Mazalov, V., Ivashko, A.: Equilibrium in \(n\)-person game of showcase-showdown. Probab. Eng. Inform. Sci. 24, 397–403 (2010). https://doi.org/10.1017/S0269964810000045

    Article  MathSciNet  MATH  Google Scholar 

  10. Tenorio, R., Cason, T.N.: To spin or not to spin? Natural and laboratory experiments from “the price is right”. Econ. J. 112(476), 170–195 (2002). https://doi.org/10.1111/1468-0297.0j678

    Article  Google Scholar 

  11. Bennett, R.W., Hickman, K.A.: Rationality and the “price is right”. J. Econ. Behav. Organ. 21(1), 99–105 (1993). https://doi.org/10.1016/0167-2681(93)90042-N

    Article  Google Scholar 

  12. Porosiński, Z.: Full-information best choice problems with imperfect observation and a random number of observations. Zastos. Matem. 21, 179–192 (1991)

    MathSciNet  MATH  Google Scholar 

  13. Sakaguchi, M.: Best choice problems with full information and imperfect observation. Math. Japonica 29, 241–250 (1984)

    MathSciNet  MATH  Google Scholar 

  14. Enns, E., Ferenstein, E.: On a multi-person time-sequential game with priorities. Sequential Anal. 6, 239–256 (1987). https://doi.org/10.1080/07474948708836129

    Article  MathSciNet  MATH  Google Scholar 

  15. Neumann, P., Porosinski, Z., Szajowski, K.: On two person full-information best choice problem with imperfect information. In: Petrosjan, L.A., Mazalov, V.V. (eds.) Game Theory and Application II, pp. 47–55. Nova Science Publishers, New York (1996)

    Google Scholar 

  16. Mazalov, V., Neumann, P., Falko, I.: Optimal stopping game with imperfect information. Far-Eastern Math. Rep. 6, 74–86 (1998)

    Google Scholar 

  17. Porosiński, Z., Szajowski, K.: Random priority two-person full-information best choice problem with imperfect observation. Applicationes Mathematicae 27(3), 251–263 (2000)

    Article  MathSciNet  Google Scholar 

  18. Ivashko, E., Tchernykh, A., Ivashko, A., Safonov, G.: Cost-efficient strategy in clouds with spot price uncertainty. Matematicheskaya Teoriya Igr i Ee Prilozheniya 11(3), 5–30 (2019)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anna Ivashko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mazalov, V., Ivashko, A. (2020). Online Auction and Optimal Stopping Game with Imperfect Observation. In: Nguyen, N., Jearanaitanakij, K., Selamat, A., Trawiński, B., Chittayasothorn, S. (eds) Intelligent Information and Database Systems. ACIIDS 2020. Lecture Notes in Computer Science(), vol 12033. Springer, Cham. https://doi.org/10.1007/978-3-030-41964-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41964-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41963-9

  • Online ISBN: 978-3-030-41964-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics