The Counting Vector of a Simple Game

DOI10.2307/2038548zbMath0208.23005OpenAlexW4234150130MaRDI QIDQ5610227

Eitan Lapidot

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/2038548

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items

Decisions by players of comparable strength, Simple games and magic squares, Large symmetric games are characterized by completeness of the desirability relation, Regular simple games, A theory of coalition formation in committees, Sets uniquely determined by projections on axes. II: Discrete case, Complete simple games, The desirability relation of simple games

Cites Work

• A characterization, existence proof and dimension bounds for the kernel of a game
• On the Enumeration of Majority Games