skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games
Award ID(s):
2008855
PAR ID:
10358385
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
2021 55th Asilomar Conference on Signals, Systems, and Computers
Page Range / eLocation ID:
998 to 1002
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A longstanding conjecture of Erdos and Simonovits states that for every rational r between 1 and 2 there is a graph H such that the largest number of edges in an H-free graph on n vertices is \Theta(n^r). Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form 2-a/b with b sufficiently large in terms of a. 
    more » « less
  2. null (Ed.)