Skip to main content

Advertisement

Log in

Voting in collective best-choice problem with complete information

  • Mathematical Game Theory and Applications
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper considers a noncooperative m-player best-choice game with complete information about the quality parameters of incoming candidates. Collective decision-making is based on voting. The optimal threshold strategies and payoffs of the players are found depending on the voting threshold. The results of numerical simulation are presented.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Gnedin, A.V., Multicriteria Problem of Optimal Stopping of the Selection Process, Autom. Remote Control, 1981, vol. 42, no. 7, pp. 981–986.

    MathSciNet  MATH  Google Scholar 

  2. Mazalov, V.V. and Falko, A.A., Voting in Best-Choice Problem with Rank Criterion, Obozr. Prikl. Promyshl. Mat., 2006, vol. 13, no. 4, pp. 577–588.

    Google Scholar 

  3. Mazalov, V.V. and Falko, A.A., Arbitration Procedure in the m-Person Best-Choice Problem, Vestn. SPbGU, 2008, ser. 10, no. 4, pp. 52–59.

    MathSciNet  Google Scholar 

  4. Baston, V. and Garnaev, A., Competition for Staff between Two Departments, Game Theory Appl., 2005, vol. 10, pp. 13–26.

    MathSciNet  MATH  Google Scholar 

  5. Ferguson, T., Selection by Committee, Ann. Int. Soc. Dynamic Games, 2005, vol. 7, pp. 203–209.

    Article  MathSciNet  MATH  Google Scholar 

  6. Mazalov, V. and Banin, M., N-Person Best-Choice Game with Voting, Game Theory Appl., 2003, vol. 9, pp. 45–53.

    MathSciNet  MATH  Google Scholar 

  7. Mazalov, V., Nosalskaya, T., and Tokareva, J., Stochastic Cake Division Protocol, Int. Game Theory Rev., 2014, vol. 16, no. 2, p. 1440009.

    Article  MathSciNet  MATH  Google Scholar 

  8. Mazalov, V., Sakaguchi, M., and Zabelin, A., Multistage Arbitration Game with Random Offers, Game Theory Appl., 2002, vol. 8, pp. 95–106.

    MathSciNet  MATH  Google Scholar 

  9. Sakaguchi, M., Optimal Stopping Games Where Players Have Weighted Privilege, Ann. Int. Soc. Dynamic Games, 2005, vol. 7, pp. 285–294.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. A. Ivashko.

Additional information

Original Russian Text © A.A. Ivashko, 2015, published in Matematicheskaya Teoriya Igr i Ee Priloszheniya, 2015, No. 2, pp. 3–13.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ivashko, A.A. Voting in collective best-choice problem with complete information. Autom Remote Control 77, 1461–1467 (2016). https://doi.org/10.1134/S0005117916080129

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117916080129

Navigation