Constrained equal losses

Last updated

Constrained equal losses(CEL) is a division rule for solving bankruptcy problems. According to this rule, each claimant should lose an equal amount from his or her claim, except that no claimant should receive a negative amount. In the context of taxation, it is known as poll tax . [1]

Contents

Formal definition

There is a certain amount of money to divide, denoted by (=Estate or Endowment). There are nclaimants. Each claimant i has a claim denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims.

The CEL rule says that each claimant i should receive , where r is a constant chosen such that . The rule can also be described algorithmically as follows:

Examples

Examples with two claimants:

Examples with three claimants:

Usage

In the Jewish law, if several bidders participate in an auction and then revoke their bids simultaneously, they have to compensate the seller for the loss. The loss is divided among the bidders according to the CEL rule. [2] [3]

Characterizations

The CEL rule has several characterizations. It is the only rule satisfying the following sets of axioms:

Dual rule

The constrained equal awards(CEA) rule is the dual of the CEL rule, that is: for each problem , we have .

Related Research Articles

In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges which if removed would disconnect the source from the sink.

In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equation constraints. It is named after the mathematician Joseph-Louis Lagrange.

<span class="mw-page-title-main">Quantization (signal processing)</span> Process of mapping a continuous set to a countable set

Quantization, in mathematics and digital signal processing, is the process of mapping input values from a large set to output values in a (countable) smaller set, often with a finite number of elements. Rounding and truncation are typical examples of quantization processes. Quantization is involved to some degree in nearly all digital signal processing, as the process of representing a signal in digital form ordinarily involves rounding. Quantization also forms the core of essentially all lossy compression algorithms.

<span class="mw-page-title-main">Maximum flow problem</span> Computational problem in graph theory

In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate.

Fair division is the problem in game theory of dividing a set of resources among several people who have an entitlement to them so that each person receives their due share. That problem arises in various real-world settings such as division of inheritance, partnership dissolutions, divorce settlements, electronic frequency allocation, airport traffic management, and exploitation of Earth observation satellites. It is an active research area in mathematics, economics, dispute resolution, etc. The central tenet of fair division is that such a division should be performed by the players themselves, maybe using a mediator but certainly not an arbiter as only the players really know how they value the goods.

A bankruptcy problem, also called a claims problem, is a problem of distributing a homogeneous divisible good among people with different claims. The focus is on the case where the amount is insufficient to satisfy all the claims.

In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem. If the primal is a minimization problem then the dual is a maximization problem. Any feasible solution to the primal (minimization) problem is at least as large as any feasible solution to the dual (maximization) problem. Therefore, the solution to the primal is an upper bound to the solution of the dual, and the solution of the dual is a lower bound to the solution of the primal. This fact is called weak duality.

In mathematics and economics, the envelope theorem is a major result about the differentiability properties of the value function of a parameterized optimization problem. As we change parameters of the objective, the envelope theorem shows that, in a certain sense, changes in the optimizer of the objective do not contribute to the change in the objective function. The envelope theorem is an important tool for comparative statics of optimization models.

In computational complexity theory, Polynomial Local Search (PLS) is a complexity class that models the difficulty of finding a locally optimal solution to an optimization problem. The main characteristics of problems that lie in PLS are that the cost of a solution can be calculated in polynomial time and the neighborhood of a solution can be searched in polynomial time. Therefore it is possible to verify whether or not a solution is a local optimum in polynomial time. Furthermore, depending on the problem and the algorithm that is used for solving the problem, it might be faster to find a local optimum instead of a global optimum.

In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance. A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

<span class="mw-page-title-main">All-pay auction</span>

In economics and game theory, an all-pay auction is an auction in which every bidder must pay regardless of whether they win the prize, which is awarded to the highest bidder as in a conventional auction. As shown by Riley and Samuelson (1981), equilibrium bidding in an all pay auction with private information is revenue equivalent to bidding in a sealed high bid or open ascending price auction.

The Price of Anarchy (PoA) is a concept in economics and game theory that measures how the efficiency of a system degrades due to selfish behavior of its agents. It is a general notion that can be extended to diverse systems and notions of efficiency. For example, consider the system of transportation of a city and many agents trying to go from some initial location to a destination. Let efficiency in this case mean the average time for an agent to reach the destination. In the 'centralized' solution, a central authority can tell each agent which path to take in order to minimize the average travel time. In the 'decentralized' version, each agent chooses its own path. The Price of Anarchy measures the ratio between average travel time in the two cases.

In computer science, optimal computing budget allocation (OCBA) is an approach to maximize the overall simulation efficiency for finding an optimal decision. It was introduced in the mid-1990s by Dr. Chun-Hung Chen.

In mechanism design, a Vickrey–Clarke–Groves (VCG) mechanism is a generic truthful mechanism for achieving a socially-optimal solution. It is a generalization of a Vickrey–Clarke–Groves auction. A VCG auction performs a specific task: dividing items among people. A VCG mechanism is more general: it can be used to select any outcome out of a set of possible outcomes.

Resource monotonicity is a principle of fair division. It says that, if there are more resources to share, then all agents should be weakly better off; no agent should lose from the increase in resources. The RM principle has been studied in various division problems.

Constrained equal awards(CEA), also called constrained equal gains, is a division rule for solving bankruptcy problems. According to this rule, each claimant should receive an equal amount, except that no claimant should receive more than his/her claim. In the context of taxation, it is known as leveling tax.

The proportional rule is a division rule for solving bankruptcy problems. According to this rule, each claimant should receive an amount proportional to their claim. In the context of taxation, it corresponds to a proportional tax.

The contested garment (CG) rule, also called concede-and-divide, is a division rule for solving problems of conflicting claims. The idea is that, if one claimant's claim is less than 100% of the estate to divide, then he effectively concedes the unclaimed estate to the other claimant. Therefore, we first give to each claimant, the amount conceded to him/her by the other claimant. The remaining amount is then divided equally among the two claimants.

A strategic bankruptcy problem is a variant of a bankruptcy problem in which claimants may act strategically, that is, they may manipulate their claims or their behavior. There are various kinds of strategic bankruptcy problems, differing in the assumptions about the possible ways in which claimants may manipulate.

Surplus sharing is a kind of a fair division problem where the goal is to share the financial benefits of cooperation among the cooperating agents. As an example, suppose there are several workers such that each worker i, when working alone, can gain some amount ui. When they all cooperate in a joint venture, the total gain is u1+...+un+s, where s>0. This s is called the surplus of cooperation, and the question is: what is a fair way to divide s among the n agents?

References

  1. William, Thomson (2003-07-01). "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey". Mathematical Social Sciences. 45 (3): 249–297. doi:10.1016/S0165-4896(02)00070-7. ISSN   0165-4896.
  2. Aumann, Robert J; Maschler, Michael (1985-08-01). "Game theoretic analysis of a bankruptcy problem from the Talmud". Journal of Economic Theory. 36 (2): 195–213. doi:10.1016/0022-0531(85)90102-4. ISSN   0022-0531.
  3. Maimonides, Laws of Appraisals and Devoted Property 8:4. "If the first bidder says: "I will [redeem] it for ten selaim," the second: "...for twenty," and a third "...for 24," and the second and third bidders retract at the same time, we enable the first to redeem it for 10, and we expropriate 7 from the property of both the second and the third. Thus, the Temple treasury collects 24. Similarly, if all three of them retract and the consecrated article is [ultimately] sold for 3, we expropriate 7 selaim from the property of all of them."
  4. Herrero, Carmen (2003), Sertel, Murat R.; Koray, Semih (eds.), "Equal Awards vs. Equal Losses: Duality in Bankruptcy", Advances in Economic Design, Studies in Economic Design, Berlin, Heidelberg: Springer, pp. 413–426, doi:10.1007/978-3-662-05611-0_22, ISBN   978-3-662-05611-0 , retrieved 2021-09-29
  5. Herrero, Carmen; Villar, Antonio (2002-12-01). "Sustainability in bankruptcy problems". Top. 10 (2): 261–273. doi:10.1007/BF02579019. ISSN   1863-8279. S2CID   120694615.
  6. C-H Yeh, 2001, "Sustainability, claims monotonicity, and the constrained equal award rule", Mimeo.