Decentralized Fictitious Play Converges Near a Nash Equilibrium in Near-Potential Games
- Award ID(s):
- 2008855
- PAR ID:
- 10358385
- 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
-
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
-
null (Ed.)
An official website of the United States government

