Flows and Decompositions of Games: Harmonic and Potential Games by Candogan, Utku Ozan, Menache, Ishai, Ozdaglar, Asuman E., Parrilo, Pablo A.

“…We analyze natural classes of games that are induced by this decomposition, and in particular, focus on games with no harmonic component and games with no potential component. …”
Get full text
Get full text
Get full text

Graphon Games: A Statistical Framework for Network Games and Interventions by Parise, Francesca, Ozdaglar, Asuman E.

Get full text

Quantum Free Games by Natarajan, Anand, Zhang, Tina

Get full text

Dynamics in congestion games by Shah, Devavrat, Shin, Jinwoo

“…Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. …”
Get full text
Get full text

Dynamics in near-potential games by Candogan, Utku Ozan, Koksal, Asuman E., Parrilo, Pablo A

“…We consider discrete-time learning dynamics in finite strategic form games, and show that games that are close to a potential game inherit many of the dynamical properties of potential games. …”
Get full text
Get full text
Get full text

The Multiplayer Colonel Blotto Game by Boix-Adsera, Enric, Edelman, Benjamin, Jayanti, Siddhartha

Get full text

Basic Network Creation Games by Alon, Noga, Demaine, Erik D., Hajiaghayi, Mohammad Taghi, Leighton, Tom

“…We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident edge at a time. …”
Get full text
Get full text
Get full text

Learning in near-potential games by Candogan, Utku Ozan, Ozdaglar, Asuman E., Parrilo, Pablo A.

“…Potential games are one such special but restrictive class of games that allow for tractable dynamic analysis. …”
Get full text
Get full text
Get full text

On minmax theorems for multiplayer games by Cai, Yang, Daskalakis, Constantinos

“…We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero-sum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix---that is, graphical games in which every edge is a two-player game between its endpoints---in which every outcome has zero total sum of players' payoffs. …”
Get full text
Get full text

Improved Approximation Algorithms for Projection Games by Manurangsi, Pasin, Moshkovitz Aaronson, Dana Hadar

“…The projection games (aka Label Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label Cover. …”
Get full text
Get full text

The Stackelberg Minimum Spanning Tree Game by Cardinal, Jean, Demaine, Erik D, Fiorini, Samuel, Joret, Gwenaël, Langerman, Stefan, Newman, Ilan, Weimann, Oren

“…We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning Tree game or StackMST. …”
Get full text

The price of anarchy in network creation games by Demaine, Erik D, Hajiaghayi, MohammadTaghi, Mahini, Hamid, Zadimoghaddam, Morteza

“…We study Nash equilibria in the setting of network creation games introduced recently by Fabrikant, Luthra, Maneva, Papadimitriou, and Shenker. …”
Get full text

Analysis and Interventions in Large Network Games by Parise, Francesca, Ozdaglar, Asuman

“…<jats:p> We review classic results and recent progress on equilibrium analysis, dynamics, and optimal interventions in network games with both continuous and discrete strategy sets. …”
Get full text

Online Learning in Unknown Markov Games by Tian, Yi, Wang, Yuanhao, Yu, Tiancheng, Sra, Suvrit

Get full text

Bayesian Proportional Resource Allocation Games by Tsitsiklis, John N., Xu, Yunjian

“…We study a corresponding Bayesian game in which each user has incomplete information on the state or type of the other users. …”
Get full text
Get full text

Improved Approximation Algorithms for Projection Games by Manurangsi, Pasin, Moshkovitz Aaronson, Dana Hadar

“…The projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover. …”
Get full text
Get full text

Learning to Simulate Dynamic Environments With GameGAN by Kim, Seung Wook, Zhou, Yuhao, Philion, Jonah, Torralba, Antonio, Fidler, Sanja

“…This enables many interesting applications such as swapping different components of the game to build new games that do not exist. We will release the code and trained model, enabling human players to play generated games and their variations with our GameGAN.…”
Get full text

A projection framework for near-potential games by Candogan, Utku Ozan, Ozdaglar, Asuman E., Parrilo, Pablo A.

“…Potential games are a special class of games that admit tractable static and dynamic analysis. …”
Get full text
Get full text
Get full text

On the complexity of Nash equilibria of action-graph games by Daskalakis, Constantinos, Schoenebeck, Grant, Valiant, Gregory, Valiant, Paul

“…In light of much recent interest in finding a model of multi-player multi-action games that allows for efficient computation of Nash equilibria yet remains as expressive as possible, we investigate the computational complexity of Nash equilibria in the recently proposed model of action-graph games (AGGs). …”
Get full text

The order independence of iterated dominance in extensive games by Chen, Jing, Micali, Silvio

“…Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. …”
Get full text
Get full text