The Difficulty of Beating the Taxman
Copyright policy )The Difficulty of Beating the Taxman
The Taxman game has proven to be hard to solve optimally, so efforts have been made to find heuristic strategies that do well in practice. We present results on the NP-hardness of a variant of the game via an equivalence to a particular kind of graph matching problem. Furthermore this equivalence is used to derive a winning strategy for all $n$ along with efficiently computable lower and upper bounds on the optimal achievable score.
- Fordham University United States
- University of Iceland Iceland
game theory, Taxman, graph theory, matching, Theory of computing, G.2.1, G.2.2, 91A46, F.2.2; G.2.1; G.2.2, Graph theory, Discrete mathematics in relation to computer science, combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), F.2.2
game theory, Taxman, graph theory, matching, Theory of computing, G.2.1, G.2.2, 91A46, F.2.2; G.2.1; G.2.2, Graph theory, Discrete mathematics in relation to computer science, combinatorics, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), F.2.2
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!