Partial and complete equality of opportunity orderings
نویسنده
چکیده
Equality of opportunity is concerned with the level-the-playing-field principle: society should compensate individuals who suffer from bad circumstances but let the agents exercise their responsibility. This paper proposes a partial ordering based on the inequality-of-opportunity curve, a mechanism that gives preference to those who are worse in terms of opportunity. Moreover, it is provided a complete ordering that depends on a sensitivity parameter which represents the degree of priority in the equality-ofopportunity policy. The Moreno-Ternero approach is obtained as a particular case. This proposal is applied to a set of eleven countries to compare their degree of equality of opportunity.
منابع مشابه
Max-planck-institut F Ur Informatik Ordered Chaining Calculi for First-order Theories of Binary Relations K I N F O R M a T I K Authors' Addresses Publication Notes
We propose inference systems for binary relations with composition laws of the form S T U in the context of resolution-type theorem proving. Particulary interesting examples include transitivity, partial orderings, equality and the combination of equality with other transitive relations. Our inference mechanisms are based on standard techniques from term rewriting and represent a re nement of c...
متن کاملOrdered Chaining Calculi for First-Order Theories of Binary Relations
We propose inference systems for binary relations with composition laws of the form S o T ~ U in the context of resolution-type theorem proving. Particulary interesting examples include transitivity, partial orderings, equality and the combination of equality with other transitive relations. Our inference mechanisms are based on standard techniques from term rewriting and represent a refinement...
متن کاملStrict Basic Superposition and Chaining
The most efficient techniques that have been developed to date for equality handling in first-order theorem proving are based on superposition calculi. Superposition is a refinement of paramodulation in that various ordering constraints are imposed on inferences. For practical purposes, a key aspect of superposition is its compatibility with powerful simplification techniques. In this paper we ...
متن کاملHierarchical Variable Ordering for Multiagent Agreement Problems
The Multiagent Agreement Problem (MAP) is a special form of Distributed Constraint Optimization (DCOP) that requires agents to choose values for variables to satisfy not only their own constraints, but also equality constraints with other agents. For solving MAPs, we introduce the AdoptMVA algorithm which is an extension of the existing Adopt algorithm designed to take advantage of the partial ...
متن کاملC-complete sets for compromise stable games
The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still possible to assign the remaining players at least their minimum right. A game is called compromise stable...
متن کامل