paper-with-me

홈 › Papers

Swim till You Sink: Computing the Limit of a Game

2024-08-20 · Rashida Hakim, Jason Milionis, Christos Papadimitriou, Georgios Piliouras

During 2023, two interesting results were proven about the limit behavior of game dynamics: First, it was shown that there is a game for which no dynamics converges to the Nash equilibria. Second, it was shown that the sink equilibria of a game adequately capture the limit behavior of natural game dynamics. These two results have created a need and opportunity to articulate a principled computational theory of the meaning of the game that is based on game dynamics. Given any game in normal form, and any prior distribution of play, we study the problem of computing the asymptotic behavior of a class of natural dynamics called the noisy replicator dynamics as a limit distribution over the sink equilibria of the game. When the prior distribution has pure strategy support, we prove this distribution can be computed efficiently, in near-linear time to the size of the best-response graph. When the distribution can be sampled -- for example, if it is the uniform distribution over all mixed strategy profiles -- we show through experiments that the limit distribution of reasonably large games can be estimated quite accurately through sampling and simulation.

📄 PDF Abstract BibTeX arXiv:2408.11146

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Replicator Dynamic, Chain Components and the Response Graph

2022-09-30 · Oliver Biggar, Iman Shames

In this paper we examine the relationship between the flow of the replicator dynamic, the continuum limit of Multiplicative Weights Update, and a game's response graph. We settle an open problem establishing that under t…

Sink equilibria and the attractors of learning in games

2025-02-11 · Oliver Biggar, Christos Papadimitriou

Characterizing the limit behavior -- that is, the attractors -- of learning dynamics is one of the most fundamental open questions in game theory. In recent work in this front, it was conjectured that the attractors of t…

Warpspeed Computation of Optimal Transport, Graph Distances, and Embedding Alignment

2021-01-01 · Johannes Klicpera, Marten Lienen, Stephan Günnemann

Optimal transport (OT) is a cornerstone of many machine learning tasks. The current best practice for computing OT is via entropy regularization and Sinkhorn iterations. This algorithm runs in quadratic time and requires…

Distance regression

U-SWIM: Universal Selective Write-Verify for Computing-in-Memory Neural Accelerators

2023-12-11 · Zheyu Yan, Xiaobo Sharon Hu, Yiyu Shi

Architectures that incorporate Computing-in-Memory (CiM) using emerging non-volatile memory (NVM) devices have become strong contenders for deep neural network (DNN) acceleration due to their impressive energy efficiency…

Strategic Effort and Bandwagon Effects in Finite Multi-Stage Games with Non-Linear Externalities: Evidence from Triathlon

2025-05-06 · Felix Reichel

This paper examines strategic effort and positioning choices resulting in bandwagon effects under externalities in finite multi-stage games using causal evidence from triathlon (Reichel, 2025). Focusing on open-water swi…

Position