Conventions spreading in open-ended systems

We introduce a simple open-ended model that describes the emergence of a shared vocabulary. The ordering transition toward consensus is generated only by an agreement mechanism. This interaction defines a finite and small number of states, despite each individual having the ability to invent an unlimited number of new words. The existence of a phase transition is studied by analyzing the convergence times, the cognitive efforts of the agents and the scaling behavior in memory and timeComment: 11 pages, 5 figure

Dynamical organization towards consensus in the Axelrod model on complex networks

We analyze the dynamics toward cultural consensus in the Axelrod model on scale-free networks. By looking at the microscopic dynamics of the model, we are able to show how culture traits spread across different cultural features. We compare the diffusion at the level of cultural features to the growth of cultural consensus at the global level, finding important differences between these two processes. In particular, we show that even when most of the cultural features have reached macroscopic consensus, there are still no signals of globalization. Finally, we analyze the topology of consensus clusters both for global culture and at the feature level of representation.Comment: 8 pages, 7 figures. Final version published in Physical Review

Finite-time Convergent Gossiping

Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to analyzing and improving the asymptotic rate of convergence for gossip algorithms. In this work we study finite-time convergence of deterministic gossiping. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists an asymmetric gossip algorithm with finite-time convergence, independent of the number of nodes. For $n=2^m$ nodes, we prove that a fastest convergence can be reached in $nm=n\log_2 n$ node updates via symmetric gossiping. On the other hand, under asymmetric gossip among $n=2^m+r$ nodes with $0\leq r<2^m$, it takes at least $mn+2r$ node updates for achieving finite-time convergence. It is also shown that the existence of finite-time convergent gossiping often imposes strong structural requirements on the underlying interaction graph. Finally, we apply our results to gossip algorithms in quantum networks, where the goal is to control the state of a quantum system via pairwise interactions. We show that finite-time convergence is never possible for such systems.Comment: IEEE/ACM Transactions on Networking, In Pres

Values in Exchange: Ambiguous Ownership, Collective Action, and Changing Notions of Worth in Romanian Mutual Fund Industry

This paper analyzes the political disputes and legal contentions occasioned by the process of regulatory reform undergone by Romanian mutual fund industry. Stirred by Romania’s accession into the European Union in 2007 and prompted by the numerous financial scandals affecting the market right from its creation in 1994, the reform is meant as a reconfiguration of the investment philosophy characterizing the capital market. My claim is that the uneasy reception of the new institutional arrangement is related to the shifting premises for the formation of value and the deeper changes in the prevalent conceptions of worth associated with Romania’s economic transition

Incorporating stakeholders’ knowledge in group decision-making

International audienc