The Counting Vector of a Simple Game

DOI10.2307/2038548zbMATH Open0277.90091OpenAlexW4234150130MaRDI QIDQ4404064FDOQ4404064

Authors: Eitan Lapidot 

Publication date: 1972

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

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cites Work

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

Cited In (3)

• Decisions by players of comparable strength
• The integer nucleolus of directed simple games: a characterization and an algorithm
• Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces

This page was built for publication: The Counting Vector of a Simple Game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404064)