As opposed to the classical voting system (one person one decision one vote) a new voting system is deÞned where agents are endowed with a given number of votes that can be distributed freely between a prearranged number of issues that have to be approved or dismissed. Its essence relies on allowing voters to express the intensity of their preferences in a simple and applicable manner. From a m...

The human visual system is able to accurately determine the color of objects irrespective of the spectral power distribution used to illuminate the scene. This ability to compute color constant descriptors is called color constancy. Many different algorithms have been proposed to solve the problem of color constancy. Usually, some assumptions have to be made in order to solve this problem. Algo...

The statistical analysis of functional data is a growing need in many research areas. We propose a new depth notion for functional observations based on the graphic representation of the curves. Given a collection of functions, it allows to establish the “centrality” of a function and provides a natural center-outward ordering of the sample curves. Robust statistics such as the median function ...

We show that Nechiporuk’s method [14] for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an Ω(n2/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [15] states that the majority function does not have a linear–size quantum formula.

We study the circuit complexity of boolean functions in a certain infinite basis. The basis consists of all functions that take value 1 on antichains over the boolean cube. We prove that the circuit complexity of the parity function and the majority function of n variables in this basis is b 2 c and ⌊ n 2 ⌋ +1 respectively. We show that the asymptotic of the maximum complexity of n-variable boo...

The paper concerns a model of influence in which agents make their decisions on a certain issue. We assume that each agent is inclined to make a particular decision, but due to a possible influence of the others, his final decision may be different from his initial inclination. Since in reality the influence does not necessarily stop after one step, but may iterate, we present a model which all...

In the area of legislative choice, social choice theorists have focused on the equilibrium properties of pure majority rule (PMR), operating according to the implicit belief that whatever is true about the PMR mechanism also applies to institutions based upon it. This view has encouraged the study of what seemed to be the general case, thereby avoiding the narrower study of special cases such a...

We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms. We can think of agents in a coevolutionary system as performing MOO, as well: An agent interacts with many other agents, each of which can be regarded as an objective for optimization. We adapt the Pareto concept to ...