Related papers: Arrow's Impossibility Theorem Without Unanimity
We formulate and discuss a general axiomatic theory of arbitrary objects. This theory is expressed in a simple first-order language without modal operators, and it is governed by classical logic.
In any physical theory that admits true indeterminism, the thermodynamic arrow of time can arise regardless of the system's initial conditions. Hence on such theories time's arrow emerges out of the basic physical interactions. The example…
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random…
This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman--Sondermann theorem within the framework of reverse…
The axionic weak gravity conjecture predicts the existence of instantons whose actions are less than their charges in appropriate units. We show that the conjecture is satisfied for the axion-dilaton-gravity system if we assume duality…
The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…
An AIA formula is one of the form 'A implies B' where A and B are purely universal. Up to a simple reduction AIA formula are both EA and AE. In an earlier paper Solovay, Harrison and I proved the undecidability of validity for the AIA…
On the basis of three physical axioms, we prove that if the choice of a particular type of spin 1 experiment is not a function of the information accessible to the experimenters, then its outcome is equally not a function of the information…
Problems with majority voting over pairs as represented by Arrow's Theoremand those of finding the lengths of closed paths as captured by the Traveling Salesperson Problem (TSP) appear to have nothing in common. In fact, they are connected.…
This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…
In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…
Given a set of conflicting arguments, there can exist multiple plausible opinions about which arguments should be accepted, rejected, or deemed undecided. We study the problem of how multiple such judgments can be aggregated. We define the…
The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic…
This paper introduces the axiom of Negative Dominance, stating that if a lottery $f$ is strictly preferred to a lottery $g$, then some outcome in the support of $f$ is strictly preferred to some outcome in the support of $g$. It is shown…
We investigate preference domains under which every unanimous and locally strategy-proof social choice function (scf) satisfies dictatorship. We identify a condition on domains called connected with distinct neighbours which is necessary…
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…
We provide a partial result on Taylor's modularity conjecture, and several related problems. Namely, we show that the interpretability join of two idempotent varieties that are not congruence modular is not congruence modular either, and we…
Agreement theorems are no-go results about rational disagreement: if two agents start from a common prior and their posterior beliefs are common knowledge, they cannot assign different probabilities to the same event. Standard treatments of…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…