Complexity of problems in games, graphs and algebraic equations

AS Fraenkel, Y Yesha - Discrete Applied Mathematics, 1979 - Elsevier
We prove NP-hardness of six families of naturally defined, interesting board games. Some of
them are “only just hard” in the sense that slight variations of them are polynomial. We …

[PDF][PDF] Stable winning coalitions

DE Loeb - Games of No Chance, 1996 - Citeseer
We introduce in this paper the notion of a stable winning coalition in a multiplayer game.
This is used as a new system of classi cation of games. An axiomatic re nement of this classi …

A gamut of game theories

JH Conway - Mathematics Magazine, 1978 - Taylor & Francis
A Gamut of Game Theories Page 1 ----...... AWCLC) A Gamut of Game Theories The evaluation
of compounds of games, playing lots of games at once, gives a natural construction of surreal …

Playing Nim on a simplicial complex

R Ehrenborg, E Steingrímsson - the electronic journal of …, 1996 - combinatorics.org
We introduce a generalization of the classical game of Nim by placing the piles on the
vertices of a simplicial complex and allowing a move to affect the piles on any set of vertices …

A complete analysis of von Neumann's Hackendot

J Ulehla - International Journal of Game Theory, 1980 - Springer
In this note we are going to present a winning strategy for a game on trees (reminiscent of
the games of Hackenbush type) which, it seems, has been invented by J. Von Neumann in …

[图书][B] Two-person symmetric whist

J Wästlund - 2005 - diva-portal.org
The game of two-person whist is played with a deck of cards. Each card belongs to a suit,
and each suit is totally ordered. The cards are distributed between the two players so that …

[PDF][PDF] Surreal Numbers and Games

T Dokos - 2009 - math.osu.edu
Surreal numbers are an alternate number system that constructs the real numbers using ony
cuts, and in addition builds some more esoteric numbers. Games are a more general …

[引用][C] 纽结理论与量子混沌

顾之雨 - 云南民族学院学报: 自然科学版, 2001