Pith. sign in

REVIEW

Dimension and codimension of simple games

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1602.04328 v1 pith:VE5C2RKC submitted 2016-02-13 cs.GT

Sascha Kurz , Xavier Molinero , Martin Olsen , Maria Serna This is my paper · ORCID
classification cs.GT
keywords codimensiondimensiongamessimplecomplexitycomputingexamplesexponential
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools