Set-weighted games and their application to the cover problem

DOI10.1016/j.ejor.2022.05.026OpenAlexW4280506920MaRDI QIDQ2083971

V. V. Gusev

Publication date: 17 October 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.026

zbMATH Keywords

game theorysimple gamescover problemcooperative generating functionsset-weighted games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
• Edge covering problem under hybrid uncertain environments
• On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices
• A generating functions approach for computing the public good index efficiently
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• The Shapley-Shubik index for multi-criteria simple games
• A relation-algebraic approach to simple games
• Control and voting power in corporate networks: Concepts and computational aspects
• Non-cooperative facility location and covering games
• On the uniqueness of the Shapley value
• On approximation algorithms for the minimum satisfiability problem
• Ordinal equivalence of power notions in voting games
• Totally balanced combinatorial optimization games
• A note on maximal covering location games
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
• Optimizing with minimum satisfiability
• Minimum vertex cover problem for coupled interdependent networks with cascading failures
• Computation of several power indices by generating functions
• Dimension of complete simple games with minimum
• On the dimension of simple monotonic games
• A Characterization of Weighted Voting
• Characterization of the Banzhaf–Coleman Index
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
• Non-cooperative Facility Location and Covering Games
• A note about games-composition dimension

This page was built for publication: Set-weighted games and their application to the cover problem