IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/1cdf99c9-0e92-4aae-9a92-3720ff7b5926.html
   My bibliography  Save this paper

Convexity and Marginal Vectors

Author

Listed:
  • van Velzen, S.

    (Tilburg University, School of Economics and Management)

  • Hamers, H.J.M.

    (Tilburg University, School of Economics and Management)

  • Norde, H.W.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2002. "Convexity and Marginal Vectors," Other publications TiSEM 1cdf99c9-0e92-4aae-9a92-3, Tilburg University, School of Economics and Management.
  • Handle: RePEc:tiu:tiutis:1cdf99c9-0e92-4aae-9a92-3720ff7b5926
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/542229/53.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Rafels, Carles & Ybern, Neus, 1995. "Even and Odd Marginal Worth Vectors, Owen's Multilinear Extension and Convex Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(2), pages 113-126.
    2. 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.
    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. 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.
    2. 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.
    3. van Velzen, S., 2005. "Cooperation in Networks and Scheduling," Other publications TiSEM 81d927bb-fc40-4306-8f7f-a, Tilburg University, School of Economics and Management.
    4. 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.

    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. Josep Maria Izquierdo Aznar & Carlos Rafels Pallarola, 2002. "Coalitionally Monotonic Set-solutions for Cooperative TU Games," Working Papers in Economics 75, Universitat de Barcelona. Espai de Recerca en Economia.
    2. van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2002. "Convexity and Marginal Vectors," Discussion Paper 2002-53, Tilburg University, Center for Economic Research.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Grabisch, Michel & Sudhölter, Peter, 2014. "On the restricted cores and the bounded core of games on distributive lattices," European Journal of Operational Research, Elsevier, vol. 235(3), pages 709-717.
    8. Dietzenbacher, Bas, 2018. "Bankruptcy games with nontransferable utility," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 16-21.
    9. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Convex Fuzzy Games and Participation Monotonic Allocation Schemes," Discussion Paper 2002-13, Tilburg University, Center for Economic Research.
    10. 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.
    11. Dehez, Pierre & Ferey, Samuel, 2013. "How to share joint liability: A cooperative game approach," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 44-50.
    12. Koshevoy, G.A. & Suzuki, T. & Talman, A.J.J., 2014. "Supermodular NTU-games," Discussion Paper 2014-067, Tilburg University, Center for Economic Research.
    13. 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.
    14. 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.
    15. Oriol Tejada, 2013. "Analysis of the core of multisided Böhm-Bawerk assignment markets," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 189-205, April.
    16. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    17. 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.
    18. Michel Grabisch & Tomáš Kroupa, 2018. "The core of supermodular games on finite distributive lattices," Documents de travail du Centre d'Economie de la Sorbonne 18010, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    19. 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.
    20. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.

    More about this item

    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:tiu:tiutis:1cdf99c9-0e92-4aae-9a92-3720ff7b5926. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.