Skip to main content

Computer Modeling of Secretary Problem and Its Interesting Results

  • Conference paper
  • First Online:
Informatics in Schools. Fundamentals of Computer Science and Software Engineering (ISSEP 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11169))

  • 1286 Accesses

Abstract

A methodics of composing research work in programming for middle school students (1–2 years of programming experience) is offered in this article. This methodics is demonstrated using one interesting problem: secretary problem, or marriage problem. This problem is too complex to be theoretically solved in school and comprises probability theory and calculus. However it can be easy modeled using programming and it allows many modifications that can be invented by students. Moreover, results of such computer modeling allow to make non-trivial practical conclusions about decision making and optimal of choice strategies.

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. Secretary problem formulation. https://en.wikipedia.org/wiki/Secretary_problem#cite_note-2

  2. Goldstein, D.G., et al.: Learning in the Repeated Secretary Problem. Microsoft Research (2017). arXiv:1708.08831v1 [cs.GT]

  3. Ferguson, T.S.: Who solved the secretary problem? Stat. Sci. 4(3), 282–289 (1989)

    Article  MathSciNet  Google Scholar 

  4. Freeman, P.R.: The secretary problem and its extensions: a review. Int. Stat. Rev. 51(2), 189–206 (1983)

    Article  MathSciNet  Google Scholar 

  5. Bearden, J.N.: A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psychol. 50, 58–9 (2006). https://doi.org/10.1016/j.jmp.2005.11.003

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Valeriia Nemychnikova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Starunova, O., Nemychnikova, V., Dronzik, A. (2018). Computer Modeling of Secretary Problem and Its Interesting Results. In: Pozdniakov, S., Dagienė, V. (eds) Informatics in Schools. Fundamentals of Computer Science and Software Engineering. ISSEP 2018. Lecture Notes in Computer Science(), vol 11169. Springer, Cham. https://doi.org/10.1007/978-3-030-02750-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02750-6_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02749-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics