Papers
Topics
Authors
Recent
Search
2000 character limit reached

Twin relationships in Parsimonious Games: some results

Published 20 Feb 2014 in math.OC and cs.GT | (1404.2305v1)

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.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.