# Two players alternately remove nodes from a connected graph G

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

1 Attachment

Alessandro Iraci

1.6K

The answer is accepted.

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

- answered
- 472 views
- $5.00

### Related Questions

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