Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of a pure strategy e-Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an information theoretic lower bound, in a value oracle model, on approximating the structure of the digraph with non-negative monotone sub-modular cost functions on the edge set cardinality. We also define a new notion of structural stability, and introduce 7-aggregative games that generalize local aggregative games and admit e-Nash equilibrium that is stable with respect to small changes in some specified graph property. Moreover, we provide algorithms for our models that can meaningfully estimate the game structure and the parameters of the aggregator function from real voting data.
|Number of pages||11|
|Journal||ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS|
|Publication status||Published - 2017|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE Conference on Neural Information Processing Systems - Long Beach, United States|
Duration: 4 Dec 2017 → 9 Dec 2017
Conference number: 31