Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sarah Toonsi

dblp:312/9815 · also Sarah A. Toonsi · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Artificial intelligence
1 paper
Multi-agent systems · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › multi-agent systems
multi-agent learning
0.712023
Higher-Order Uncoupled Dynamics Do Not Lead to Nash Equilibrium - Except When They Do · NeurIPS 2023
Algorithmic game theory and mechanism design › game dynamics › equilibrium convergence
nash equilibrium convergence
0.712023
Higher-Order Uncoupled Dynamics Do Not Lead to Nash Equilibrium - Except When They Do · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

gradient play · 1.3dynamical systems analysis · 1.3
YearPublicationVenuePosition
2023 Higher-Order Uncoupled Dynamics Do Not Lead to Nash Equilibrium - Except When They Do
abstract
The framework of multi-agent learning explores the dynamics of how an agent's strategies evolve in response to the evolving strategies of other agents. Of particular interest is whether or not agent strategies converge to well known solution concepts such as Nash Equilibrium (NE). In "higher order'' learning, agent dynamics include auxiliary states that can capture phenomena such as path dependencies. We introduce higher-order gradient play dynamics that resemble projected gradient ascent with auxiliary states. The dynamics are "payoff based'' and "uncoupled'' in that each agent's dynamics depend on its own evolving payoff and has no explicit dependence on the utilities of other agents. We first show that for any specific game with an isolated completely mixed-strategy NE, there exist higher-order gradient play dynamics that lead (locally) to that NE, both for the specific game and nearby games with perturbed utility functions. Conversely, we show that for any higher-order gradient play dynamics, there exists a game with a unique isolated completely mixed-strategy NE for which the dynamics do not lead to NE. Finally, we show that convergence to the mixed-strategy equilibrium in coordination games, comes at the expense of the dynamics being inherently internally unstable.
Sarah Toonsi, Jeff S. Shamma
NeurIPS1