Set-weighted games and their application to the cover problem

DOI10.1016/J.EJOR.2022.05.026MaRDI QIDQ2083971zbMATH OpenOpenAlexFDO

Authors 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

cooperative generating functionscover problemgame theoryset-weighted gamessimple games

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The Vertex Cover Game
• k-edge-covering game
• On the impact of local taxes in a set cover game
• On the complexity of problems on simple games
• Values of games with weighted graphs

Cites work

• A Characterization of Weighted Voting
• A generating functions approach for computing the public good index efficiently
• A note about games-composition dimension
• A note on maximal covering location games
• A relation-algebraic approach to simple games
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Characterization of the Banzhaf–Coleman Index
• Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
• Computation of several power indices by generating functions
• Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
• Control and voting power in corporate networks: Concepts and computational aspects
• Dimension of complete simple games with minimum
• Edge covering problem under hybrid uncertain environments
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• scientific article; zbMATH DE number 1357433 (Why is no real title available?)
• Minimum vertex cover problem for coupled interdependent networks with cascading failures
• Near-optimal disjoint-path facility location through set cover by pairs
• No small linear program approximates vertex cover within a factor \(2 -\varepsilon\)
• Non-cooperative facility location and covering games
• Non-cooperative Facility Location and Covering Games
• On approximation algorithms for the minimum satisfiability problem
• On the dimension of simple monotonic games
• On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices
• On the uniqueness of the Shapley value
• Optimizing with minimum satisfiability
• Ordinal equivalence of power notions in voting games
• 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
• Totally balanced combinatorial optimization games

Cited in

(4)

• scientific article; zbMATH DE number 6474898 (Why is no real title available?)
• Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds
• scientific article; zbMATH DE number 5485221 (Why is no real title available?)
• Cost sharing and strategyproof mechanisms for set cover games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2083971)