Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem.

Siddharth Barman

Published in: STOC (2015)

Keyphrases

nash equilibria
incomplete information
game theory
stochastic games
exact computation
nash equilibrium
pure strategy
game theoretic
quasi cliques
multiagent learning
fictitious play
graph model
von neumann
graph mining
bipartite graph
dynamic programming
np hard