The exclusion dilation operator for bilateral claims problems

1. Problem Statement

The paper addresses bilateral claims problems (rationing problems) where two agents have claims ($c_1, c_2$) over a limited, divisible endowment ($E$) such that the aggregate claim $C = c_1 + c_2 \geq E$.

The core innovation of the paper is the introduction of exclusion thresholds. Unlike standard models where allocation begins immediately from zero, this framework incorporates:

• Lower Exclusion Thresholds ($\ell_i$): A proportion of agent $i$'s claim below which they receive no initial gains. This creates a "priority" for the other agent until the threshold is met.
• Upper Exclusion Thresholds ($u_i$): A proportion of agent $i$'s claim above which they are fully compensated (receiving their full claim) before the other agent receives further gains. This creates a "priority" for the other agent in the distribution of losses.

These thresholds introduce asymmetry into the allocation process, reflecting real-world scenarios where legal, policy, or fairness considerations dictate that certain agents must be prioritized or deferred (e.g., government claims in bankruptcy, tax exemptions, or divorce settlements).

2. Methodology

The author introduces a new mechanism called the Exclusion Dilation Operator. This operator transforms a standard allocation rule ($R$) defined on the benchmark domain into an extended rule ($\hat{R}$) defined on the domain with exclusion thresholds.

The methodology relies on a three-stage process:

1. Initial Gains Allocation (Below Lower Thresholds):

   • If the endowment $E$ is less than the aggregate lower exclusion threshold $L(c, \ell) = \ell_1 c_1 + \ell_2 c_2$, resources are allocated exclusively to the agent with the non-zero lower threshold (or distributed proportionally if both have thresholds, though the paper focuses on cases where one is prioritized). The agent with the higher priority receives resources until their lower threshold is satisfied; the other receives nothing.

2. Dilation Transformation (Within the Exclusion Space):

   • Once the lower thresholds are met, the remaining endowment is distributed within a reduced "exclusion space."
   • The operator applies a dilation transformation to the underlying standard rule. This transformation scales the claims space horizontally and vertically based on the "active" claim space size: $s_i = u_i - \ell_i$.
   • Formally, if $R(c, E)$ is the standard rule, the dilated rule $\hat{R}$ maps the remaining endowment $E - L(c, \ell)$ to the interval $[0, s_1 c_1] \times [0, s_2 c_2]$. This effectively compresses the geometry of the original rule to fit the exclusion space.

3. Initial Losses Allocation (Above Upper Thresholds):

   • If the endowment $E$ exceeds the aggregate upper exclusion threshold $U(c, u) = u_1 c_1 + u_2 c_2$, the agent with the upper threshold $u_i < 1$ is fully compensated (receiving their full claim $c_i$).
   • The remaining resources are then allocated to the other agent.

3. Key Contributions

• New Operator Class: The paper defines a novel class of operators based on dilation rather than the traditional truncation, duality, or minimal rights approaches found in existing literature (e.g., Thomson & Yeh, 2008; Hougaard et al., 2012).
• Asymmetric Modeling: It provides a formal mathematical framework for modeling asymmetric treatment in claims problems without relying on exogenous weights. The asymmetry arises structurally from the exclusion thresholds.
• Generalization of Rule Families: The operator generates new members of the Constant-Increasing-Constant (CIC) family of rules. It specifically addresses scenarios where the agent receiving initial gains has the smallest claim, a dynamic not fully captured by standard weighted rules.
• Axiomatic Characterization: The paper provides a rigorous axiomatic foundation for the operator.

4. Key Results

A. Preservation of Properties

The paper analyzes which standard fairness axioms are preserved when the exclusion dilation operator is applied to a standard rule.

Key Insight: The operator intentionally violates Order Preservation and Equal Treatment to reflect the policy-driven asymmetries. However, it maintains the structural "essence" of the underlying rule (e.g., linearity, monotonicity) within the active exclusion space.

B. Axiomatic Characterization

The exclusion dilation operator is uniquely characterized by three axioms:

1. Full Exclusion: If the endowment is insufficient to cover the lower exclusion threshold of one agent, the other agent receives nothing.
2. Null Exclusion: If the endowment is sufficient to cover the upper exclusion threshold of one agent (meaning the other agent's claim is fully covered), the agent with the upper threshold receives their full claim.
3. Proportional Exclusion Invariance: Within the exclusion space, the allocation is a proportional scaling (dilation) of the allocation that would occur in a standard problem without exclusions.

5. Significance and Implications

• Theoretical Advancement: The paper bridges the gap between standard fair division theory and complex, real-world allocation problems where strict symmetry is inappropriate. It demonstrates how dilation transformations can be used to modify the geometry of allocation rules while preserving their core properties.
• Policy Application: The framework offers a rigorous tool for policymakers and legal scholars to model scenarios involving:
  • Bankruptcy: Prioritizing government claims over private creditors.
  • Taxation: Exempting a portion of income before applying progressive rates.
  • Divorce/Employment: Ensuring basic needs (lower threshold) are met or compensating for specific sacrifices (upper threshold) before splitting remaining assets.
• Robustness: The analysis shows that while the operator breaks symmetry, it retains robustness in terms of monotonicity and homogeneity, ensuring that the resulting rules remain stable and predictable under scaling and resource changes.

In conclusion, the Exclusion Dilation Operator provides a flexible, mathematically rigorous method to extend standard allocation rules to environments with priority constraints, offering a new perspective on how to handle asymmetry in fair division problems.