Voting Rules that are Unbiased but not Transitive-Symmetric
نویسندگان
چکیده
منابع مشابه
Nonexistence of Voting Rules That Are Usually Hard to Manipulate
Aggregating the preferences of self-interested agents is a key problem for multiagent systems, and one general method for doing so is to vote over the alternatives (candidates). Unfortunately, the Gibbard-Satterthwaite theorem shows that when there are three or more candidates, all reasonable voting rules are manipulable (in the sense that there exist situations in which a voter would benefit f...
متن کاملVertex-transitive Haar graphs that are not Cayley graphs
In a recent paper (arXiv:1505.01475 ) Estélyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley. The smallest example has 40 vertices and is the well-known Kronecker cover over the dodecahedron graph G(10, 2), occurring as the...
متن کاملM ar 2 00 7 A 27 - vertex graph that is vertex - transitive and edge - transitive but not l - transitive
I describe a 27-vertex graph that is vertex-transitive and edgetransitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms. A graph (undirected, without loops or multiple edges) is said to be vertextransitive if its automorphism group acts transitively on the set of vertices, edge-transitive if its automorphism group ac...
متن کاملDerivatives of erythropoietin that are tissue protective but not erythropoietic.
Erythropoietin (EPO) is both hematopoietic and tissue protective, putatively through interaction with different receptors. We generated receptor subtype-selective ligands allowing the separation of EPO's bioactivities at the cellular level and in animals. Carbamylated EPO (CEPO) or certain EPO mutants did not bind to the classical EPO receptor (EPOR) and did not show any hematopoietic activity ...
متن کاملSpaces That Are Connected but Not Path-connected
A topological space X is called connected if it’s impossible to write X as a union of two nonempty disjoint open subsets: if X = U ∪ V where U and V are open subsets of X and U ∩ V = ∅ then one of U or V is empty. Intuitively, this means X consists of one piece. A subset of a topological space is called connected if it is connected in the subspace topology. The most fundamental example of a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8795