Skip to main content
SpringerLink
Log in

A note on the permutationally convex games

  • Published:
Theory and Decision Aims and scope Submit manuscript

Abstract

If marginal worth vector of a game for an ordering is in the core, the game does not have to be a p.c. game.

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

Access this article

Log in via an institution

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. Granot, D. and Huberman, G.: 1982, ‘The relationship between convex games and minimum spanning tree games: A case for permutationally convex games’,SIAM Journal of Algebra and Discrete Methods 3, 288–292.

    Google Scholar 

  2. Ichiishi, T.: 1981, ‘Super-modularity: Application to Convex Games and to Greedy Algorithm for LP’,Journal of Economic Theory 25, 283–286.

    Google Scholar 

  3. Shapley, L. S.: 1971, ‘Core of Convex Games’,Int. J. Game Theory,1, 11–26.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Physical Sciences Department, West Texas State University, 79016, Canyon, TX, USA

    Bahram Alidaee

Authors
  1. Bahram Alidaee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alidaee, B. A note on the permutationally convex games. Theor Decis 30, 109–111 (1991). https://doi.org/10.1007/BF00134118

Download citation

  • Issue Date:

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

Keywords

Search

Navigation