Nir Dagan

Bio: Nir Dagan is an academic researcher from Pompeu Fabra University. The author has contributed to research in topics: Bankruptcy & Bargaining problem. The author has an hindex of 11, co-authored 24 publications receiving 567 citations. Previous affiliations of Nir Dagan include Brown University & Hebrew University of Jerusalem.

New characterizations of old bankruptcy rules

Abstract: This paper presents axiomatic characterizations of two bankruptcy rules discussed in Jewish legal literature: the Constrained Equal Awards rule and the Contested Garment principle (the latter is defined only for two-creditor problems.) A major property in these characterizations is independence of irrelevant claims, which requires that if an individual claim exceeds the total to be allocated the excess claim should be considered irrelevant.

A characterization of the Nash bargaining solution

Abstract: We characterize the Nash bargaining solution replacing the axiom of Independence of Irrelevant Alternatives with three independent axioms: Independence of Non-Individually Rational Alternatives, Twisting, and Disagreement Point Convexity. We give a non-cooperative bargaining interpretation to this last axiom.

Bilateral comparisons and consistent fair division rules in the context of bankruptcy problems

Abstract: We analyze the problem of extending a given bilateral principle of justice to a consistentn-creditor bankruptcy rule. Based on the bilateral principle, we build a family of binary relations on the set of creditors in order to make bilateral comparisons between them. We find that the possibility of extending a specific bilateral principle of justice in a consistent way is closely related to the quasi-transitivity of the binary relations mentioned above.

A Crash Course in Implementation Theory

Abstract: This paper is meant to familiarize the audience with some of the fundamental results in the theory of implementation and provide a quick progression to some open questions in the literature.

Handbook of Computational Social Choice

Abstract: 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.

Chapter 6 Axiomatic cost and surplus sharing

Abstract: The equitable division of a joint cost (or a jointly produced output) among agents with different shares or types of output (or input) commodities, is a central theme of the theory of cooperative games with transferable utility. Ever since Shapley's seminal contribution in 1953, this question has generated some of the deepest axiomatic results of modern microeconomic theory. More recently, the simpler problem of rationing a single commodity according to a profile of claims (reflecting individual needs, or demands, or liabilities) has been another fertile ground for axiomatic analysis. This rationing model is often called the bankruptcy problem in the literature. This chapter reviews the normative literature on these two models, and emphasizes their deep structural link via the Additivity axiom for cost sharing: individual cost shares depend additively upon the cost function. Loosely speaking, an additive cost-sharing method can be written as the integral of a rationing method, and this representation defines a linear isomorphism between additive cost-sharing methods and rationing methods. The simple proportionality rule in rationing thus corresponds to average cost pricing and to the Aumann-Shapley pricing method (respectively for homogeneous or heterogeneous output commodities). The uniform rationing rule, equalizing individual shares subject to the claim being an upper bound, corresponds to serial cost sharing. And random priority rationing corresponds to the Shapley-Shubik method, applying the Shapley formula to the Stand Alone costs. Several open problems are included. The axiomatic discussion of non-additive methods to share joint costs appears to be a promising direction for future research.