Computer science and game theory

@article{Shoham2008ComputerSA,
  title={Computer science and game theory},
  author={Yoav Shoham},
  journal={Commun. ACM},
  year={2008},
  volume={51},
  pages={74-79}
}
  • Y. Shoham
  • Published 12 May 2008
  • Computer Science
  • Commun. ACM
The most dramatic interaction between CS and GT may involve game-theory pragmatics. 

Topics from this paper

Algorithmic game theory
TLDR
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance. Expand
Contest theory
TLDR
Exploring the basic game theory models of contests found in online services finds them to be simple, democratic, scalable and scalable. Expand
Algorithmic Game Theory: Some Greatest Hits and Future Directions
We give a brief and biased survey of the past, present, and future of research on the interface of theoretical computer science and game theory.
Game Theory Pragmatics: A Challenge for AI
TLDR
It is suggested that going forward, the most dramatic interaction between computer science and game theory - with a special role for AI - could be around what might be called game theory pragmatics. Expand
The Complexity of Angel-Daemons and Game Isomorphism
TLDR
The introduction and analysis of a class of games, designed to asses web applications, have been considered and the problem of isomorphism between strategic games has been analysed. Expand
Making decisions based on the preferences of multiple agents
TLDR
This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and cataloging individual neurons in the brain. Expand
An Algorithmic Game Theory Primer
TLDR
Research on the interface of theoretical computer science and game theory, an area now known as algorithmic game theory (AGT), has exploded phenomenally. Expand
Dynamic Game-Theoretic Models to Determine the Value of Intrusion Detection Systems in the Face of Uncertainty
TLDR
This is a list of recommended reading lists for students wishing to begin or deepen their knowledge of the Greek language. Expand
Iterated symmetric three-player prisoner's dilemma game
TLDR
This paper designs and implements an algorithm and implements it using the Java programing language to facilitate the calculations of the model of three-player iterated prisoner's dilemma game where, each player has two choices. Expand
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs
In this paper we provide a logical framework for using computers to discover theorems in two-person finite games in strategic form, and apply it to discover classes of games that have unique pureExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 62 REFERENCES
Algorithmic game theory
TLDR
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance. Expand
A computer scientist looks at game theory
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c)Expand
Games, computers, and O.R.
TLDR
The scientific interaction of game theory with computer science and operations research is broad and fundamental, and it transfers concepts, language, and results across IYields. Expand
Computer Science and Game Theory: A Brief Survey
TLDR
This article surveys some of the main themes of work in the area of computer science and game theory in the past decade, with a focus on the work in computer science. Expand
Graphical Models for Game Theory
TLDR
The main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in one-stage games represented by trees or sparse graphs. Expand
Settling the Complexity of Two-Player Nash Equilibrium
  • X. Chen, X. Deng
  • Computer Science, Mathematics
  • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
TLDR
It is proved that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete. Expand
Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
Abstract Cooperation in the finitely repeated prisoner's dilemma is justified, without departure from strict utility maximization or complete information, but under the assumption that there areExpand
Theory of Games and Economic Behavior.
This is the classic work upon which modern-day game theory is based. What began more than sixty years ago as a modest proposal that a mathematician and an economist write a short paper togetherExpand
Complexity Results about Nash Equilibria
TLDR
A single reduction demonstrates NP- hardness of determining whether Nash equilibria with certain natural properties exist, and demonstrates the NP-hardness of counting NashEquilibria (or connected sets of Nash Equilibria). Expand
Algorithms, Games, and the Internet
Over the past fifty years, researchers in Theoretical Computer Science have sought and achieved a productive foundational understanding of the von Neumann computer and its software, employing theExpand
...
1
2
3
4
5
...