OurBigBook About$ Donate
 Sign in Sign up

Unanimity game (uK​(S)=1{K⊆S}​)

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Game theory Cooperative game theory Transferable utility game Simple cooperative game
2026-10-25  0 By others on same topic  0 Discussions Create my own version
For a fixed nonempty coalition K, the simple cooperative game in which a coalition wins exactly when it contains K. Members of K are exactly the veto players. It is a convex cooperative game: intersections of winning coalitions still contain K, and checking the remaining zero-one cases establishes the supermodular inequality. Full symmetry of players in a cooperative game forces K=N.

 Ancestors (8)

  1. Simple cooperative game
  2. Transferable utility game
  3. Cooperative game theory
  4. Game theory
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (3)

  • Convex simple games are unanimity games
  • Past exam of the computer science course of the University of Oxford / 2020 / Computational game theory / 3 / g / Solution
  • Shapley value axioms

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook