Performance Analysis of Trial and Error Algorithms
J\'er\^ome Gaveau, Christophe J. Le Martret, Mohamad Assaad

TL;DR
This paper evaluates the performance of two decentralized learning algorithms, Trial and Error (TEL) and Optimal Dynamical Learning (ODL), by approximating complex Markov chains to compare their effectiveness in reaching optimal states.
Contribution
The paper introduces an approximation method for high-dimensional Markov chains to evaluate and compare the performance of TEL and ODL algorithms in decentralized settings.
Findings
ODL spends most of its time in optimal states maximizing total utility.
TEL's performance depends on the presence of a Pure Nash Equilibrium.
The approximation method effectively estimates time fractions and durations in complex Markov chains.
Abstract
Model-free decentralized optimizations and learning are receiving increasing attention from theoretical and practical perspectives. In particular, two fully decentralized learning algorithms, namely Trial and Error (TEL) and Optimal Dynamical Learning (ODL), are very appealing for a broad class of games. In fact, ODL has the property to spend a high proportion of time in an optimum state that maximizes the sum of utility of all players. And the TEL has the property to spend a high proportion of time in an optimum state that maximizes the sum of utility of all players if there is a Pure Nash Equilibrium (PNE), otherwise, it spends a high proportion of time in an optimum state that maximizes a tradeoff between the sum of utility of all players and a predefined stability function. On the other hand, estimating the mean fraction of time spent in the optimum state (as well as the mean time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
