International Journal of Game Theory

, Volume 18, Issue 2, pp 195–207 | Cite as

Regular simple games

  • E. Einy
  • E. Lehrer


Using Kelley's intersection number (and a variant of it) we define two classes of simple games, the regular and the strongly regular games. We show that the strongly regular games are those in which the set of winning coalitions and the set of losing coalitions can be strictly separated by a finitely additive probability measure. This, in particular, provides a combinatorial characterization for the class of finite weighted majority games within the finite simple games. We also prove that regular games have some nice properties and show that the finite regular games are exactly those simple games which are uniquely determined by their counting vector. This, in particular, generalizes a result of Chow and Lapidot.


Probability Measure Economic Theory Game Theory Additive Probability Intersection Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Chow K (1961) On the characterization of threshold functions. Ledley 41:34–38Google Scholar
  2. Dubey P, Shapley LS (1979) Mathematical properties of the Banzhaf power index. Mathematics of Operations Research 4:99–131Google Scholar
  3. Dunford N, Schwartz J (1958) Linear operators, part I. John Wiley and Sons, Inc., New YorkGoogle Scholar
  4. Einy E (1985) The desirability relation of simple games. Mathematical Social Sciences 10:155–168Google Scholar
  5. Einy E, Neyman A (1988) Large symmetric games are characterized by the completeness of the desirability relation. CORE Discussion Paper 8828, Université Catholique de Louvain, Louvainla-Neuve, BelgiumGoogle Scholar
  6. Kelley JL (1959) Measure on Boolean algebras. Pacific Journal of Mathematics 9:1165–1177Google Scholar
  7. Lapidot E (1968) Weighted majority games and symmetry group of games. MSc Thesis in Hebrew, Technion, HaifaGoogle Scholar
  8. Lapidot E (1972) The counting vector of a simple game. Proceeding of the American Mathematical Society 31:228–231Google Scholar
  9. Maschler M, Peleg B (1966) A characterization, existence proof and dimension bounds for the Kernel of a game. Pacific Journal of Mathematics 18:289–328Google Scholar
  10. Wilhelm M (1976) Existence of additive functional on semi-groups and the Von Neumann minimax theorem. Colloquim Mathematica 35:265–214Google Scholar
  11. Winder RO (1971) Chow parameters in threshold logic. Journal of Association for Computing Machinery 18:265–289Google Scholar

Copyright information

© Physica-Verlag 1989

Authors and Affiliations

  • E. Einy
    • 1
  • E. Lehrer
    • 2
  1. 1.COREBelgium
  2. 2.Graduate School of ManagementNorthwestern UniversityEvanstonUSA

Personalised recommendations