IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v84y1998i0p121-13310.1023-a1018980602195.html
   My bibliography  Save this article

On extreme points of the core and reduced games

Author

Listed:
  • Marina Núñez
  • Carles Rafels

Abstract

Given a balanced cooperative game, we prove that the extreme points of the core have the reduced game property with respect to the Davis and Maschler reduced game. One particular case of this reduction gives when we name marginal games. These games allow us to define the reduced marginal worth vectors, where every player gets his marginal contribution to a successive marginal game. This set of vectors is proved to be the set of extreme points of the core of those balanced games which are almost convex, that is, those balanced games such that all proper subgames are convex. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Marina Núñez & Carles Rafels, 1998. "On extreme points of the core and reduced games," Annals of Operations Research, Springer, vol. 84(0), pages 121-133, December.
    • Handle: RePEc:spr:annopr:v:84:y:1998:i:0:p:121-133:10.1023/a:1018980602195
    DOI: 10.1023/A:1018980602195
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018980602195
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018980602195?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:

    Citations

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


    Cited by:

    1. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 301-326, July.
    2. 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.
    3. 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.
    4. Marina Nunez Oliva & Carlos Rafels Pallarola, 2001. "The extreme core allocations of the assignment game," Working Papers in Economics 65, Universitat de Barcelona. Espai de Recerca en Economia.
    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. Toru Hokari & Yukihiko Funaki & Peter Sudhölter, 2020. "Consistency, anonymity, and the core on the domain of convex games," Review of Economic Design, Springer;Society for Economic Design, vol. 24(3), pages 187-197, December.
    7. Josep Maria Izquierdo Aznar & Francesc Llerena & Carlos Rafels Pallarola, 2004. "Sequential decisions in allocation problems," Working Papers in Economics 116, Universitat de Barcelona. Espai de Recerca en Economia.
    8. Jesús Getán & Josep Izquierdo & Jesús Montes & Carles Rafels, 2015. "The bargaining set for almost-convex games," Annals of Operations Research, Springer, vol. 225(1), pages 83-89, February.
    9. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    10. 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.
    11. 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.
    12. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games," Documents de travail du Centre d'Economie de la Sorbonne 16081, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    13. Michel Grabisch, 2016. "Rejoinder on: Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 335-337, July.
    14. 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.
    15. 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.
    16. Josep Maria Izquierdo & Carles Rafels, 2018. "The core and the steady bargaining set for convex games," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 35-54, March.
    17. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
    18. Michel Grabisch, 2016. "Rejoinder on: Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 335-337, July.

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:annopr:v:84:y:1998:i:0:p:121-133:10.1023/a:1018980602195. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.