🤖 AI Summary
Traditional population games fail to capture realistic multi-level decision-making structures. Method: This paper proposes a hierarchical game modeling framework wherein individuals delegate decision-making authority to agents representing their strategic interests, yielding a three-tier “individual–agent–population” architecture. We formulate a hierarchical game model with general convex constraints, enabling inter-agent strategic interactions and coupled constraints without requiring individuals to know global constraints. Leveraging equilibrium existence analysis and iterative algorithm convergence theory, we develop a systematic solution methodology. Contribution/Results: We establish, for the first time, the existence of generalized Nash equilibria under this hierarchical structure and prove the convergence of a distributed algorithm for computing them. Experimental validation on a capacity-constrained urban navigation application demonstrates both the expressive power and computational efficacy of the proposed framework.
📝 Abstract
This paper introduces a hierarchical framework for population games, where individuals delegate decision-making to proxies that act within their own strategic interests. This framework extends classical population games, where individuals are assumed to make decisions directly, to capture various real-world scenarios involving multiple decision layers. We establish equilibrium properties and provide convergence results for the proposed hierarchical structure. Additionally, based on these results, we develop a systematic approach to analyze population games with general convex constraints, without requiring individuals to have full knowledge of the constraints as in existing methods. We present a navigation application with capacity constraints as a case study.