On the Chacteristic Numbers of Voting Games

This paper deals with the non-emptiness of the stability set for any proper voting game. We present an upper bound on the number of alternatives which guarantees the non emptiness of this solution concept. We show that this bound is greater than or equal to the one given by Le Breton and Salles (1990) for quota games.

MoreLess

Year of publication:	2006
Authors:	Merlin, Vincent ; Martin, Matthieu
Institutions:	HAL
Subject:	voting game \| core \| stability set

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Post-Print.
Type of publication:	Book / Working Paper
Language:	English
Notes:	View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00010172/en/ Published, International Game Theory Review, 2006, 8, 4, 643--654
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008789421