# Two players alternately remove nodes from a connected graph G

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

1 Attachment

Alessandro Iraci

1.7K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.

- answered
- 573 views
- $5.00

### Related Questions

- Game theory questions
- Bayesian Nash Equilibrium
- Rotational symmertries of octahedron, $R(O_3)$
- Operational research : queueing theory
- Rubinstein Bargaining Variation Problem in Game Theory
- Game theory 100 voters
- There is always a player such that every other player was either beaten by him or beaten by a player beaten by him
- IRS Game Theory Question