All these premises having, as I think, been clearly made out, it is impossible that the rulers now on earth should make any benefit, or derive any the least shadow of authority from that, which is held to be the fountain of all power, Adam's private dominion and paternal jurisdiction; so that he that will not give just occasion to think that all government in the world is the product only of force and violence, and that men live together by no other rules but that of beasts, where the strongest carries it, and so lay a foundation for perpetual disorder and mischief, tumult, sedition and rebellion, (things that the followers of that hypothesis so loudly cry out against) must of necessity find out another rise of government, another original of political power, and another way of designing and knowing the persons that have it, than what Sir Robert Filmer hath taught us.

Two Treatises of Government.

Anarchy, state, and utopia

Agreeing to disagree.

http://rcer.econ.rochester.edu/RCERPAPERS/rcer_578.pdf

Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update

The rapidly growing field of computational social choice, at the intersection of computer science and economics, deals with the computational aspects of collective decision making. This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions. Topics include voting theory (such as the computational complexity of winner determination and manipulation in elections), fair allocation (such as algorithms for dividing divisible and indivisible goods), coalition formation (such as matching and hedonic games), and many more. Graduate students, researchers, and professionals in computer science, economics, mathematics, political science, and philosophy will benefit from this accessible and self-contained book.

/pdf/handbook-of-computational-social-choice-12i1xbv1b8.pdf

Handbook of Computational Social Choice

http://www2.kobe-u.ac.jp/~emiya437/papers/JuMiyagawaSakai2005Aug.pdf

Non-manipulable division rules in claim problems and generalizations

In claims problems, we study coalitional manipulations via claims merging and splitting. We characterize (division) rules that are non-manipulable via (pairwise) splitting and that also satisfy standard axioms of equal treatment of equals, consistency, and continuity. And we obtain a similar result for non-manipulability via (pairwise) merging.

Manipulation via merging and splitting in claims problems

We consider the problem of choosing a subset of a finite set of indivisible objects (public projects, facilities, laws, etc.) studied by Barbera et al. (1991). Here we assume that agents’ preferences are separable weak orderings. Given such a preference, objects are partitioned into three types, “goods”, “bads”, and “nulls”. We focus on “voting rules”, which rely only on this partition rather than the full information of preferences. We characterize voting rules satisfying strategy-proofness (no one can ever be better off by lying about his preference) and null-independence (the decision on each object should not be dependent on the preference of an agent for whom the object is a null). We also show that serially dictatorial rules are the only voting rules satisfying efficiency as well as the above two axioms. We show that the “separable domain” is the unique maximal domain over which each rule in the first characterization, satisfying a certain fairness property, is strategy-proof.

/pdf/a-characterization-of-strategy-proof-voting-rules-for-4hg2ouepte.pdf

A characterization of strategy-proof voting rules for separable weak orderings

We identify general domain properties that induce the non-existence of efficient, strategy-proof, and non-dictatorial rules in the 2-agent exchange economy. Applying these properties, we establish impossibility results in several restricted domains; for example, the intertemporal exchange problem (without saving technology) with preferences represented by the discounted sum of a temporal utility function, the “risk sharing problem” with risk averse expected utility preferences, the CES-preference domain, etc. None of the earlier studies applies to these examples.

/pdf/strategy-proofness-versus-efficiency-in-exchange-economies-4592e4od6t.pdf

Strategy-Proofness versus Efficiency in Exchange Economies: General Domain Properties and Applications

We consider a model of social choice dealing with the problem of choosing a subset from a set of objects (e.g. candidate selection, membership, and qualification problems). Agents have trichotomous preferences for which objects are partitioned into three indifference classes, goods, bads, and nulls, or dichotomous preferences for which each object is either a good or a bad. We characterize plurality-like social choice rules on the basis of the three main axioms, known as Pareto efficiency, anonymity, and independence.

Biung-Ghi Ju

Papers

Non-manipulable division rules in claim problems and generalizations

Manipulation via merging and splitting in claims problems

A characterization of strategy-proof voting rules for separable weak orderings

Strategy-Proofness versus Efficiency in Exchange Economies: General Domain Properties and Applications

An efficiency characterization of plurality social choice on simple preference domains