2,770 research outputs found
Exploiting Polyhedral Symmetries in Social Choice
A large amount of literature in social choice theory deals with quantifying
the probability of certain election outcomes. One way of computing the
probability of a specific voting situation under the Impartial Anonymous
Culture assumption is via counting integral points in polyhedra. Here, Ehrhart
theory can help, but unfortunately the dimension and complexity of the involved
polyhedra grows rapidly with the number of candidates. However, if we exploit
available polyhedral symmetries, some computations become possible that
previously were infeasible. We show this in three well known examples:
Condorcet's paradox, Condorcet efficiency of plurality voting and in Plurality
voting vs Plurality Runoff.Comment: 14 pages; with minor improvements; to be published in Social Choice
and Welfar
Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space
Creating a swarm of mobile computing entities frequently called robots,
agents or sensor nodes, with self-organization ability is a contemporary
challenge in distributed computing. Motivated by this, we investigate the plane
formation problem that requires a swarm of robots moving in the three
dimensional Euclidean space to land on a common plane. The robots are fully
synchronous and endowed with visual perception. But they do not have
identifiers, nor access to the global coordinate system, nor any means of
explicit communication with each other. Though there are plenty of results on
the agreement problem for robots in the two dimensional plane, for example, the
point formation problem, the pattern formation problem, and so on, this is the
first result for robots in the three dimensional space. This paper presents a
necessary and sufficient condition for fully-synchronous robots to solve the
plane formation problem that does not depend on obliviousness i.e., the
availability of local memory at robots. An implication of the result is
somewhat counter-intuitive: The robots cannot form a plane from most of the
semi-regular polyhedra, while they can form a plane from every regular
polyhedron (except a regular icosahedron), whose symmetry is usually considered
to be higher than any semi-regular polyhedrdon
Playing Billiard in Version Space
A ray-tracing method inspired by ergodic billiards is used to estimate the
theoretically best decision rule for a set of linear separable examples. While
the Bayes-optimum requires a majority decision over all Perceptrons separating
the example set, the problem considered here corresponds to finding the single
Perceptron with best average generalization probability. For randomly
distributed examples the billiard estimate agrees with known analytic results.
In real-life classification problems the generalization error is consistently
reduced compared to the maximal stability Perceptron.Comment: uuencoded, gzipped PostScript file, 127576 bytes To recover 1) save
file as bayes.uue. Then 2) uudecode bayes.uue and 3) gunzip bayes.ps.g
Geometric Entanglement of Symmetric States and the Majorana Representation
Permutation-symmetric quantum states appear in a variety of physical
situations, and they have been proposed for quantum information tasks. This
article builds upon the results of [New J. Phys. 12, 073025 (2010)], where the
maximally entangled symmetric states of up to twelve qubits were explored, and
their amount of geometric entanglement determined by numeric and analytic
means. For this the Majorana representation, a generalization of the Bloch
sphere representation, can be employed to represent symmetric n qubit states by
n points on the surface of a unit sphere. Symmetries of this point distribution
simplify the determination of the entanglement, and enable the study of quantum
states in novel ways. Here it is shown that the duality relationship of
Platonic solids has a counterpart in the Majorana representation, and that in
general maximally entangled symmetric states neither correspond to anticoherent
spin states nor to spherical designs. The usability of symmetric states as
resources for measurement-based quantum computing is also discussed.Comment: 10 pages, 8 figures; submitted to Lecture Notes in Computer Science
(LNCS
- …