Constrained equal losses

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

Formal definition

[edit | edit source]

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

The CEL rule says that each claimant i should receive max(0,cir), where r is a constant chosen such that i=1nmax(0,cir)=E. The rule can also be described algorithmically as follows:

  • Initially, all agents are active, and each agent gets his full claim.
  • While the total allocation is larger than the estate:
    • Remove one unit equally from all active agents.
    • Each agent whose total allocation drops to zero becomes inactive.

Examples

[edit | edit source]

Examples with two claimants:

  • CEL(60,90;100)=(35,65); here r=25.
  • CEL(50,100;100)=(25,75); here r=25 too.
  • CEL(40,80;100)=(30,70); here r=10.

Examples with three claimants:

  • CEL(50,100,150;100)=(0,25,75); here r=75.
  • CEL(50,100,150;200)=(16.667,66.666,116.667); here r=33.333.
  • CEL(50,100,150;300)=(50,100,150); here r=0.

Usage

[edit | edit source]

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

[edit | edit source]

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

  • Equal treatment of equals, minimal rights first, and composition down;[4]
  • Conditional null compensation, and composition up;[5]
  • Conditional null compensation, and the dual of claims-monotonicity.[6]

Game-theoretic analysis

[edit | edit source]

Herrero[7] describes the following game.

  • Each claimant proposes a division rule.
  • The proposed rule must satisfy the property of order-preservation (a claimant with a higher claim must have weakly-higher gain and weakly-higher loss).
  • All proposed rules are applied to the problem; each claimant's claim is replaced with the minimum amount awarded to him by a proposed rule.
  • The process repeats with the revised claims.

The process converges. Moreover, it has a unique Nash equilibrium, in which the payoffs are equal to the ones prescribed by CEL.[7]

Dual rule

[edit | edit source]

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

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  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. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ C-H Yeh, 2001, "Sustainability, claims monotonicity, and the constrained equal award rule", Mimeo.
  7. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).