The coordination issues of relocations: How proximity still matters in location of software development activities\r\n

The objective of this article is to investigate the dynamics of relocations at the micro-economic level. By proposing a grid of “dynamics of proximities”, we focus on the coordination issues which seem to be missing from most of analyses carried about relocations. We apply our framework to software development activities. The proposition we develop in this paper is the following: mobility, ICT use and modularity reduce the need for geographical proximity and favour relocations but, in order to succeed, relocations need to have the support of organisational and institutional proximities to ensure effective coordination between entities and individuals.relocation, software development, dynamics of proximity, coordination.

The coordination issues of relocations: How proximity still matters in location of software development activities\r\n

The objective of this article is to investigate the dynamics of relocations at the micro-economic level. By proposing a grid of “dynamics of proximities”, we focus on the coordination issues which seem to be missing from most of analyses carried about relocations. We apply our framework to software development activities. The proposition we develop in this paper is the following: mobility, ICT use and modularity reduce the need for geographical proximity and favour relocations but, in order to succeed, relocations need to have the support of organisational and institutional proximities to ensure effective coordination between entities and individuals.relocation, software development, dynamics of proximity, coordination

Metastability of Logit Dynamics for Coordination Games

Logit Dynamics [Blume, Games and Economic Behavior, 1993] are randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random and she chooses a new strategy according to a probability distribution biased toward strategies promising higher payoffs. This process defines an ergodic Markov chain, over the set of strategy profiles of the game, whose unique stationary distribution is the long-term equilibrium concept for the game. However, when the mixing time of the chain is large (e.g., exponential in the number of players), the stationary distribution loses its appeal as equilibrium concept, and the transient phase of the Markov chain becomes important. It can happen that the chain is "metastable", i.e., on a time-scale shorter than the mixing time, it stays close to some probability distribution over the state space, while in a time-scale multiple of the mixing time it jumps from one distribution to another. In this paper we give a quantitative definition of "metastable probability distributions" for a Markov chain and we study the metastability of the logit dynamics for some classes of coordination games. We first consider a pure $n$-player coordination game that highlights the distinctive features of our metastability notion based on distributions. Then, we study coordination games on the clique without a risk-dominant strategy (which are equivalent to the well-known Glauber dynamics for the Curie-Weiss model) and coordination games on a ring (both with and without risk-dominant strategy)

Sensorimotor coordination and metastability in a situated HKB model

Oscillatory phenomena are ubiquitous in nature and have become particularly relevant for the study of brain and behaviour. One of the simplest, yet explanatorily powerful, models of oscillatory Coordination Dynamics is the Haken–Kelso–Bunz (HKB) model. The metastable regime described by the HKB equation has been hypothesised to be the signature of brain oscillatory dynamics underlying sensorimotor coordination. Despite evidence supporting such a hypothesis, to our knowledge, there are still very few models (if any) where the HKB equation generates spatially situated behaviour and, at the same time, has its dynamics modulated by the behaviour it generates (by means of the sensory feedback resulting from body movement). This work presents a computational model where the HKB equation controls an agent performing a simple gradient climbing task and shows (i) how different metastable dynamical patterns in the HKB equation are generated and sustained by the continuous interaction between the agent and its environment; and (ii) how the emergence of functional metastable patterns in the HKB equation – i.e. patterns that generate gradient climbing behaviour – depends not only on the structure of the agent's sensory input but also on the coordinated coupling of the agent's motor–sensory dynamics. This work contributes to Kelso's theoretical framework and also to the understanding of neural oscillations and sensorimotor coordination

Large Fluctuations and Fixation in Evolutionary Games

We study large fluctuations in evolutionary games belonging to the coordination and anti-coordination classes. The dynamics of these games, modeling cooperation dilemmas, is characterized by a coexistence fixed point separating two absorbing states. We are particularly interested in the problem of fixation that refers to the possibility that a few mutants take over the entire population. Here, the fixation phenomenon is induced by large fluctuations and is investigated by a semi-classical WKB (Wentzel-Kramers-Brillouin) theory generalized to treat stochastic systems possessing multiple absorbing states. Importantly, this method allows us to analyze the combined influence of selection and random fluctuations on the evolutionary dynamics \textit{beyond} the weak selection limit often considered in previous works. We accurately compute, including pre-exponential factors, the probability distribution function in the long-lived coexistence state and the mean fixation time necessary for a few mutants to take over the entire population in anti-coordination games, and also the fixation probability in the coordination class. Our analytical results compare excellently with extensive numerical simulations. Furthermore, we demonstrate that our treatment is superior to the Fokker-Planck approximation when the selection intensity is finite.Comment: 17 pages, 10 figures, to appear in JSTA