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](https://matchmaticians.com/storage/user/100977/thumb/matchmaticians-ee0kis-file-1-avatar-512.jpg)
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
- 555 views
- $5.00
Related Questions
- Bayesian Nash Equilibrium
- 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
- Game theory questions
- Rubinstein Bargaining Variation Problem in Game Theory
- Rotational symmertries of octahedron, $R(O_3)$
- Operational research : queueing theory
- Game theory 100 voters