AbstractThe main contribution of this paper is the calculation of the dimension of simple games that are a composition of unanimity games via individualism. We also provide a constructive procedure that represent this type of game as an intersection of a number of weighted majority games equal to its dimension. This provides a better way to achieve exponential dimension (in a monotonic setting) than that of Taylor and Zwicker (Simple Games, Desirability Relations, Trading and Pseudoweightings, Princeton University Press, Princeton, NJ, 1999)
Un jeu est élémentaire s'il admet un équilibre corrélé strict à support plein. Un jeu est plein si...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
We introduce the nonatomic supermodular game, where no player's action has any discernible impact on...
This paper studies the complexity of computing a representation of a simple game as the intersection...
Weighted voting games are simple games that can be represented by a collection of integer weights fo...
We show that the following problem is NP-hard, and hence computationally intractable: Given d weigh...
This project will be focused around the theory of Simple Games, weighted Voting Games will be of spe...
Simple games are cooperative games in which the benefit that a coalition may have is always binary, ...
Consider a situation with n agents or players, where some of the players form a coalition with a cer...
A game is elementary if it has strict correlated equilibrium distributions with full support. A game...
We provide a condition guaranteeing when a value defined on the base of the unanimity games and exte...
Abstract. An aggregate game is a normal-form game with the property that each player’s payoff is a f...
Several relationships between simple games and a particular type of solu- tions for cooperative gam...
Abstract This paper contributes to the program of numerical characterization and classification of s...
This is a post-peer-review, pre-copyedit version of an article published in Optimization letters. Th...
Un jeu est élémentaire s'il admet un équilibre corrélé strict à support plein. Un jeu est plein si...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
We introduce the nonatomic supermodular game, where no player's action has any discernible impact on...
This paper studies the complexity of computing a representation of a simple game as the intersection...
Weighted voting games are simple games that can be represented by a collection of integer weights fo...
We show that the following problem is NP-hard, and hence computationally intractable: Given d weigh...
This project will be focused around the theory of Simple Games, weighted Voting Games will be of spe...
Simple games are cooperative games in which the benefit that a coalition may have is always binary, ...
Consider a situation with n agents or players, where some of the players form a coalition with a cer...
A game is elementary if it has strict correlated equilibrium distributions with full support. A game...
We provide a condition guaranteeing when a value defined on the base of the unanimity games and exte...
Abstract. An aggregate game is a normal-form game with the property that each player’s payoff is a f...
Several relationships between simple games and a particular type of solu- tions for cooperative gam...
Abstract This paper contributes to the program of numerical characterization and classification of s...
This is a post-peer-review, pre-copyedit version of an article published in Optimization letters. Th...
Un jeu est élémentaire s'il admet un équilibre corrélé strict à support plein. Un jeu est plein si...
Computing solution concepts in games is an important endeavor in the field of algorithmic game theor...
We introduce the nonatomic supermodular game, where no player's action has any discernible impact on...