Weighted games without a unique minimal representation in integers

Freixas Bosch, Josep; Molinero Albareda, Xavier

View/Open

Article principal (186,1Kb) (Restricted access) Request copy

View Usage Statistics

Cita com:

Show full item record

Freixas Bosch, Josep

Molinero Albareda, Xavier

Document typeResearch report

Defense date2009

Rights accessRestricted access - author's decision

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

Abstract

Recerca de jocs amb mínim número de jugadors sense representacions enteres mínimes o mínimes normalitzades

Description

Isbell in 1959 was the first to find a weighted game without a minimum integer realization in which the affected players do not play a symmetric role in the game. His example has 12 players is a weighted decisive game, i.e. a weighted game for which a coalition wins iff its complement loses. The goal of this paper is to provide a procedure for weighted games that allows finding out what is the minimum number of players needed to get a weighted game without a minimum integer weighted representation in which the affected players do not play a symmetric role in the game. We prove, by means of an algorithm, that the minimum number of voters required is 9.

URIhttp://hdl.handle.net/2117/9295

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
DOCWeightedGamesWithout.pdf	Article principal	186,1Kb	PDF	Restricted access

UPCommons. Global access to UPC knowledge

Weighted games without a unique minimal representation in integers

View/Open

Browse