Optimal Strategies in the Game with Arbitrator

Authors

  • Alexander E. Mentcher Transbaikal State University

Abstract

The organization of negotiations by using arbitration procedures is an actual problem in game theory. We consider a non-cooperative zero-sum game, related with an arbitration scheme, generalized well known final-offer procedure. The nash equilibrium in this game in mixed strategies is found.

Keywords:

game, arbitration procedure, equilibrium, mixed strategies

Downloads

Download data is not yet available.

References

Farber, H. (1980). An Analysis of Final-Offer Arbitration. Journal of Conflict Resolution, 35, 683–705.

Chatterjee, K. (1981). Comparison of Arbitration Procedures: Models with Complete and Incomplete Information. IEEE Trans. Systems, Man, Cybernetics, 1981, 11(2), 101–109.

Kilgour, D. M. (1994). Game-Theoretic Properties of Final-Offer Arbitration. Group Decision and Negotiations, 3, 285–301.

Mazalov, V. V., Mentcher, A. E., Tokareva, J. S. (2005). On a Discrete Arbitration Procedure in Three Points. Game Theory and Applications, 11, 87–91. New-York: Nova Science Publishers.

Mazalov, V. V., Mentcher, A. E., Tokareva, J. S. (2006). On A Discrete Arbitration Procedure. Scientiae Mathematicae Japonicae, 63(3), 325–330.

Mentcher, A. E. (2009). On A Discrete Arbitration Procedure with Nonuniform Distribution. Mathematical Game Theory and Applications, 4(1), 78–91 (in Russian).

Downloads

Published

2022-08-21

How to Cite

Mentcher, A. E. . (2022). Optimal Strategies in the Game with Arbitrator. Contributions to Game Theory and Management, 6. Retrieved from https://gametheory.spbu.ru/article/view/14231

Issue

Vol. 6 (2013)

Section

Articles

License

Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.