15 research outputs found
On the complexity of problems on simple games
Simple games cover voting systems in which a single alternative, such
as a bill or an amendment, is pitted against the status quo. A simple game
or a yes–no voting system is a set of rules that specifies exactly which
collections of “yea” votes yield passage of the issue at hand, each of these
collections of “yea” voters forms a winning coalition. We are interested in
performing a complexity analysis on problems defined on such families of
games. This analysis as usual depends on the game representation used as
input. We consider four natural explicit representations: winning, losing,
minimal winning, and maximal losing. We first analyze the complexity of
testing whether a game is simple and testing whether a game is weighted.
We show that, for the four types of representations, both problems can be
solved in polynomial time. Finally, we provide results on the complexity
of testing whether a simple game or a weighted game is of a special type.
We analyze strongness, properness, decisiveness and homogeneity, which
are desirable properties to be fulfilled for a simple game. We finalize
with some considerations on the possibility of representing a game in a
more succinct representation showing a natural representation in which
the recognition problem is hard.Preprin
Dimension and codimension of simple games
This paper studies the complexity of computing a representation of a simple
game as the intersection (union) of weighted majority games, as well as, the
dimension or the codimension. We also present some examples with linear
dimension and exponential codimension with respect to the number of players.Comment: 5 page
On the complexity of exchanging
We analyze the computational complexity of the problem of deciding
whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions.Peer ReviewedPostprint (author’s final draft
Cooperation through social influence
We consider a simple and altruistic multiagent system in which the agents are eager to perform a collective task but where their real engagement depends on the willingness to perform the task of other influential agents. We model this scenario by an influence game, a cooperative simple game in which a team (or coalition) of players succeeds if it is able to convince enough agents to participate in the task (to vote in favor of a decision). We take the linear threshold model as the influence model. We show first the expressiveness of influence games showing that they capture the class of simple games. Then we characterize the computational complexity of various problems on influence games, including measures (length and width), values (Shapley-Shubik and Banzhaf) and properties (of teams and players). Finally, we analyze those problems for some particular extremal cases, with respect to the propagation of influence, showing tighter complexity characterizations.Peer ReviewedPostprint (author’s final draft
Simple games versus weighted voting games: Bounding the critical threshold value
A simple game is given by a set of players and a partition
of~ into a set~ of losing coalitions~ with value
that is closed under taking subsets and a set of winning
coalitions with . Simple games with are exactly the
weighted voting games. We show that for every simple
game , confirming the conjecture of Freixas and Kurz (IJGT, 2014). For
complete simple games, Freixas and Kurz conjectured that .
We prove this conjecture up to a factor. We also prove that for graphic
simple games, that is, simple games in which every minimal winning coalition
has size~2, computing is \NP-hard, but polynomial-time solvable if the
underlying graph is bipartite. Moreover, we show that for every graphic simple
game, deciding if .Comment: 10 pages; the paper is a follow-up and merge of arXiv:1805.02192 and
arXiv:1806.0317
Forms of representation for simple games: sizes, conversions and equivalences
Simple games are cooperative games in which the benefit that a coalition may have is always binary, i.e., a coalition may either win or loose. This paper surveys different forms of representation of simple games, and those for some of their subfamilies like regular games and weighted games. We analyze the forms of representations that have been proposed in the literature based on different data structures for sets of sets. We provide bounds on the computational resources needed to transform a game from one form of representation to another one. This includes the study of the problem of enumerating the fundamental families of coalitions of a simple game. In particular we prove that several changes of representation that require exponential time can be solved with polynomial-delay and highlight some open problems.Peer ReviewedPostprint (author’s final draft
Contributions to Game Theory and Management. Vol. III. Collected papers presented on the Third International Conference Game Theory and Management.
The collection contains papers accepted for the Third International Conference Game Theory and Management (June 24-26, 2009, St. Petersburg University, St. Petersburg, Russia). The presented papers belong to the field of game theory and its applications to management. The volume may be recommended for researches and post-graduate students of management, economic and applied mathematics departments.