Breaking Symmetries

A well-known result by Palamidessi tells us that {\pi}mix (the {\pi}-calculus with mixed choice) is more expressive than {\pi}sep (its subset with only separate choice). The proof of this result argues with their different expressive power concerning leader election in symmetric networks. Later on, Gorla of- fered an arguably simpler proof that, instead of leader election in symmetric networks, employed the reducibility of "incestual" processes (mixed choices that include both enabled senders and receivers for the same channel) when running two copies in parallel. In both proofs, the role of breaking (ini- tial) symmetries is more or less apparent. In this paper, we shed more light on this role by re-proving the above result-based on a proper formalization of what it means to break symmetries-without referring to another layer of the distinguishing problem domain of leader election. Both Palamidessi and Gorla rephrased their results by stating that there is no uniform and reason- able encoding from {\pi}mix into {\pi}sep . We indicate how the respective proofs can be adapted and exhibit the consequences of varying notions of uniformity and reasonableness. In each case, the ability to break initial symmetries turns out to be essential

Emergent velocity agreement in robot networks

In this paper we propose and prove correct a new self-stabilizing velocity agreement (flocking) algorithm for oblivious and asynchronous robot networks. Our algorithm allows a flock of uniform robots to follow a flock head emergent during the computation whatever its direction in plane. Robots are asynchronous, oblivious and do not share a common coordinate system. Our solution includes three modules architectured as follows: creation of a common coordinate system that also allows the emergence of a flock-head, setting up the flock pattern and moving the flock. The novelty of our approach steams in identifying the necessary conditions on the flock pattern placement and the velocity of the flock-head (rotation, translation or speed) that allow the flock to both follow the exact same head and to preserve the flock pattern. Additionally, our system is self-healing and self-stabilizing. In the event of the head leave (the leading robot disappears or is damaged and cannot be recognized by the other robots) the flock agrees on another head and follows the trajectory of the new head. Also, robots are oblivious (they do not recall the result of their previous computations) and we make no assumption on their initial position. The step complexity of our solution is O(n)

Non-Local Probes Do Not Help with Graph Problems

This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to be much more powerful than distributed message-passing algorithms: centralised algorithms can directly probe any part of the input, while in distributed algorithms nodes can only communicate with their immediate neighbours. We show that for a large class of graph problems, this extra freedom does not help centralised algorithms at all: for example, efficient stateless deterministic centralised local algorithms can be simulated with efficient distributed message-passing algorithms. In particular, this enables us to transfer existing lower bound results from distributed algorithms to centralised local algorithms

The ISCIP Analyst, Volume IX, Issue 2

This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

The ISCIP Analyst, Volume X, Issue 1

This repository item contains a single issue of The ISCIP Analyst, an analytical review journal published from 1996 to 2010 by the Boston University Institute for the Study of Conflict, Ideology, and Policy

Tax competition as a cause of falling corporate income taxes. A literature survey.

Tax rates on capital income, corporate income tax rates in particular, have been declining in most industrialized countries since the mid 1980ies. Among the explanations for this development tax competition between countries for mobile capital has been mentioned frequently. A vast empirical literature dealing with tax competition for mobile capital has emerged. This paper gives a comprehensive overview of these empirical studies. A particular focus is put on studies modelling strategic interaction in tax policies of competing jurisdictions - which is at the heart of the competition concept. The paper also addresses the issue whether existing studies convincingly isolate tax competition as a driver of falling capital / corporate income tax rates. Given the empirical evidence surveyed it appears that tax rates indeed fall due to tax competition, in particular due to competition for new firms and for paper profits. However, closer look at the empirical approaches applied in the papers surveyed suggests that fully convincing evidence establishing tax competition as driver of falling tax rates is still lacking.Series: Discussion Papers SFB International Tax Coordinatio