Approximability and parameterized complexity of minmax values

@inproceedings{Hansen2008ApproximabilityAP,
  title={Approximability and parameterized complexity of minmax values},
  author={Kristoffer Arnsfelt Hansen and Thomas Dueholm Hansen and Peter Bro Miltersen and Troels Bjerre Lund},
  booktitle={WINE},
  year={2008}
}
We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of logn digits (for any constant > 0) is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Basic solutions of discrete games

  • L. S. Shapley, R. N. Snow
  • In Contributions to the Theory of Games, number…
  • 1950
Highly Influential
5 Excerpts

Fellows . Fixed - parameter tractability and completeness I : Basic results

  • R. M.
  • SIAM Journal on Computing
  • 1995

Similar Papers

Loading similar papers…