IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v70y2009i3p465-475.html
   My bibliography  Save this article

A pairwise-monotonic core selection for permutation games

Author

Listed:
  • Silvia Miquel

Abstract

In this article, a single-valued solution for permutation games is proposed. If we consider that each agent on the permutation game acts both as a buyer and as a seller, a related assignment game with the same reward matrix is defined. In this two-sided related market, the midpoint between the buyers-optimal core allocation and the sellers-optimal core allocation is considered. Then, each agent in the permutation game merges his payoff as a buyer and his payoff as a seller. This solution belongs to the core of the one-sided market and it is pairwise-monotonic. Copyright Springer-Verlag 2009

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:70:y:2009:i:3:p:465-475
    DOI: 10.1007/s00186-008-0281-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-008-0281-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-008-0281-2?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Curiel, I. & Tijs, S.H., 1986. "Assignment games and permutation games," Other publications TiSEM c9a47c3b-28d3-4874-b0a2-f, Tilburg University, School of Economics and Management.
    2. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-479, June.
    3. 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.
    4. Quint, Thomas, 1996. "On One-Sided versus Two-Sided Matching Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 124-134, September.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    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. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Klijn, F., 1997. "Envy-Free Allocations of Indivisible Objects : An Algorithm and an Application," Research Memorandum 751, Tilburg University, School of Economics and Management.
    11. 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.
    12. Andersson, Tommy & Andersson, Christer & Andersson, Ola, 2010. "Sealed Bid Auctions vs. Ascending Bid Auctions: An Experimental Study," Working Papers 2010:17, Lund University, Department of Economics.
    13. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    14. Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
    15. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    16. 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.
    17. Blume, Lawrence E. & Easley, David & Kleinberg, Jon & Tardos, Éva, 2009. "Trading networks with price-setting agents," Games and Economic Behavior, Elsevier, vol. 67(1), pages 36-50, September.
    18. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    19. Marina Núñez & Tamás Solymosi, 2017. "Lexicographic allocations and extreme core payoffs: the case of assignment games," Annals of Operations Research, Springer, vol. 254(1), pages 211-234, July.
    20. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.

    More about this item

    Keywords

    Permutation game; Core; Pairwise-monotonicity; τ-value; 91A12; 91A40;
    All these keywords.

    JEL classification:

    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:spr:mathme:v:70:y:2009:i:3:p:465-475. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.