IDEAS home Printed from https://ideas.repec.org/p/hig/wpaper/247-ec-2021.html
   My bibliography  Save this paper

Set-weighted games and their application to the cover problem

Author

Listed:
  • Vasily V. Gusev

    (National Research University Higher School of Economics)

Abstract

The cover of a transport, social, or communication network is a computationally complex problem. To deal with it, this paper introduces a special class of simple games in which the set of minimal winning coalitions coincides with the set of least covers. A distinctive feature of such a game is that it has a weighted form, in which weights and quota are sets rather than real numbers. This game class is termed set-weighted games. A real-life network has a large number of least covers, therefore this paper develops methods for analyzing set-weighted games in which the weighted form is taken into account. The necessary and sufficient conditions for a simple game to be a set-weighted game were found. The vertex cover game (Gusev, 2020) was shown to belong to the set-weighted game class, and its weighted form was found. The set-weighted game class has proven to be closed under operations of union and intersection, which is not the case for weighted games. The sample object is the transport network of a district in Petrozavodsk, Russia. A method is suggested for efficiently deploying surveillance cameras at crossroads so that all transport network covers are taken into account.

Suggested Citation

  • Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.
    • Handle: RePEc:hig:wpaper:247/ec/2021
    as

    Download full text from publisher

    File URL: https://wp.hse.ru/data/2021/06/23/1429589966/247EC2021.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Veremyev, Alexander & Sorokin, Alexey & Boginski, Vladimir & Pasiliao, Eduardo L., 2014. "Minimum vertex cover problem for coupled interdependent networks with cascading failures," European Journal of Operational Research, Elsevier, vol. 232(3), pages 499-511.
    2. Annick Laruelle & Federico Valenciano, 2001. "Shapley-Shubik and Banzhaf Indices Revisited," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 89-104, February.
    3. Li, Yuchao & Yang, Zishen & Wang, Wei, 2017. "Complexity and algorithms for the connected vertex cover problem in 4-regular graphs," Applied Mathematics and Computation, Elsevier, vol. 301(C), pages 107-114.
    4. Einy, Ezra & Haimanko, Ori, 2011. "Characterization of the Shapley–Shubik power index without the efficiency axiom," Games and Economic Behavior, Elsevier, vol. 73(2), pages 615-621.
    5. Dennis Leech, 2003. "Computing Power Indices for Large Voting Games," Management Science, INFORMS, vol. 49(6), pages 831-837, June.
    6. David S. Johnson & Lee Breslau & Ilias Diakonikolas & Nick Duffield & Yu Gu & MohammadTaghi Hajiaghayi & Howard Karloff & Mauricio G. C. Resende & Subhabrata Sen, 2020. "Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs," Operations Research, INFORMS, vol. 68(3), pages 896-926, May.
    7. Alonso-Meijide, J.M. & Casas-Méndez, B. & Fiestras-Janeiro, M.G., 2015. "Computing Banzhaf–Coleman and Shapley–Shubik power indices with incompatible players," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 377-387.
    8. Josep Freixas & Sascha Kurz, 2014. "Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum," Annals of Operations Research, Springer, vol. 222(1), pages 317-339, November.
    9. 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.
    10. Bolus, Stefan, 2011. "Power indices of simple games and vector-weighted majority games by means of binary decision diagrams," European Journal of Operational Research, Elsevier, vol. 210(2), pages 258-272, April.
    11. Michela Chessa, 2014. "A generating functions approach for computing the Public Good index efficiently," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 658-673, July.
    12. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    13. Vincent Mak & Darryl A. Seale & Amnon Rapoport & Eyran J. Gisches, 2019. "Voting Rules in Sequential Search by Committees: Theory and Experiments," Management Science, INFORMS, vol. 65(9), pages 4349-4364, September.
    14. Dubey, Pradeep & Einy, Ezra & Haimanko, Ori, 2005. "Compound voting and the Banzhaf index," Games and Economic Behavior, Elsevier, vol. 51(1), pages 20-30, April.
    15. Freixas, Josep & Marciniak, Dorota & Pons, Montserrat, 2012. "On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices," European Journal of Operational Research, Elsevier, vol. 216(2), pages 367-375.
    16. Lawrence Diffo Lambo & Joël Moulen, 2002. "Ordinal equivalence of power notions in voting games," Theory and Decision, Springer, vol. 53(4), pages 313-325, December.
    17. Abbas Bazzi & Samuel Fiorini & Sebastian Pokutta & Ola Svensson, 2019. "No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 147-172, February.
    18. Crama, Yves & Leruth, Luc, 2007. "Control and voting power in corporate networks: Concepts and computational aspects," European Journal of Operational Research, Elsevier, vol. 178(3), pages 879-893, May.
    19. Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
    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. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
    2. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    3. Yuto Ushioda & Masato Tanaka & Tomomi Matsui, 2022. "Monte Carlo Methods for the Shapley–Shubik Power Index," Games, MDPI, vol. 13(3), pages 1-14, June.
    4. Freixas, Josep & Kurz, Sascha, 2013. "The golden number and Fibonacci sequences in the design of voting structures," European Journal of Operational Research, Elsevier, vol. 226(2), pages 246-257.
    5. Pongou, Roland & Tchantcho, Bertrand & Tedjeugang, Narcisse, 2014. "Power theories for multi-choice organizations and political rules: Rank-order equivalence," Operations Research Perspectives, Elsevier, vol. 1(1), pages 42-49.
    6. Berghammer, Rudolf & Bolus, Stefan & Rusinowska, Agnieszka & de Swart, Harrie, 2011. "A relation-algebraic approach to simple games," European Journal of Operational Research, Elsevier, vol. 210(1), pages 68-80, April.
    7. André Casajus & Frank Huettner, 2019. "The Coleman–Shapley index: being decisive within the coalition of the interested," Public Choice, Springer, vol. 181(3), pages 275-289, December.
    8. Karos, Dominik & Peters, Hans, 2015. "Indirect control and power in mutual control structures," Games and Economic Behavior, Elsevier, vol. 92(C), pages 150-165.
    9. Pongou, Roland & Tchantcho, Bertrand & Tedjeugang, Narcisse, 2015. "Trial-Based Tournament: Rank and Earnings," MPRA Paper 65582, University Library of Munich, Germany.
    10. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers hal-04447373, HAL.
    11. Marc Levy & Ariane Szafarz, 2017. "Cross-Ownership: A Device for Management Entrenchment?," Review of Finance, European Finance Association, vol. 21(4), pages 1675-1699.
    12. Friedman, Jane & Parker, Cameron, 2018. "The conditional Shapley–Shubik measure for ternary voting games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 379-390.
    13. Fabrice Barthelemy & Mathieu Martin & Bertrand Tchantcho, 2011. "Some conjectures on the two main power indices," THEMA Working Papers 2011-14, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    14. Levy, Marc, 2011. "The Banzhaf index in complete and incomplete shareholding structures: A new algorithm," European Journal of Operational Research, Elsevier, vol. 215(2), pages 411-421, December.
    15. M. J. Albizuri & A. Goikoetxea, 2021. "The Owen–Shapley Spatial Power Index in Three-Dimensional Space," Group Decision and Negotiation, Springer, vol. 30(5), pages 1027-1055, October.
    16. Josep Freixas & Montserrat Pons, 2017. "Using the Multilinear Extension to Study Some Probabilistic Power Indices," Group Decision and Negotiation, Springer, vol. 26(3), pages 437-452, May.
    17. Ori Haimanko, 2019. "Composition independence in compound games: a characterization of the Banzhaf power index and the Banzhaf value," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(3), pages 755-768, September.
    18. Stefano Benati & Giuseppe Vittucci Marzetti, 2021. "Voting power on a graph connected political space with an application to decision-making in the Council of the European Union," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 733-761, November.
    19. André Casajus, 2014. "Collusion, quarrel, and the Banzhaf value," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 1-11, February.
    20. Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2010. "Applying relation algebra and RelView to measures in a social network," European Journal of Operational Research, Elsevier, vol. 202(1), pages 182-195, April.

    More about this item

    Keywords

    simple games; set-weighted games; vertex covergame; cover problem; cooperative generating functions; power indexes;
    All these keywords.

    JEL classification:

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

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hig:wpaper:247/ec/2021. 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: Shamil Abdulaev or Shamil Abdulaev (email available below). General contact details of provider: https://edirc.repec.org/data/hsecoru.html .

    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.