Three-valued simple games
From MaRDI portal
Publication:1620913
DOI10.1007/S11238-017-9630-ZzbMath1417.91057OpenAlexW3121613231WikidataQ59482755 ScholiaQ59482755MaRDI QIDQ1620913
Marieke Musegaas, Marieke Quant, P. E. M. Borm
Publication date: 14 November 2018
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-017-9630-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Simple and three-valued simple minimum coloring games
- Probabilistic power indices for voting rules with abstention
- Banzhaf measures for games with several levels of approval in the input and output
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- On the uniqueness of the Shapley value
- Ternary voting games
- Voting power in the European Union enlargement
- Shapley value for multichoice cooperative games. I
- The value of a player in \(n\)-person games
- Cores of convex games
- Weighted voting, abstention, and multiple levels of approval
- Manipulation of Voting Schemes: A General Result
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
This page was built for publication: Three-valued simple games