On the dimension of simple monotonic games

On the dimension of simple monotonic games

0.00 Avg rating0 Votes
Article ID: iaor2007340
Country: Netherlands
Volume: 170
Issue: 1
Start Page Number: 315
End Page Number: 318
Publication Date: Apr 2006
Journal: European Journal of Operational Research
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.