Complexity results for some classes of strategic games

@inproceedings{Fischer2009ComplexityRF,
  title={Complexity results for some classes of strategic games},
  author={Felix A. Fischer},
  year={2009}
}
Game theory is a branch of applied mathematics studying the interaction of self-interested entities, so-called agents. Its central objects of study are games, mathematical models of real-world interaction, and solution concepts that single out certain outcomes of a game that are meaningful in some way. The solutions thus produced can then be viewed both from a descriptive and from a normative perspective. The rise of the Internet as a computational platform where a substantial part of today's… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 126 REFERENCES

Rationally Justifiable Play and the Theory of Non-cooperative Games

Robin P. Cubitt, Robert Sugden
  • 1994
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

How easy is local search?

  • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

NON-COOPERATIVE GAMES

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Computing the minimal covering set

  • Mathematical Social Sciences
  • 2008
VIEW 8 EXCERPTS

Settling the complexity of 2-player Nash-equilibrium

X. Chen, X. Deng
  • In Proceedings of the 47th Symposium on Foundations of Computer Science (FOCS),
  • 2006
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL