A distributed algorithm to obtain repeated games equilibria with discounting

DOI10.1016/J.AMC.2019.124785MaRDI QIDQ2284815zbMATH OpenOpenAlexWikidataFDO

Authors Juan Parras, S. Zazo

Publication date 15 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124785

zbMATH Keywords

average discounted payoffcorrelated equilibriumfolk theoremmultiagent learningNash equilibriumrepeated games

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12)

Recommendations

• Computing equilibria in discounted dynamic games
• scientific article; zbMATH DE number 3963605
• Distributed algorithms for the computation of noncooperative equilibria
• Algorithms for finding repeated game equilibria
• A Distributed Algorithm For Almost-Nash Equilibria of Average Aggregative Games With Coupling Constraints
• Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
• Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
• Distributed Computation of Equilibria in Misspecified Convex Stochastic Nash Games
• Distributed methods for computing approximate equilibria
• Distributed Methods for Computing Approximate Equilibria

Cites work

• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• Algorithmic Game Theory
• Applied analysis
• AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
• Equilibrium points in n -person games
• Game theory
• scientific article; zbMATH DE number 1243371 (Why is no real title available?)
• Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
• Multiagent learning using a variable learning rate
• On the Theory of Infinitely Repeated Games with Discounting
• Other Solutions to Nash's Bargaining Problem
• Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons
• Repeated games with incomplete information. With the collaboration of Richard E. Stearns
• Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
• Statistical physics of human cooperation
• Stochastic Games
• Subjectivity and correlation in randomized strategies
• Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
• The bargaining problem
• The Communication Complexity of Atomic Commitment and of Gossiping

Cited in

(2)

• Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
• Synchronous distributed ADMM for consensus convex optimization problems with self-loops

Describes a project that uses

Uses Software

• AWESOME
• Libratus

This page was built for publication: A distributed algorithm to obtain repeated games equilibria with discounting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284815)