Set-weighted games and their application to the cover problem
type: Item
instance of: scholarly article
title: Set-weighted games and their application to the cover problem
author: V. V. Gusev
published in: European Journal of Operational Research
publication date: 2022-10-17T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7602405
zbMATH Keywords: game theory
zbMATH Keywords: simple games
zbMATH Keywords: set-weighted games
zbMATH Keywords: cover problem
zbMATH Keywords: cooperative generating functions
MaRDI profile type: Publication
full work available at URL: j.ejor.2022.05.026
OpenAlex ID: W4280506920
cites work: Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
cites work: Computation of several power indices by generating functions
cites work: No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
cites work: A relation-algebraic approach to simple games
cites work: Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
cites work: Non-cooperative facility location and covering games
cites work: A generating functions approach for computing the public good index efficiently
cites work: Control and voting power in corporate networks: Concepts and computational aspects
cites work: On the dimension of simple monotonic games
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: Totally balanced combinatorial optimization games
cites work: On the uniqueness of the Shapley value
cites work: Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
cites work: On the ordinal equivalence of the Johnston, Banzhaf and Shapley power indices
cites work: A note about games-composition dimension
cites work: Dimension of complete simple games with minimum
cites work: Non-cooperative Facility Location and Covering Games
cites work: Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
cites work: Ordinal equivalence of power notions in voting games
cites work: Optimizing with minimum satisfiability
cites work: Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
cites work: On approximation algorithms for the minimum satisfiability problem
cites work: The Shapley-Shubik index for multi-criteria simple games
cites work: Edge covering problem under hybrid uncertain environments
cites work: Characterization of the Banzhaf–Coleman Index
cites work: A note on maximal covering location games
cites work: A Characterization of Weighted Voting
cites work: Q4700639
cites work: Minimum vertex cover problem for coupled interdependent networks with cascading failures
DOI: 10.1016/J.EJOR.2022.05.026
description: scientific article; zbMATH DE number 7602405