On some combinatorial problems arising in the theory of voting games (Q1813696): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0165-4896(90)90060-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985850051 / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some combinatorial problems arising in the theory of voting games |
scientific article |
Statements
On some combinatorial problems arising in the theory of voting games (English)
0 references
25 June 1992
0 references
This paper complements the paper by the author and the reviewer [Int. J. Game Theory 19, No. 2, 111-127 (1990; Zbl 0726.90008)]. It gives the conditions on the size of the set of alternatives that guarantee the non- emptiness of the stability set for some quota voting games. In particular, games where the quota is equal to the number of voters minus one, majority games and qualified majority games are considered.
0 references
core
0 references
non-emptiness of the stability set
0 references
quota voting games
0 references
qualified majority games
0 references
