#### Topics from this paper

#### 103 Citations

Algorithmic game theory

- Computer Science
- Commun. ACM
- 2010

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

- Computer Science
- Commun. ACM
- 2017

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

- Mathematics, Computer Science
- IFIP TCS
- 2008

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

- Computer Science
- AAAI
- 2008

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

- Computer Science, Mathematics
- Bull. EATCS
- 2012

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

- Political Science, Computer Science
- CACM
- 2010

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

- Computer Science
- 2008

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

- Computer Science
- 2015

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

- Computer Science
- Appl. Math. Comput.
- 2016

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

- Mathematics, Computer Science
- IJCAI
- 2009

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 pure… Expand

#### References

SHOWING 1-10 OF 62 REFERENCES

Algorithmic game theory

- Computer Science
- Commun. ACM
- 2010

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

- Computer Science, Mathematics
- Games Econ. Behav.
- 2003

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.

- Computer Science
- SODA '96
- 1996

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

- Computer Science, Economics
- ArXiv
- 2007

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

- Computer Science
- UAI
- 2001

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

- Computer Science, Mathematics
- 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

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

- Economics
- 1985

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 are… Expand

Theory of Games and Economic Behavior.

- Economics, Mathematics
- 1944

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 together… Expand

Complexity Results about Nash Equilibria

- Computer Science, Economics
- IJCAI
- 2003

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

- Computer Science
- ICALP
- 2001

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 the… Expand