Skip to main content
Log in

Permutation games: Another class of totally balanced games

  • Theoretical Papers
  • Published:
Operations-Research-Spektrum Aims and scope Submit manuscript

Summary

A class of cooperative games in characteristic function form arising from certain sequencing problems and assignment problems, is introduced. It is shown that games of this class are totally balanced. In the proof of this fact we use the Birkhoff-von Neumann theorem on doubly stochastic matrices and the Bondareva-Shapley theorem on balanced games. It turns out that this class of permutation games coincides with the class of totally balanced games if the number of players is smaller than four. For larger games the class of permutation games is a nonconvex subset of the convex cone of totally balanced games.

Zusammenfassung

Wir führen eine Klasse von kooperativen Spielen in charakteristischer Funktionsform ein, die bei gewissen Folgeproblemen und Zuordnungsproblemen auftreten. Wir zeigen, daß diese Spiele vollständig balanciert sind. Zum Beweis verwenden wir den Satz von Birkhoff-von Neumann über doppelt stochastische Matrizen und den Satz von Bondareva-Shaplex über balancierte Spiele. Es zeigt sich, daß diese Klasse von Permutationsspielen mit der Klasse von vollständig balancierten Spiele übereinstimmt, falls die Zahl der Spieler kleiner als vier ist. Für größere Spiele ist die Klasse der Permutationsspiele eine nichtkonvexe Teilmenge des konvexen Kegels der vollständig balancierten Spiele.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Billera LJ (1981) Economic market games. Game theory and its applications. Proceedings of Symposia in Applied Mathematics 24:37–53

    Article  Google Scholar 

  2. Birkhoff G (1948) Lattice theory. Revised edition Am Math Soc Coll Series 25:266

    Google Scholar 

  3. Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games (in Russian). Probl Kibern 10:119–139

    Google Scholar 

  4. Dubey P, Shapley L (1982) Totally balanced games arising from controlled programming problems. Discussion paper

  5. Granot D, Huberman G (1981) Minimum cost spanning tree games. Math Programming 21:1–18

    Article  Google Scholar 

  6. Kalai E, Zemel E (1982) Totally balanced games and games of flow. Math Oper Res 7:476–478

    Article  Google Scholar 

  7. Kalai E, Zemel E (1982) Generalized network problems yielding totally balanced games. Oper Res 30:998–1008

    Article  Google Scholar 

  8. Neumann J von (1953) A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games II:5–12

    Google Scholar 

  9. Owen G (1975) On the core of linear production games. Math Programming 9:358–370

    Article  Google Scholar 

  10. Shapley LS (1967) On balanced sets and cores. Nav Res Logistics Q 14:453–460

    Article  Google Scholar 

  11. Shapley LS (1983) Private Communication

  12. Shapley L, Scarf H (1974) On cores and indivisibility. J Math Econom 1:23–37

    Article  Google Scholar 

  13. Shapley LS, Shubik M (1969) On market games. J Econom Theory 1:9–25

    Article  Google Scholar 

  14. Shapley LS, Shubik M (1972) The assignment game I: The core. Int J Game Theory 1:111–130

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tijs, S.H., Parthasarathy, T., Potters, J.A.M. et al. Permutation games: Another class of totally balanced games. OR Spektrum 6, 119–123 (1984). https://doi.org/10.1007/BF01721088

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01721088

Keywords

Navigation