Voting games with abstention: linking completeness and weightedness
View/Open
Cita com:
hdl:2117/24929
Document typeArticle
Defense date2014-01-01
Rights accessOpen Access
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
Weighted games for several levels of approval in input and output were introduced in [9]. An extension of the desirability relation for simple games, called the influence relation, was introduced for games with several levels of approval in input in [24] (see also [18]). However, there are weighted games not being complete for the influence relation, something different to what occurs for simple games. In this paper we introduce several extensions of the desirability relation for simple games and from the completeness of them it follows the consistent link with weighted games, which solves the existing gap. Moreover, we prove that the influence relation is consistent with a known subclass of weighted games: strongly weighted games. (C) 2013 Elsevier B.V. All rights reserved.
CitationFreixas, J.; Tchantcho, B.; Tedjeugang, N. Voting games with abstention: linking completeness and weightedness. "Decision support systems", Gener 2014, vol. 57, p. 172-177.
ISSN0167-9236
Files | Description | Size | Format | View |
---|---|---|---|---|
DECSUP_12397.pdf | Article | 105,1Kb | View/Open |