SearcharxivSearch

arXiv · 2607.13795

Auctions with Contract Design

Abstract

We consider a new auction model where the bidders' utilities and the auctioneer's revenue depend on a quality factor of the transaction determined by costly and strategic investments of the bidders. Applications of our model include ad auctions, government concessions and crowdsourcing contests. Crucially, these quality-enhancing efforts made by the bidders are often sunk costs incurred prior to the allocation, creating a fundamental moral hazard problem where the risk of losing the auction discourages investments. In this paper, we study the design of revenue-maximizing contracts integrated into auctions: the auctioneer commits to a transfer rule that rewards the winner for the ex-post realized quality of the transaction to incentivize higher effort. Our new framework is a natural generalization of both the auction theory and the principal-agent model. We consider both the second-price and the first-price auctions. We show that natural symmetric Bayes Nash equilibria exist in both auctions. Assuming these natural equilibria are played by the bidders and the number of bidders is large, we study linear contracts and derive the optimal reward factor of the transfer rule that maximizes the auctioneer's revenue. As the main result, we show that the optimal reward factor converges to the auctioneer's marginal benefit from the quality, as the number of bidders grows. That is, it is optimal for the auctioneer to fully pass through the quality value to the winner. This observation is largely independent of the auction rule used: we derive a revenue equivalence theorem showing that the revenue remains the same as long as symmetric Bayes Nash equilibria exist. Lastly, by quantitatively comparing with the standard auctions where no quality reward is used, we show that the use of contracts effectively improves the revenue by incentivizing high investments from the bidders.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaolin Bu, Jiarong Jin, Junzhu Ke, Pinyan Lu, Biaoshuai Tao, Xiang Yan, Chunxue Yang, Haikuo Yang, Zhihua Zhu. 2026-07-15. Auctions with Contract Design. https://arxiv.org/abs/2607.13795

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT