Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 38 min ago
PreprintarXiv licencearXiv

Payment Design under Belief Disagreement: Rent Placement, Bid Resolution, and Auction Choice

Abstract

When auction bidders misperceive their rivals, a seller can change not only the amount of information rent but also the states in which it is delivered. We ask when this payment-design opportunity survives a finite bidding interface, nonnegative-payment restrictions, and comparison with conventional auctions under the same beliefs. We formulate payment design as a linear program in nonnegative bidder rents. A single state can safely carry a report's rent when it is both cheapest for its intended type and least attractive to potential mimics. We characterize this alignment, bound the cost of a restricted payment architecture when alignment is imperfect, and use shadow prices when the rankings conflict. Own-type projection yields a unique optimal expected-payment rule for a fixed allocation. Contiguous bid bands implement truthful reporting at every value, but create pooling losses and within-band surplus. Under a separate smooth-belief model, feasible truthful rules and revenue upper bounds support comparisons with a first-price equilibrium under the same beliefs. A calibration using 1,000 eBay proof-set auction records illustrates a partition-dependent reversal: first price dominates all exactly truthful, no-subsidy rules on ten equal-probability bands in one scenario, while a richer contingent rule on ten equal-dollar bands outperforms it. An operator should choose interface resolution, payment dependence, and integrity tolerances jointly. Validate the probabilities that support incentives, compare formats under the same beliefs, and distinguish redesign from deployment. Any receipt advantage must cover implementation costs before it can imply a profit advantage.

Related

  1. First-Order Bilevel Optimization for Non-truthful Auction Design
    Shing-Hei Ho, April Niu, Ellen Vitercik +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Continuous auction models
    Gioia Carinci, Pablo A. Ferrari, Chiara Franceschini +1
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  3. A Statistical Analysis of Three Player Auction Bridge
    Aritrabha Majumdar, Sourish Sarkar, Moutushi Chatterjee
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Disagreement Among Firm-Level Productivity Estimators and Its Consequences for Applied Inference
    Hongsun Qin, Bin Gao, Wenwen Wang
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. Pay Only for Disagreement: Certified No-Regression Verdicts for Model Updates with Matching Label-Complexity Bounds
    Vishnu Bindu Balachandran
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{lu2026payment,
  title = {{Payment Design under Belief Disagreement: Rent Placement, Bid Resolution, and Auction Choice}},
  author = {Lijian Lu and Ce Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05650},
  eprint = {2610.05650},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05650},
}
RIS
TY  - UNPB
TI  - Payment Design under Belief Disagreement: Rent Placement, Bid Resolution, and Auction Choice
AU  - Lijian Lu
AU  - Ce Zhang
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2610.05650
UR  - https://arxiv.org/abs/2610.05650
AB  - When auction bidders misperceive their rivals, a seller can change not only the amount of information rent but also the states in which it is delivered. We ask when this payment-design opportunity survives a finite bidding interface, nonnegative-payment restrictions, and comparison with conventional auctions under the same beliefs. We formulate payment design as a linear program in nonnegative bidder rents. A single state can safely carry a report's rent when it is both cheapest for its intended type and least attractive to potential mimics. We characterize this alignment, bound the cost of a restricted payment architecture when alignment is imperfect, and use shadow prices when the rankings conflict. Own-type projection yields a unique optimal expected-payment rule for a fixed allocation. Contiguous bid bands implement truthful reporting at every value, but create pooling losses and within-band surplus. Under a separate smooth-belief model, feasible truthful rules and revenue upper bounds support comparisons with a first-price equilibrium under the same beliefs. A calibration using 1,000 eBay proof-set auction records illustrates a partition-dependent reversal: first price dominates all exactly truthful, no-subsidy rules on ten equal-probability bands in one scenario, while a richer contingent rule on ten equal-dollar bands outperforms it. An operator should choose interface resolution, payment dependence, and integrity tolerances jointly. Validate the probabilities that support incentives, compare formats under the same beliefs, and distinguish redesign from deployment. Any receipt advantage must cover implementation costs before it can imply a profit advantage.
ER  -