Stochastic Coalitional Better-response Dynamics and Strong Nash Equilibrium
Konstantin Avrachenkov (MAESTRO), Vikas Vikram Singh (MAESTRO)

TL;DR
This paper introduces a stochastic coalition-based dynamic process in finite strategic games, demonstrating that strong Nash equilibria and stable networks are stochastically stable under perturbations, with implications for network formation.
Contribution
It develops a novel stochastic coalition better-response dynamics framework and proves stability of strong Nash equilibria and networks under perturbations.
Findings
Strong Nash equilibria are stochastically stable.
Closed cycles are stochastically stable.
Applicable to network formation games with stable networks.
Abstract
We consider coalition formation among players in an n-player finite strategic game over infinite horizon. At each time a randomly formed coalition makes a joint deviation from a current action profile such that at new action profile all players from the coalition are strictly benefited. Such deviations define a coalitional better-response (CBR) dynamics that is in general stochastic. The CBR dynamics either converges to a strong Nash equilibrium or stucks in a closed cycle. We also assume that at each time a selected coalition makes mistake in deviation with small probability that add mutations (perturbations) into CBR dynamics. We prove that all strong Nash equilibria and closed cycles are stochastically stable, i.e., they are selected by perturbed CBR dynamics as mutations vanish. Similar statement holds for strict strong Nash equilibrium. We apply CBR dynamics to the network…
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.
Taxonomy
TopicsGame Theory and Applications · Game Theory and Voting Systems · Opinion Dynamics and Social Influence
