2016/02/13 by Sascha Kurz, Kurz, Sascha, Xavier Molinero +5
Computer Science · #91A12 #91B12 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #cs.GT #msc:91A12 #msc:91B12
paper · pdf · doi:10.48550/arxiv.1602.04328
5 pages
arxiv created 2016/02/13 · arxiv updated 2016/02/16
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and exponential codimension with respect to the number of players.