Theory of annihilation games

DOI10.1090/S0002-9904-1976-14160-2zbMath0331.05112MaRDI QIDQ4097317

Aviezri S. Fraenkel, Yaacov Yesha

Publication date: 1976

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Related Items

Complexity, appeal and challenges of combinatorial games ⋮ The complexity of node blocking for dags ⋮ Complexity of problems in games, graphs and algebraic equations ⋮ Theory of annihilation games. I ⋮ Strategy for a class of games with dynamic ties ⋮ The particles and antiparticles game ⋮ Recent results and questions in combinatorial game complexities ⋮ Misère annihilation games

Cites Work

• Strategy for a class of games with dynamic ties
• Graphs and composite games