IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v213y2011i1p210-220.html
   My bibliography  Save this article

An average lexicographic value for cooperative games

Author

Listed:
  • Tijs, Stef
  • Borm, Peter
  • Lohmann, Edwin
  • Quant, Marieke

Abstract

For games with a non-empty core the Alexia value is introduced, a value which averages the lexicographic maxima of the core. It is seen that the Alexia value coincides with the Shapley value for convex games, and with the nucleolus for strongly compromise admissible games and big boss games. For simple flow games, clan games and compromise stable games an explicit expression and interpretation of the Alexia value is derived. Furthermore it is shown that the reverse Alexia value, defined by averaging the lexicographic minima of the core, coincides with the Alexia value for convex games and compromise stable games.

Suggested Citation

  • Tijs, Stef & Borm, Peter & Lohmann, Edwin & Quant, Marieke, 2011. "An average lexicographic value for cooperative games," European Journal of Operational Research, Elsevier, vol. 213(1), pages 210-220, August.
  • Handle: RePEc:eee:ejores:v:213:y:2011:i:1:p:210-220
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(11)00236-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    2. Ehud Kalai & Eitan Zemel, 1982. "Totally Balanced Games and Games of Flow," Mathematics of Operations Research, INFORMS, vol. 7(3), pages 476-478, August.
    3. Brânzei, R. & Tijs, S.H., 2001. "Additivity Regions for Solutions in Cooperative Game Theory," Other publications TiSEM 11d16301-ce3b-4ba9-93a3-7, Tilburg University, School of Economics and Management.
    4. Tijs, S.H., 2005. "The First Steps with Alexia, the Average Lexicographic Value," Discussion Paper 2005-123, Tilburg University, Center for Economic Research.
    5. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    6. Yevgenia Apartsin & Ron Holzman, 2003. "The core and the bargaining set in glove-market games," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(2), pages 189-204, December.
    7. Tijs, S.H., 2005. "The First Steps with Alexia, the Average Lexicographic Value," Other publications TiSEM 0b4f9565-59f7-477f-b8f8-9, Tilburg University, School of Economics and Management.
    8. Muto, S. & Nakayama, M. & Potters, J.A.M. & Tijs, S.H., 1988. "On big boss games," Other publications TiSEM 488a314a-179c-4628-91e6-7, Tilburg University, School of Economics and Management.
    9. Marieke Quant & Peter Borm & Hans Reijnierse & Bas van Velzen, 2005. "The core cover in relation to the nucleolus and the Weber set," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 491-503, November.
    10. Quant, Marieke & Borm, Peter & Hendrickx, Ruud & Zwikker, Peter, 2006. "Compromise solutions based on bankruptcy," Mathematical Social Sciences, Elsevier, vol. 51(3), pages 247-256, May.
    11. Caprari, E. & Tijs, S.H. & Torre, A., 2008. "Weighted Average Lexicographic Values for Share Sets and Balanced Cooperative Games," Other publications TiSEM 71235183-d284-48b9-84da-c, Tilburg University, School of Economics and Management.
    12. Potters, Jos & Poos, Rene & Tijs, Stef & Muto, Shigeo, 1989. "Clan games," Games and Economic Behavior, Elsevier, vol. 1(3), pages 275-293, September.
    13. Tijs, S.H. & Lipperts, F.A.S., 1982. "The hypercube and the core cover of N-person cooperative games," Other publications TiSEM f86cf523-f36d-4652-b774-6, Tilburg University, School of Economics and Management.
    14. Lohmann, E.R.M.A. & Borm, P.E.M. & Quant, M., 2007. "A Stroll with Alexia," Discussion Paper 2007-52, Tilburg University, Center for Economic Research.
    15. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    16. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
    17. Potters, J.A.M. & Poos, R. & Tijs, S.H. & Muto, S., 1989. "Clan games," Other publications TiSEM 1855e4e3-7392-4ef0-a073-8, Tilburg University, School of Economics and Management.
    18. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    19. Reijnierse, J.H. & Maschler, M.B. & Potters, J.A.M. & Tijs, S.H., 1996. "Simple flow games," Other publications TiSEM 1627a9be-de9d-4905-b68a-1, Tilburg University, School of Economics and Management.
    20. Reijnierse, Hans & Maschler, Michael & Potters, Jos & Tijs, Stef, 1996. "Simple Flow Games," Games and Economic Behavior, Elsevier, vol. 16(2), pages 238-260, October.
    21. Caprari, E. & Tijs, S.H. & Torre, A., 2008. "Weighted Average Lexicographic Values for Share Sets and Balanced Cooperative Games," Discussion Paper 2008-8, Tilburg University, Center for Economic Research.
    22. Brânzei, R. & Tijs, S.H., 2001. "Additivity Regions for Solutions in Cooperative Game Theory," Discussion Paper 2001-81, Tilburg University, Center for Economic Research.
    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. Richard Startz & Kwok Ping Tsang, 2014. "On the Present Value Model in a Cross Section of Stocks," Working Papers e07-47, Virginia Polytechnic Institute and State University, Department of Economics.
    2. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    3. Bahel, Eric & Gómez-Rúa, María & Vidal-Puga, Juan, 2020. "Stability in shortest path problems," MPRA Paper 98504, University Library of Munich, Germany.
    4. 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.
    5. Grabisch, Michel & Sudhölter, Peter, 2018. "On a class of vertices of the core," Games and Economic Behavior, Elsevier, vol. 108(C), pages 541-557.
    6. Xiaojin Sun & Kwok Ping Tsang, 2013. "Housing Markets, Regulations and Monetary Policy," Working Papers e07-45, Virginia Polytechnic Institute and State University, Department of Economics.
    7. Kamijo, Yoshio & Kongo, Takumi, 2012. "Whose deletion does not affect your payoff? The difference between the Shapley value, the egalitarian value, the solidarity value, and the Banzhaf value," European Journal of Operational Research, Elsevier, vol. 216(3), pages 638-646.
    8. Trudeau, Christian & Vidal-Puga, Juan, 2017. "On the set of extreme core allocations for minimal cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 169(C), pages 425-452.
    9. Chen, Haoxun, 2017. "Undominated nonnegative excesses and core extensions of transferable utility games," European Journal of Operational Research, Elsevier, vol. 261(1), pages 222-233.
    10. Loe Schlicher & Marco Slikker & Geert‐Jan van Houtum, 2017. "Probabilistic resource pooling games," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 531-546, October.
    11. Eric Bahel, 2014. "On the core and bargaining set of a veto game," Working Papers e07-48, Virginia Polytechnic Institute and State University, Department of Economics.
    12. Jian Li & Jian-qiang Wang & Jun-hua Hu, 2019. "Interval-valued n-person cooperative games with satisfactory degree constraints," 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. 27(4), pages 1177-1194, December.
    13. Li, Deng-Feng, 2012. "A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers," European Journal of Operational Research, Elsevier, vol. 223(2), pages 421-429.
    14. Bahel, Eric & Trudeau, Christian, 2014. "Stable lexicographic rules for shortest path games," Economics Letters, Elsevier, vol. 125(2), pages 266-269.
    15. 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.
    16. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    17. Miguel Ángel Mirás Calvo & Carmen Quinteiro Sandomingo & Estela Sánchez Rodríguez, 2020. "The boundary of the core of a balanced game: face games," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(2), pages 579-599, June.
    18. Rogna, Marco, 2021. "The central core and the mid-central core as novel set-valued and point-valued solution concepts for transferable utility coalitional games," Mathematical Social Sciences, Elsevier, vol. 109(C), pages 1-11.
    19. An, Qingxian & Wen, Yao & Ding, Tao & Li, Yongli, 2019. "Resource sharing and payoff allocation in a three-stage system: Integrating network DEA with the Shapley value method," Omega, Elsevier, vol. 85(C), pages 16-25.

    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. Lohmann, E.R.M.A. & Borm, P.E.M. & Quant, M., 2007. "A Stroll with Alexia," Discussion Paper 2007-52, Tilburg University, Center for Economic Research.
    2. Marieke Quant & Peter Borm & Hans Reijnierse & Bas van Velzen, 2005. "The core cover in relation to the nucleolus and the Weber set," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 491-503, November.
    3. Quant, M. & Borm, P.E.M. & Reijnierse, J.H. & van Velzen, S., 2003. "Compromise Stable TU-Games," Other publications TiSEM 01a28f48-0b1b-43f9-8dac-3, Tilburg University, School of Economics and Management.
    4. Platz, T.T. & Hamers, H.J.M. & Quant, M., 2011. "Characterizing Compromise Stability of Games Using Larginal Vectors," Discussion Paper 2011-058, Tilburg University, Center for Economic Research.
    5. A. Estévez-Fernández & P. Borm & M. G. Fiestras-Janeiro & M. A. Mosquera & E. Sánchez-Rodríguez, 2017. "On the 1-nucleolus," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 309-329, October.
      • Estévez-Fernández , M.A. & Borm, Peter & Fiestras, & Mosquera, & Sanchez,, 2017. "On the 1-nucleolus," Other publications TiSEM a8ce6687-c87a-4131-98f7-3, Tilburg University, School of Economics and Management.
    6. Trine Platz & Herbert Hamers & Marieke Quant, 2014. "C-complete sets for compromise stable games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(2), pages 213-223, October.
    7. E. Sánchez-Rodríguez & P. Borm & A. Estévez-Fernández & M. Fiestras-Janeiro & M. Mosquera, 2015. "$$k$$ k -core covers and the core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(2), pages 147-167, April.
    8. Gong, Doudou & Dietzenbacher, Bas & Peters, Hans, 2021. "Two-bound core games and the nucleolus," Research Memorandum 020, Maastricht University, Graduate School of Business and Economics (GSBE).
    9. Funaki, Y. & Tijs, S.H. & Brânzei, R., 2007. "Leximals, the Lexicore and the Average Lexicographic Value," Discussion Paper 2007-97, Tilburg University, Center for Economic Research.
    10. Quant, Marieke & Borm, Peter & Hendrickx, Ruud & Zwikker, Peter, 2006. "Compromise solutions based on bankruptcy," Mathematical Social Sciences, Elsevier, vol. 51(3), pages 247-256, May.
    11. A. Estévez-Fernández & M. Fiestras-Janeiro & M. Mosquera & E. Sánchez-Rodríguez, 2012. "A bankruptcy approach to the core cover," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(3), pages 343-359, December.
    12. Schouten, Jop & Dietzenbacher, Bas & Borm, Peter, 2019. "The Nucleolus and Inheritance of Properties in Communication Situations," Other publications TiSEM bacc7f47-9b6b-4ce4-9f97-4, Tilburg University, School of Economics and Management.
    13. 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.
    14. Rodica Branzei & Dinko Dimitrov & Stef Tijs, 2008. "Convex Games Versus Clan Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 363-372.
    15. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    16. Brânzei, R. & Tijs, S.H., 2001. "Cooperative Games with a Simpicial Core," Other publications TiSEM 95a380ab-c3ad-419a-8425-5, Tilburg University, School of Economics and Management.
    17. Brânzei, R. & Tijs, S.H., 2001. "Cooperative Games with a Simpicial Core," Discussion Paper 2001-80, Tilburg University, Center for Economic Research.
    18. Louis de Mesnard, 2015. "The three wives problem and Shapley value," Post-Print hal-01091714, HAL.
    19. Branzei, Rodica & Dimitrov, Dinko & Tijs, Stef, 2011. "Convex games, clan games, and their marginal games," Center for Mathematical Economics Working Papers 368, Center for Mathematical Economics, Bielefeld University.
    20. Grundel, S. & Borm, P.E.M. & Hamers, H.J.M., 2011. "A Compromise Stable Extension of Bankruptcy Games : Multipurpose Resource Allocation," Other publications TiSEM b1926d6b-22f4-4f28-84a2-9, Tilburg University, School of Economics and Management.

    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:eee:ejores:v:213:y:2011:i:1:p:210-220. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.