Related papers: Dynamics of a Stratified Population of Optimum See…
We address the problem of understanding the variable abundance of 3-node and 4-node subgraphs (motifs) in complex networks from a dynamical point of view. As a criterion in the determination of the functional significance of a n-node…
Sequential allocation is a simple mechanism for sharing multiple indivisible items. We study strategic behavior in sequential allocation. In particular, we consider Nash dynamics, as well as the computation and Pareto optimality of pure…
We study the drivers and spatial diffusion of U.S. state population growth using a dynamic spatial model for 49 states, 1965-2017. Methodologically, we recover the spatial network structure from the data, rather than imposing it a priori…
We investigate the sensitivity of the Nash equilibrium of constrained network aggregative games to changes in exogenous parameters affecting the cost function of the players. This setting is motivated by two applications. The first is the…
In many real-world large-scale decision problems, self-interested agents have individual dynamics and optimize their own long-term payoffs. Important examples include the competitive access to shared resources (e.g., roads, energy, or…
We propose and study a model of strategic network design and exploration where the hider, subject to a budget constraint restricting the number of links, chooses a connected network and the location of an object. Meanwhile, the seeker, not…
We discuss the long-run behavior of stochastic dynamics of many interacting players in spatial evolutionary games. In particular, we investigate the effect of the number of players and the noise level on the stochastic stability of Nash…
Building upon the results in [Hinterm\"uller et al., SIAM J. Optim, '15], generalized Nash equilibrium problems are considered, in which the feasible set of each player is influenced by the decisions of their competitors. This is realized…
How do networks of relationships evolve over time? We analyse a dataset tracking the social interactions of 900 individuals over four years. Despite continuous shifts in individual relationships, the macroscopic structural properties of the…
In this paper, we investigate the seeking of Nash equilibrium (NE) in a non-cooperative quadratic game where all agents exchange their delayed strategy information with their neighbors. To extend best-response algorithms to the delayed…
We study the connection between the evolutionary replicator dynamics and the number of Nash equilibria in large random bi-matrix games. Using techniques of disordered systems theory we compute the statistical properties of both, the fixed…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed…
We consider the scenario where $N$ utilities strategically bid for electricity in the day-ahead market and balance the mismatch between the committed supply and actual demand in the real-time market, with uncertainty in demand and local…
Residential segregation in metropolitan areas is a phenomenon that can be observed all over the world. Recently, this was investigated via game-theoretic models. There, selfish agents of two types are equipped with a monotone utility…
This work examines a stochastic formulation of the generalized Nash equilibrium problem (GNEP) where agents are subject to randomness in the environment of unknown statistical distribution. We focus on fully-distributed online learning by…
This paper studies a strategic model of marketing and product diffusion in social networks. We consider two firms offering substitutable products which can improve their market share by seeding the key individuals in the market. Consumers…
The equilibrium properties of allocation algorithms for networks with a large number of nodes with finite capacity are investigated. Every node is receiving a flow of requests and when a request arrives at a saturated node, i.e. a node…
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over…
This paper considers non-cooperative and fully-distributed power-allocation for secondary-users (SUs) in spectrum-sharing environments when normalized-interference to each secondary-user is uncertain. We model each uncertain parameter by…