Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is… Expand

Review

2010

Review

2010

The Generalized Nash Equilibrium Problem is an important model that has its roots in the economic sciences but is being… Expand

Highly Cited

2009

Highly Cited

2009

In 1951, John F. Nash proved that every game has a Nash equilibrium [Ann. of Math. (2), 54 (1951), pp. 286-295]. His proof is… Expand

Highly Cited

2008

Highly Cited

2008

We address the problem of spectrum pricing in a cognitive radio network where multiple primary service providers compete with… Expand

Highly Cited

2006

Highly Cited

2006

We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a… Expand

Highly Cited

2006

Highly Cited

2006

Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games… Expand

Highly Cited

1995

Highly Cited

1995

Sufficient conditions for Nash equilibrium in an 'n'-person game are given in terms of what the players know and believe - about… Expand

Highly Cited

1993

Highly Cited

1993

Two players are about to play a discounted infinitely repeated bimatrix game. Each player knows his own payoff matrix and chooses… Expand

Highly Cited

1985

Highly Cited

1985

This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach… Expand

Highly Cited

1952

Highly Cited

1952

Abstract : Kakutani's Fixed Point Theorem states that in Euclidean n-space a closed point to (non-void) convex set map of a… Expand