On the dimension of simple monotonic games
- V.G. Deineko,
- G.J. Woeginger
- University of Warwick,
Output:
Contribution to journal
Article
Academic
Peer-reviewInformation
Output type
Output:
Contribution to journal
Article
Academic
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 315-318Journal (Volume, Issue Number)
European Journal of Operational Research (Volume 170, Issue 1)Publication milestones
- Published - 2006
Publication status
Published - 2006
ISSN
0377-2217Abstract
We show that the following problem is NP-hard, and hence computationally intractable: "Given d weighted majority games, decide whether the dimension of their intersection exactly equals d". Our result indicates that the dimension of simple monotonic games is a combinatorially complicated concept.
Documents and Links
Metrics
Metrics
Download statistics
Download count
2
SciVal
citations
29
SciVal
FWCI
0.92
SciVal
Author count
2
SciVal
Paper percentile
70
Scopus
citations
29
PlumX, opens in new tab
Captures
8
Citation count
29
