Name
Abstract | ||
|---|---|---|
We propose an analytic framework for multi-agent learning that, unlike standard approaches, is not connected to convergence to an equilibrium concept nor to payoff guarantees for the agents. We view multi-agent systems as reservoirs that allow for the long term survival of rich spatiotemporal correlations (i.e., patterns) amongst the agents' behaviors. Our aim is to develop abstractions that allow us to capture details about the possible limit behaviors of such systems. Our approach is based on the contrast between weakly and strongly persistent properties. Informally, a property is weakly persistent if for each starting point there exist limit points that satisfy it. A property is strongly persistent if it is satisfied by all limit points. In the case of non-converging dynamics the set of weakly persistent properties can be significantly richer than that of the strongly persistent properties reflecting topological properties of the system limit sets in a concise and algorithmically tractable manner. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.5555/2615731.2615763 | AAMAS |
Keywords | Field | DocType |
analytic framework,weakly persistent property,system limit set,multi-agent learning,algorithmically tractable manner,persistent pattern,multi-agent system,limit point,topological property,possible limit behavior,persistent property | Information theory,Convergence (routing),Mathematical optimization,Computer science,Replicator equation,Multi-agent system,Dynamical systems theory,Game theory,Limit point,Stochastic game | Conference |
Citations | PageRank | References |
11 | 0.75 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgios Piliouras | 1 | 250 | 42.77 |
| Carlos Nieto-Granda | 2 | 50 | 7.37 |
| Henrik I. Christensen | 3 | 2848 | 235.82 |
| Jeff S. Shamma | 4 | 1234 | 153.33 |