Dynamics of a Stratified Population of Optimum Seeking Agents on a Network—Part II: Steady-State Analysis
- 2 November 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1116-1127
Abstract
In this second part of our work, we study the steady state of the population and the social utility for a general class of dynamics that converge to the set of Nash equilibria and follow a certain positive correlation property. This class of dynamics includes the three dynamics introduced in the first part. We provide sufficient conditions on the network based on a maximum payoff density parameter of each node under which there exists a unique Nash equilibrium. We then utilize the positive correlation properties of the dynamics to reduce the flow graph in order to provide an upper bound on the steady-state social utility. Finally, we extend the idea behind the sufficient condition for the existence of a unique Nash equilibrium to partition the graph appropriately in order to provide a lower bound on the steady-state social utility. We also illustrate interesting cases as well as our results using simulations.Keywords
Funding Information
- Centre for Networked Intelligence (a Cisco CSR initiative) of the Indian Institute of Science
- Robert Bosch Centre for Cyber-Physical Systems, Indian Institute of Science
This publication has 19 references indexed in Scilit:
- Evolutionary dynamics on any population structureNature, 2017
- The Role of Population Games and Evolutionary Dynamics in Distributed Control Systems: The Advantages of Evolutionary Game TheoryIEEE Control Systems, 2017
- Distributed Population Dynamics: Optimization and Control ApplicationsIEEE Transactions on Systems, Man, and Cybernetics: Systems, 2016
- Evolutionary graph theory revisited: when is an evolutionary process equivalent to the Moran process?Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2015
- Games on graphsEMS Surveys in Mathematical Sciences, 2014
- Evolutionary dynamics on graphsNature, 2005
- Convex Optimization2004
- A finite algorithm for concave minimization over a polyhedronNaval Research Logistics Quarterly, 1985
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- An algorithm for determining all extreme points of a convex polytopeMathematical Programming, 1977