IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/5f5ec2fe-15f3-4c21-8278-19e438fc43d1.html
   My bibliography  Save this paper

Dominating Set Games

Author

Listed:
  • van Velzen, S.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • van Velzen, S., 2003. "Dominating Set Games," Discussion Paper 2003-039, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:5f5ec2fe-15f3-4c21-8278-19e438fc43d1
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002. "Assignment Games Satisfy the CoMa-Property," Games and Economic Behavior, Elsevier, vol. 38(2), pages 231-239, February.
    2. Xiaotie Deng & Toshihide Ibaraki & Hiroshi Nagamochi, 1999. "Algorithmic Aspects of the Core of Combinatorial Optimization Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 751-766, August.
    3. Daniel Granot & Frieda Granot, 1992. "Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 765-780, November.
    4. Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 339-350.
    5. 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)

    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. 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.
    2. van Velzen, S., 2003. "Dominating Set Games," Other publications TiSEM 5f5ec2fe-15f3-4c21-8278-1, Tilburg University, School of Economics and Management.
    3. 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.
    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. Luis Guardiola & Ana Meca & Justo Puerto, 2020. "Quid Pro Quo allocations in Production-Inventory games," Papers 2002.00953, arXiv.org.
    6. Luis A. Guardiola & Ana Meca & Justo Puerto, 2021. "Enforcing fair cooperation in production-inventory settings with heterogeneous agents," Annals of Operations Research, Springer, vol. 305(1), pages 59-80, October.
    7. 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.
    8. 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.
    9. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "Three-valued simple games," Theory and Decision, Springer, vol. 85(2), pages 201-224, August.
    10. Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
    11. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Pere Villar, Joan, 2002. "Assignment Games Satisfy the CoMa-Property," Games and Economic Behavior, Elsevier, vol. 38(2), pages 231-239, February.
    12. 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.
    13. Koster, M.A.L. & Molina, E. & Sprumont, Y. & Tijs, S.H., 1998. "Core Representations of the Standard Fixed Tree Game," Discussion Paper 1998-21, Tilburg University, Center for Economic Research.
    14. 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.
    15. 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.
    16. Dietzenbacher, Bas, 2018. "Bankruptcy games with nontransferable utility," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 16-21.
    17. 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.
    18. 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.
    19. Dehez, Pierre & Ferey, Samuel, 2013. "How to share joint liability: A cooperative game approach," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 44-50.
    20. Koshevoy, G.A. & Suzuki, T. & Talman, A.J.J., 2014. "Supermodular NTU-games," Discussion Paper 2014-067, Tilburg University, Center for Economic Research.

    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:tiucen:5f5ec2fe-15f3-4c21-8278-19e438fc43d1. 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: http://center.uvt.nl .

    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.