Papers
Topics
Authors
Recent
Search
2000 character limit reached

Deterministic Analogue of Border's Theorem

Updated 26 December 2025
  • The paper shows that deterministic DSIC implementability in a two-bidder auction is fully characterized by a single functional inequality, replacing an uncountable family of constraints.
  • It employs critical-value structures and quantile coordinate transformations to rigorously define and verify interim allocation rules.
  • The work highlights a clear separation between deterministic DSIC and randomized BIC modalities, offering new insights for mechanism design in auctions.

The deterministic analogue of Border’s theorem establishes a precise and remarkably succinct characterization of when a pair of interim allocation rules in a two-bidder single-item auction is implementable by a deterministic dominant-strategy incentive compatible (DSIC) mechanism. Whereas the original (randomized) Border’s theorem relies on an uncountable family of linear inequalities to specify implementability for randomized Bayesian incentive-compatible (BIC) auctions, the deterministic restriction for DSIC mechanisms yields a single functional inequality that is both necessary and sufficient. This result, developed by Liu et al. (2025), demonstrates not only a structural elegance but also a sharp separation between the expressiveness of randomized BIC and deterministic DSIC modalities in multi-agent mechanism design (Liu et al., 19 Dec 2025).

1. Formal Model and Key Definitions

The framework is a single-item auction with two buyers, indexed by i=1,2i=1,2, each with independent private values vi∼Fiv_i \sim F_i drawn from atomless distributions. The mechanism selects, for each bid profile (b1,b2)(b_1, b_2), a deterministic allocation xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\} and payments pi(b1,b2)≥0p_i(b_1, b_2)\ge 0, with feasibility constraint ∑ixi≤1\sum_i x_i \le 1.

A mechanism is DSIC if truth-telling is optimal for each participant, regardless of opponents' reports. Deterministic DSIC allocations for buyer ii admit a critical-value form: xi(vi,v−i)=1iffvi≥ci(v−i),x_i(v_i, v_{-i}) = 1\quad \text{iff}\quad v_i \ge c_i(v_{-i}), for some threshold function cic_i dependent only on opponents' bids. The interim allocation for buyer ii at value vi∼Fiv_i \sim F_i0 is given by vi∼Fiv_i \sim F_i1. Transforming to quantile coordinates vi∼Fiv_i \sim F_i2 yields interim rules vi∼Fiv_i \sim F_i3.

A pair vi∼Fiv_i \sim F_i4 is deterministic DSIC implementable if there exists a deterministic DSIC mechanism that induces precisely these interim allocations.

2. The Classical Randomized Border’s Theorem

Border’s theorem provides a characterization for (possibly randomized) BIC implementability in terms of linear constraints. In quantile terms, for all vi∼Fiv_i \sim F_i5,

vi∼Fiv_i \sim F_i6

This yields an infinite, uncountable system of constraints parameterized by threshold pairs vi∼Fiv_i \sim F_i7. These conditions are tight for randomized BIC implementability in the two-bidder case (Liu et al., 19 Dec 2025).

3. Deterministic DSIC Analogue: Single Functional Inequality

In the deterministic DSIC setting for two bidders, the aforementioned infinite constraint system collapses to a single, order-type functional condition:

Theorem (Deterministic DSIC vi∼Fiv_i \sim F_i8 Single-Constraint):

For strictly increasing interim allocation curves vi∼Fiv_i \sim F_i9, deterministic DSIC implementability is equivalent to

(b1,b2)(b_1, b_2)0

If the auction always allocates the item (i.e., (b1,b2)(b_1, b_2)1 for all (b1,b2)(b_1, b_2)2), the condition tightens to equality: (b1,b2)(b_1, b_2)3 Strictly increasing can be weakened to weakly increasing curves with measure-zero ties resolved appropriately. This single-constraint result fully characterizes deterministic DSIC implementability for interim rules in the two-bidder setting (Liu et al., 19 Dec 2025).

4. Structural Proof Sketch and Critical-Value Colorings

Deterministic DSIC allocations correspond to a three-coloring of the quantile square (b1,b2)(b_1, b_2)4, with each point (b1,b2)(b_1, b_2)5 colored by the winner ((b1,b2)(b_1, b_2)6: no sale; (b1,b2)(b_1, b_2)7: buyer 1; (b1,b2)(b_1, b_2)8: buyer 2). The critical-value structure dictates, for each fixed (b1,b2)(b_1, b_2)9, a threshold xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}0 such that buyer 1 wins precisely on xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}1, and symmetrically for buyer 2.

The proof constructs a "hierarchical allocation" via rearrangement:

  1. For buyer 1: Rearrangement moves all "1"-colored area in each vertical column to the bottom, so buyer 1 wins exactly on xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}2, preserving xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}3.
  2. For buyer 2: Similarly, leftward rearrangement in each row allots buyer 2 wins to xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}4.
  3. Feasibility necessitates that these regions do not overlap. For each xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}5, the set xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}6 must lie below xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}7, which is precisely the single constraint (†).

If (†) is satisfied, the coloring yields a deterministic DSIC mechanism with the desired interim rules (Liu et al., 19 Dec 2025).

5. Separation of Deterministic DSIC and Randomized BIC

The reduction to a single-constraint enables explicit demonstration of separation between deterministic DSIC and randomized BIC implementation power. Liu et al. construct interim-allocation rules xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}8 which satisfy randomized-BIC (Border’s) constraints but violate the deterministic DSIC functional inequality—thereby implementable by deterministic BIC but not by any deterministic DSIC mechanism.

Example: With probability xi(b1,b2)∈{0,1}x_i(b_1, b_2) \in\{0,1\}9, run VCG (highest-value wins); with probability pi(b1,b2)≥0p_i(b_1, b_2)\ge 00, allocate for free to buyer 1. In quantile coordinates,

pi(b1,b2)≥0p_i(b_1, b_2)\ge 01

with pi(b1,b2)≥0p_i(b_1, b_2)\ge 02. However,

pi(b1,b2)≥0p_i(b_1, b_2)\ge 03

Choosing pi(b1,b2)≥0p_i(b_1, b_2)\ge 04, pi(b1,b2)≥0p_i(b_1, b_2)\ge 05 for some pi(b1,b2)≥0p_i(b_1, b_2)\ge 06, violating the deterministic DSIC constraint, although the randomized BIC constraints are met (Liu et al., 19 Dec 2025).

6. Implications and Concluding Observations

The deterministic analogue of Border’s theorem in the two-bidder case yields a compact and tight order-type condition, replacing the infinite Border family with a single functional inequality on interim-allocation rules. This result uncovers surprising limitations and distinct separation phenomena for deterministic dominant-strategy implementation. The tightness of the result and explicit counterexamples underscore intrinsic differences between deterministic and randomized implementation paradigms in mechanism design, even in simple auction settings (Liu et al., 19 Dec 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Deterministic Analogue of Border's Theorem.