| dc.contributor.author | Demaine, Erik D. | |
| dc.contributor.author | Demaine, Martin L. | |
| dc.contributor.author | Uehara, Ryuhei | |
| dc.contributor.author | Uno, Takeaki | |
| dc.contributor.author | Uno, Yushi | |
| dc.date.accessioned | 2011-04-06T15:50:56Z | |
| dc.date.available | 2011-04-06T15:50:56Z | |
| dc.date.issued | 2010-06 | |
| dc.date.submitted | 2010-03 | |
| dc.identifier.isbn | 978-3-642-13121-9 | |
| dc.identifier.isbn | 3-642-13121-2 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/62147 | |
| dc.description.abstract | 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 analyzing
their computational complexities, we prove that even a single-player version
of UNO is NP-complete, while it becomes in P in some restricted cases. We
also show that uncooperative two-player’s version is PSPACE-complete. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer-Verlag | en_US |
| dc.relation.isversionof | http://portal.acm.org/citation.cfm?id=1875631 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | UNO is hard, even for a single player | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Demaine, Erik D. et al. “UNO is hard, even for a single player.” Proceedings of the 5th International Conference on Fun with Algorithms. Iscia, Italy: Springer-Verlag, 2010. 133-144. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.approver | Demaine, Erik D. | |
| dc.contributor.mitauthor | Demaine, Erik D. | |
| dc.contributor.mitauthor | Demaine, Martin L. | |
| dc.relation.journal | Proceedings of the 5th International Conference on Fun with Algorithms | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Demaine, Erik D.; Demaine, Martin L.; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi | |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
