Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

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 1404.2305 v1 pith:SXQO2DSA submitted 2014-02-20 math.OC cs.GT

Twin relationships in Parsimonious Games: some results

classification math.OC cs.GT
keywords gamestwinminimalparsimoniouswinningcoalitionsgameproperties
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning coalitions of such games. A careful investigation of such properties allowed the discovery of some results on twin games presented in this paper. In detail we show that a) twin games have the same minimal winning quota and b) each Parsimonious game admits a unique balanced lottery on minimal winning coalitions, whose probabilities are given by the individual weights of its twin game.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.