All Issues

Volume 9, 2022

Volume 8, 2021

Volume 7, 2020

Volume 6, 2019

Volume 5, 2018

Volume 4, 2017

Volume 3, 2016

Volume 2, 2015

Volume 1, 2014

Journal of Dynamics and Games

October 2016 , Volume 3 , Issue 4

Select all articles


Network formation games with teams
Konstantin Avrachenkov, Giovanni Neglia and Vikas Vikram Singh
2016, 3(4): 303-318 doi: 10.3934/jdg.2016016 +[Abstract](3704) +[PDF](393.4KB)
Network formation games have been proposed as a tool to explain the topological characteristics of existing networks. They assume that each node is an autonomous decision-maker, ignoring that in many cases different nodes are under the control of the same authority (e.g. an Autonomous System) and then they operate as a team. In this paper we introduce the concept of network formation games for teams of nodes and show how very different network structures can arise also for some simple games studied in the literature. Beside extending the usual definition of pairwise stable networks to this new setting, we define a more general concept of stability toward deviations from a specific set $\mathcal{C}$ of teams' coalitions ($\mathcal{C}$-stability). We study then a trembling-hand dynamics, where at each time a coalition of teams can create or sever links in order to reduce its cost, but it can also take wrong decisions with some small probability. We show that this stochastic dynamics selects $\mathcal{C}$-stable networks or networks from closed cycles in the long run as the error probability vanishes.
Competition with high number of agents and a major one
Valeria De Mattei
2016, 3(4): 319-334 doi: 10.3934/jdg.2016017 +[Abstract](2349) +[PDF](353.5KB)
In the framework of mean field game theory, a new optimization problem is presented by adding an additional player, called the principal. After introducing a proper payoff for the principal, continuity and existence of minimum is proved. Some considerations about uniqueness and possible ways of continuing the analysis of this problem are given.
Interception in differential pursuit/evasion games
John A. Morgan
2016, 3(4): 335-354 doi: 10.3934/jdg.2016018 +[Abstract](2961) +[PDF](754.9KB)
A qualitative criterion for a pursuer to intercept a target in a class of differential games is obtained in terms of future cones: Topological cones that contain all attainable trajectories of target or interceptor originating from an initial position. An interception solution exists after some initial time iff the future cone of the target lies within the future cone of the interceptor. The solution may be regarded as a kind of Nash equilibrium. This result is applied to two examples:
1. The game of Two Cars: The future cone condition is shown to be equivalent to conditions for interception obtained by Cockayne.
2. Satellite warfare: The future cone for a spacecraft or direct-ascent antisatellite weapon (ASAT) maneuvering in a central gravitational field is obtained and is shown to equal that for a spacecraft which maneuvers solely by means of a single velocity change at the cone vertex.
    The latter result is illustrated with an analysis of the January 2007 interception of the FengYun-1C spacecraft.
Conflict, private and communal property
Pablo Sánchez and Jaume Sempere
2016, 3(4): 355-369 doi: 10.3934/jdg.2016019 +[Abstract](3001) +[PDF](395.6KB)
This paper develops a model where agents can create private property rights on a resource by making appropriative activities. We show that the value of the resource has a non-monotonic effect on the emergence of private property. When the resource is sufficiently valuable, agents have an incentive to leave a sharing agreement and private property can appear. However if the value of the resource increases beyond a given threshold, deviations from the sharing agreement leads to a very costly confrontation. In this case, private property is not sustainable. Our analysis also finds that population size has an important effect on the size of the parameter set in which private property is sustainable.
Optimal strategies for operating energy storage in an arbitrage or smoothing market
Lisa C Flatley, Robert S MacKay and Michael Waterson
2016, 3(4): 371-398 doi: 10.3934/jdg.2016020 +[Abstract](3904) +[PDF](831.3KB)
We characterize cost-minimizing operating strategies for an energy store over a given interval of time $[0,T]$. The cost functional here can represent, for example, a traditional economic cost or a penalty for time-variation of the output from a storage-assisted wind farm or more general imbalance between supply and demand. Our analysis allows for leakage, operating inefficiencies and general cost functionals. In the case where the cost of a store depends only on its instantaneous power output (or input), we present an algorithm to determine the optimal strategies. A key feature is that this algorithm is localized in time, in the sense that the action of the store at a time $t\in[0,T]$ requires cost information over only some usually much shorter subinterval of time $[t,t_k]\subset[t,T].$

2020 CiteScore: 0.6



Email Alert

[Back to Top]