Semantic Scholar uses AI to extract papers important to this topic.
Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is… Expand The Generalized Nash Equilibrium Problem is an important model that has its roots in the economic sciences but is being… Expand 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 We address the problem of spectrum pricing in a cognitive radio network where multiple primary service providers compete with… Expand We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a… Expand Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games… Expand Sufficient conditions for Nash equilibrium in an 'n'-person game are given in terms of what the players know and believe - about… Expand Two players are about to play a discounted infinitely repeated bimatrix game. Each player knows his own payoff matrix and chooses… Expand This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach… Expand Abstract : Kakutani's Fixed Point Theorem states that in Euclidean n-space a closed point to (non-void) convex set map of a… Expand