On the dimension of simple monotonic games

V.G. Deineko, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

21 Citations (Scopus)
2 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)315-318
JournalEuropean Journal of Operational Research
Volume170
Issue number1
DOIs
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'On the dimension of simple monotonic games'. Together they form a unique fingerprint.

Cite this