OurBigBook About$ Donate
 Sign in Sign up

Induced subgraph game with self-loops (v(S)=∑i∈S​ℓi​+∑{i,j}⊆S, i=j​wij​)

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Game theory Cooperative game theory Transferable utility game Induced subgraph game
2026-10-25  0 By others on same topic  0 Discussions Create my own version
An induced subgraph game extended by one self-loop weight ℓi​ per player. Each loop is counted once, so v({i})=ℓi​ and
wij​=v({i,j})−v({i})−v({j}).
(1)
Singleton and pair coalition values determine all weights; larger coalition values must then agree with their sums. Signed weights are allowed. For example, two loops of weight 1 joined by an edge of weight −1 represent the simple cooperative game in which any coalition meeting those two players wins.

 Ancestors (8)

  1. Induced subgraph 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 (1)

  • Past exam of the computer science course of the University of Oxford / 2020 / Computational game theory / 3 / b / Solution

 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