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

A new approach to the core and Weber set of multichoice games

Author

Listed:
  • Michel Grabisch
  • Lijue Xie

Abstract

Multichoice games have been introduced by Hsiao and Raghavan as a generalization of classical cooperative games. An important notion in cooperative game theory is the core of the game, as it contains the rational imputations for players. We propose two definitions for the core of a multichoice game, the first one is called the precore and is a direct generalization of the classical definition. We show that the precore coincides with the definition proposed by Faigle, and that the set of imputations may be unbounded, which makes its application questionable. A second definition is proposed, imposing normalization at each level, causing the core to be a convex compact set. We study its properties, introducing balancedness and marginal worth vectors, and defining the Weber set and the pre-Weber set. We show that the classical properties of inclusion of the (pre)core into the (pre)-Weber set as well as their coincidence in the convex case remain valid. A last section makes a comparison with the core defined by Van den Nouweland et al. Copyright Springer-Verlag 2007

Suggested Citation

  • Michel Grabisch & Lijue Xie, 2007. "A new approach to the core and Weber set of multichoice games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 491-512, December.
  • Handle: RePEc:spr:mathme:v:66:y:2007:i:3:p:491-512
    DOI: 10.1007/s00186-007-0159-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-007-0159-8
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-007-0159-8?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. 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).
    2. Derks, J J M, 1992. "A Short Proof of the Inclusion of the Core in the Weber Set," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(2), pages 149-150.
    3. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
    4. Hsiao Chih-Ru & Raghavan T. E. S., 1993. "Shapley Value for Multichoice Cooperative Games, I," Games and Economic Behavior, Elsevier, vol. 5(2), pages 240-256, April.
    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. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    2. Sylvain Béal & Adriana Navarro-Ramos & Eric Rémila & Philippe Solal, 2023. "Sharing the cost of hazardous transportation networks and the Priority Shapley value," Working Papers hal-04222245, HAL.
    3. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    4. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00344802, HAL.
    5. David Lowing & Kevin Techer, 2022. "Marginalism, egalitarianism and efficiency in multi-choice games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 815-861, November.
    6. Michel Grabisch & Peter Sudhölter, 2016. "Characterizations of solutions for games with precedence constraints," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01297600, HAL.
    7. Jin, Yuhui & Chang, Chuei-Tin & Li, Shaojun & Jiang, Da, 2018. "On the use of risk-based Shapley values for cost sharing in interplant heat integration programs," Applied Energy, Elsevier, vol. 211(C), pages 904-920.
    8. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    9. Branzei, R. & Tijs, S. & Zarzuelo, J., 2009. "Convex multi-choice games: Characterizations and monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 198(2), pages 571-575, October.
    10. Techer, Kevin, 2021. "Stable agreements through liability rules: A multi-choice game approach to the social cost problem," Mathematical Social Sciences, Elsevier, vol. 111(C), pages 77-88.
    11. David Lowing & Kevin Techer, 2021. "Marginalism, Egalitarianism and E ciency in Multi-Choice Games," Working Papers halshs-03334056, HAL.
    12. David Lowing & Makoto Yokoo, 2023. "Sharing values for multi-choice games: an axiomatic approach," Working Papers hal-04018735, HAL.
    13. David Lowing, 2023. "Cost allocation in energy distribution networks," Working Papers hal-03680156, HAL.
    14. Yu-Hsien Liao, 2018. "The precore: converse consistent enlargements and alternative axiomatic results," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 146-163, April.

    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. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    2. Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the shapley value: a new approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 153-167, February.
    3. Faigle, U. & Grabisch, M. & Heyne, M., 2010. "Monge extensions of cooperation and communication structures," European Journal of Operational Research, Elsevier, vol. 206(1), pages 104-110, October.
    4. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    5. Derks, Jean, 2005. "A new proof for Weber's characterization of the random order values," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 327-334, May.
    6. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Post-Print halshs-00344802, HAL.
    7. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    8. Michel Grabisch, 2006. "Capacities and Games on Lattices: A Survey of Result," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00179830, HAL.
    9. 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.
    10. Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2023. "Properties of Solutions for Games on Union-Closed Systems," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    11. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    12. Lijue Xie & Michel Grabisch, 2009. "The core of games on k-regular set systems," Documents de travail du Centre d'Economie de la Sorbonne 09055, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Oct 2009.
    13. Peters Hans & Zank H., 1999. "A Class of Methods for Evaluating Multiattribute Utilities," Research Memorandum 034, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Bilbao, J.M. & Jiménez, N. & López, J.J., 2010. "The selectope for bicooperative games," European Journal of Operational Research, Elsevier, vol. 204(3), pages 522-532, August.
    15. Branzei, R. & Tijs, S. & Zarzuelo, J., 2009. "Convex multi-choice games: Characterizations and monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 198(2), pages 571-575, October.
    16. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," Post-Print hal-01302377, HAL.
    17. Mario Guajardo & Kurt Jörnsten & Mikael Rönnqvist, 2016. "Constructive and blocking power in collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 25-50, January.
    18. Peter Knudsen & Lars Østerdal, 2012. "Merging and splitting in cooperative games: some (im)possibility results," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(4), pages 763-774, November.
    19. Sylvain Béal & Marc Deschamps & Philippe Solal, 2014. "Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games," Working Papers hal-01377926, HAL.
    20. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 2005. "Threshold based discounting networks: The cost allocation provided by the nucleolus," European Journal of Operational Research, Elsevier, vol. 166(1), pages 154-159, October.

    More about this item

    Keywords

    Multichoice game; Lattice; Core;
    All these keywords.

    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:66:y:2007:i:3:p:491-512. 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.