English
Related papers

Related papers: Concurrent Imitation Dynamics in Congestion Games

200 papers

This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. In particular, we assume agents optimize a linear combination…

Computer Science and Game Theory · Computer Science 2009-02-04 Martin Hoefer , Alexander Skopalik

We study the asymptotic behavior of deterministic, continuous-time imitation dynamics for population games over networks. The basic assumption of this learning mechanism -- encompassing the replicator dynamics -- is that players belonging…

Systems and Control · Electrical Eng. & Systems 2020-10-23 Giacomo Como , Fabio Fagnani , Lorenzo Zino

Congestion games are attractive because they can model many concrete situations where some competing entities interact through the use of some shared resources, and also because they always admit pure Nash equilibria which correspond to the…

Computer Science and Game Theory · Computer Science 2024-08-22 Vittorio Bilò , Angelo Fanelli , Laurent Gourvès , Christos Tsoufis , Cosimo Vinci

We consider a broad class of stochastic imitation dynamics over networks, encompassing several well known learning models such as the replicator dynamics. In the considered models, players have no global information about the game…

Systems and Control · Computer Science 2021-03-02 Lorenzo Zino , Giacomo Como , Fabio Fagnani

Except for special classes of games, there is no systematic framework for analyzing the dynamical properties of multi-agent strategic interactions. Potential games are one such special but restrictive class of games that allow for tractable…

Computer Science and Game Theory · Computer Science 2023-10-03 Ozan Candogan , Asuman Ozdaglar , Pablo A. Parrilo

We present a fully polynomial-time approximation scheme (FPTAS) for computing equilibria in congestion games, under smoothed running-time analysis. More precisely, we prove that if the resource costs of a congestion game are randomly…

Computer Science and Game Theory · Computer Science 2024-05-21 Yiannis Giannakopoulos

Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…

Computer Science and Game Theory · Computer Science 2017-04-17 James Riehl , Pouria Ramazi , Ming Cao

Imitation dynamics for population games are studied and their asymptotic properties analyzed. In the considered class of imitation dynamics - that encompass the replicator equation as well as other models previously considered in…

Systems and Control · Computer Science 2021-03-02 Lorenzo Zino , Giacomo Como , Fabio Fagnani

This paper presents new families of algorithms for the repeated play of two-agent (near) zero-sum games and two-agent zero-sum stochastic games. For example, the family includes fictitious play and its variants as members. Commonly, the…

Computer Science and Game Theory · Computer Science 2023-11-03 Yuksel Arslantas , Ege Yuceel , Yigit Yalin , Muhammed O. Sayin

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We…

Computer Science and Game Theory · Computer Science 2019-01-03 Marco Scarsini , Marc Schröder , Tristan Tomala

This paper studies a class of strongly monotone games involving non-cooperative agents that optimize their own time-varying cost functions. We assume that the agents can observe other agents' historical actions and choose actions that best…

Optimization and Control · Mathematics 2023-09-04 Zifan Wang , Yi Shen , Michael M. Zavlanos , Karl H. Johansson

In this work we completely characterize how the frequency with which each player participates in the game dynamics affects the possibility of reaching efficient states, i.e., states with an approximation ratio within a constant factor from…

Computer Science and Game Theory · Computer Science 2011-05-02 Angelo Fanelli , Luca Moscardelli , Alexander Skopalik

We study the convergence time of the best response dynamics in player-specific singleton congestion games. It is well known that this dynamics can cycle, although from every state a short sequence of best responses to a Nash equilibrium…

Computer Science and Game Theory · Computer Science 2008-12-18 Heiner Ackermann , Heiko Roeglin

Logit dynamics is a form of randomized game dynamics where players have a bias towards strategic deviations that give a higher improvement in cost. It is used extensively in practice. In congestion (or potential) games, the dynamics…

Computer Science and Game Theory · Computer Science 2021-05-28 Pieter Kleer

We study an atomic signaling game under stochastic evolutionary dynamics. There is a finite number of players who repeatedly update from a finite number of available languages/signaling strategies. Players imitate the most fit agents with…

Probability · Mathematics 2013-12-23 Michael J. Fox , Behrouz Touri , Jeff S. Shamma

We study convergence rates of random-order best-response dynamics in games on networks with linear best responses and strategic substitutes. Combining formal analysis with numerical simulations we identify phenomena that lead to slow…

Computer Science and Game Theory · Computer Science 2026-02-19 Wojciech Misiak , Marcin Dziubiński

Coordination games describe social or economic interactions in which the adoption of a common strategy has a higher payoff. They are classically used to model the spread of conventions, behaviors, and technologies in societies. Here we…

Computer Science and Game Theory · Computer Science 2008-12-02 Andrea Montanari , Amin Saberi

In this paper we develop a novel approach to the convergence of Best-Response Dynamics for the family of interference games. Interference games represent the fundamental resource allocation conflict between users of the radio spectrum. In…

Computer Science and Game Theory · Computer Science 2018-11-20 Ilai Bistritz , Amir Leshem

Infinitely repeated games can support cooperative outcomes that are not equilibria in the one-shot game. The idea is to make sure that any gains from deviating will be offset by retaliation in future rounds. However, this model of…

Computer Science and Game Theory · Computer Science 2024-06-04 Ratip Emin Berker , Vincent Conitzer
‹ Prev 1 2 3 10 Next ›