Distributed anonymous function computation in information fusion and multiagent systems

We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes, with bounded computation and storage capabilities that do not scale with the network size. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we exhibit a class of non-computable functions, and prove that every function outside this class can at least be approximated. The problem of computing averages in a distributed manner plays a central role in our development

Continuous-time average-preserving opinion dynamics with opinion-dependent communications

We study a simple continuous-time multi-agent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by every other value differing from it by less than 1, with an intensity proportional to the difference. We prove convergence to a set of clusters, with the agents in each cluster sharing a common value, and provide a lower bound on the distance between clusters at a stable equilibrium, under a suitable notion of multi-agent system stability. To better understand the behavior of the system for a large number of agents, we introduce a variant involving a continuum of agents. We prove, under some conditions, the existence of a solution to the system dynamics, convergence to clusters, and a non-trivial lower bound on the distance between clusters. Finally, we establish that the continuum model accurately represents the asymptotic behavior of a system with a finite but large number of agents.Comment: 25 pages, 2 figures, 11 tex files and 2 eps file

Out-of-plane coupling structures for optical printed circuit boards

We present an integrated total internal reflection mirror and pluggable coupler that can be used for out-of-plane coupling in an optical PCB. The coupling efficiency of both mirror configurations is measured and compared

Compromise Solutions for Bankruptcy Situations with References

This paper deals with bankruptcy situations in which in addition to the claims, an exogenously given reference point for the allocation of the estate is present.We introduce and analyse two types of compromise solutions and show that they coincide with the T value of two corresponding TU games.We apply our solutions to a real-life case of allocating university money to degree courses.bankruptcy;allocation;t-value;games

Towards Low Cost Coupling Structures for Short-Distance Optical Interconnections

The performance of short distance optical interconnections in general relies very strongly on coupling structures, since they will determine the overall efficiency of the system to a large extent. Different configurations can be considered and a variety of manufacturing technologies can be used. We present two different discrete and two different integrated coupling components which can be used to deflect the light beam over 90 degrees and can play a crucial role when integrating optical interconnections in printed circuit boards. The fabrication process of the different coupling structures is discussed and experimental results are shown. The main characteristics of the coupling structures are given. The main advantages and disadvantages of the different components are discussed

Convergence of type-symmetric and cut-balanced consensus seeking systems (extended version)

We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones by at least a proportional amount. Models involving symmetric interconnections and models in which a weighted average of the agent values is conserved are special cases. We prove that such systems always converge. We give a sufficient condition on the evolving interaction topology for the limit values of two agents to be the same. Conversely, we show that if our condition is not satisfied, then these limits are generically different. These results allow treating systems where the agent interactions are a priori unknown, e.g., random or determined endogenously by the agent values. We also derive corresponding results for discrete-time systems.Comment: update of the file following publication of journal version, including a minor correction in the proof of theorem 1(b). 12 pages, 12 tex files, no figur