Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence

DOI10.1137/1.9781611973402.64zbMath1435.91029OpenAlexW4256482224MaRDI QIDQ5384025

Georgios Piliouras, Jeff S. Shamma

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.64

zbMATH Keywords

zero-sum gamesevolutionary dynamicsdecentralized systemsnetwork extensionsPoincaré recurrence theory

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Decentralized systems (93A14) Evolutionary games (91A22) Networked control (93B70) Algorithmic game theory and complexity (91A68)

Related Items (4)

Bifurcation mechanism design -- from optimal flat taxes to better cancer treatments ⋮ Inactivation of tumor suppressor genes and cancer therapy: an evolutionary game theory approach ⋮ A stochastic variant of replicator dynamics in zero-sum games and its invariant measures ⋮ From Darwin to Poincaré and von Neumann: recurrence and cycles in evolutionary and algorithmic game theory

This page was built for publication: Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence