Simple Games Versus Weighted Voting Games: Bounding the Critical Threshold Value
نویسندگان
چکیده
منابع مشابه
Dynamic weighted voting games
We initiate the study of dynamic cooperative games—cooperative games where the characteristic function may change over time. We introduce two types of algorithmic problems for such games: computing a given solution concept at time t, and checking that a certain function of the game (e.g., the Shapley value of a given player or the value of the least core) remains within given bounds during time...
متن کاملReliability Weighted Voting Games
We examine agent failures in weighted voting games. In our cooperative game model, R-WVG, each agent has a weight and a survival probability, and the value of an agent coalition is the probability that its surviving members would have a total weight exceeding a threshold. We propose algorithms for computing the value of a coalition, finding stable payoff allocations, and estimating the power of...
متن کاملA simple "market value" bargaining model for weighted voting games: characterization and limit theorems
We offer a bargaining model for weighted voting games that is a close relative of the nucleolus and the kernel. We look for a set of weights that preserves winning coalitions that has the property of minimizing the difference between the weight of the smallest and the weight of the largest Minimum Winning Coalition. We claim that such a set of weights provides an a priori measure of a weighted ...
متن کاملManipulating the Quota in Weighted Voting Games
Weighted voting games provide a popular model of decision making in multiagent systems. Such games are described by a set of players, a list of players’ weights, and a quota; a coalition of the players is said to be winning if the total weight of its members meets or exceeds the quota. The power of a player in such games is traditionally identified with her Shapley– Shubik index or her Banzhaf ...
متن کاملComputing the nucleolus of weighted voting games
Weighted voting games (WVG) are coalitional games in which an agent’s contribution to a coalition is given by his weight, and a coalition wins if its total weight meets or exceeds a given quota. These games model decision-making in political bodies as well as collaboration and surplus division in multiagent domains. The computational complexity of various solution concepts for weighted voting g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3270445