IDEAS home Printed from https://ideas.repec.org/a/wsi/igtrxx/v09y2007i03ns0219198907001503.html
   My bibliography  Save this article

Balancedness Of The Class Of Infinite Permutation Games And Related Classes Of Games

Author

Listed:
  • VITO FRAGNELLI

    (Dipartimento di Scienze e Tecnologie Avanzate, Università del Piemonte Orientale, Via V.Bellini 25/G, 15100 Alessandria, Italy)

  • NATIVIDAD LLORCA

    (CIO and Departamento de Estadística y Matemática Aplicada, Universidad Miguel Hernández de Elche, Avda. de la Universidad s/n, Edificio Torretamarit, 03202 Elche, Spain)

  • STEF TIJS

    (CentER and Department of Econometrics and OR, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands;
    DIMA, Università degli Studi di Genova, Italy)

Abstract

Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization of infinite assignment games. We show that infinite transportation games are balanced via a related assignment game. By using certain core elements of infinite transportation games it can be shown that infinite pooling games have a non-empty core.

Suggested Citation

  • Vito Fragnelli & Natividad Llorca & Stef Tijs, 2007. "Balancedness Of The Class Of Infinite Permutation Games And Related Classes Of Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 9(03), pages 425-435.
    • Handle: RePEc:wsi:igtrxx:v:09:y:2007:i:03:n:s0219198907001503
    DOI: 10.1142/S0219198907001503
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219198907001503
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219198907001503?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Klijn, Flip & Tijs, Stef & Hamers, Herbert, 2000. "Balancedness of permutation games and envy-free allocations in indivisible good economies," Economics Letters, Elsevier, vol. 69(3), pages 323-326, December.
    2. Tijs, S.H. & Parthasarathy, T. & Potters, J.A.M. & Rajendra Prasad, V., 1984. "Permutation games : Another class of totally balanced games," Other publications TiSEM a7edfa18-6224-4be3-b677-5, Tilburg University, School of Economics and Management.
    3. Quint, Thomas, 1996. "On One-Sided versus Two-Sided Matching Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 124-134, September.
    4. Potters, J.A.M. & Tijs, S.H., 1987. "Pooling : Assignment with property rights," Other publications TiSEM 0a83b344-78e2-47b8-99ad-d, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. R. Branzei & E. Gutiérrez & N. Llorca & J. Sánchez-Soriano, 2021. "Does it make sense to analyse a two-sided market as a multi-choice game?," Annals of Operations Research, Springer, vol. 301(1), pages 17-40, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. Tejada, J. & Borm, P.E.M. & Lohmann, E.R.M.A., 2013. "A Unifying Model for Matching Situations," Other publications TiSEM 18155a8c-1961-495d-a20d-f, Tilburg University, School of Economics and Management.
    3. Klijn, Flip & Tijs, Stef & Hamers, Herbert, 2000. "Balancedness of permutation games and envy-free allocations in indivisible good economies," Economics Letters, Elsevier, vol. 69(3), pages 323-326, December.
    4. Lohmann, E.R.M.A., 2012. "Joint decision making and cooperative solutions," Other publications TiSEM 500d8ee1-4f93-4e78-940b-9, Tilburg University, School of Economics and Management.
    5. Silvia Miquel, 2009. "A pairwise-monotonic core selection for permutation games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(3), pages 465-475, December.
    6. Herbert Hamers & Flip Klijn & Marco Slikker & Bas Van Velzen, 2009. "A Cooperative Approach To Queue Allocation Of Indivisible Objects," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 11(02), pages 215-227.
    7. Tamás Solymosi, 2015. "The kernel is in the least core for permutation games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 795-809, December.
    8. Solymosi, Tamas & Raghavan, T. E. S. & Tijs, Stef, 2005. "Computing the nucleolus of cyclic permutation games," European Journal of Operational Research, Elsevier, vol. 162(1), pages 270-280, April.
    9. Tejada, O. & Borm, P. & Lohmann, E., 2014. "A unifying model for matrix-based pairing situations," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 55-61.
    10. Auriol, N. & Marchi, E., 2004. "k-Sided permutation games and multiprices of equilibrium," European Journal of Operational Research, Elsevier, vol. 158(2), pages 506-517, October.
    11. Csóka Péter & Pintér Miklós, 2016. "On the Impossibility of Fair Risk Allocation," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(1), pages 143-158, January.
    12. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    13. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
    14. G. Koshevoy & S. Tijs & S. Miquel, 2006. "Equilibria for Pooling Situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 123-130, April.
    15. Marco Slikker, 2006. "Relaxed sequencing games have a nonempty core," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 235-242, June.
    16. Quint, Thomas, 1997. "Restricted houseswapping games," Journal of Mathematical Economics, Elsevier, vol. 27(4), pages 451-470, May.
    17. R. Branzei & E. Gutiérrez & N. Llorca & J. Sánchez-Soriano, 2021. "Does it make sense to analyse a two-sided market as a multi-choice game?," Annals of Operations Research, Springer, vol. 301(1), pages 17-40, June.
    18. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Research Memorandum FEW 538, Tilburg University, School of Economics and Management.
    19. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Other publications TiSEM 14e21ac6-26af-438e-943b-9, Tilburg University, School of Economics and Management.
    20. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s021919891850007x is not listed on IDEAS
    21. Csóka, Péter & Herings, P. Jean-Jacques & Kóczy, László Á., 2009. "Stable allocations of risk," Games and Economic Behavior, Elsevier, vol. 67(1), pages 266-276, September.

    More about this item

    Keywords

    Cooperative games; infinite programs; core; 90C08; 91A12;
    All these keywords.

    JEL classification:

    • B4 - Schools of Economic Thought and Methodology - - Economic Methodology
    • C0 - Mathematical and Quantitative Methods - - General
    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D5 - Microeconomics - - General Equilibrium and Disequilibrium
    • D7 - Microeconomics - - Analysis of Collective Decision-Making
    • M2 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Economics

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:09:y:2007:i:03:n:s0219198907001503. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/igtr/igtr.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.