UNO is hard, even for a single player
UNO® is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise mathematical models for it. They include cooperative and uncooperative versions of UNO, for example. As a result of ana...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2011
|
Online Access: | http://hdl.handle.net/1721.1/62147 https://orcid.org/0000-0003-3803-5703 |