Related papers: Uniform price auction with quantity constraints
High-stakes auctions are often preceded by nonbinding communication between bidders and the seller. Motivated by these practices, this paper examines a two-period model in which two bidders send private cheap talk messages to the seller…
Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the…
We study the effect of interim feedback policies in a dynamic all-pay auction where two players bid over two stages to win a common-value prize. We show that sequential equilibrium outcomes are characterized by Cheapest Signal Equilibria,…
We consider an auction design problem where a seller sells multiple homogeneous items to a set of connected buyers. Each buyer only knows the buyers she directly connects with and has a diminishing marginal utility valuation for the items.…
In this paper, we present the first approximation algorithms for the problem of designing revenue optimal Bayesian incentive compatible auctions when there are multiple (heterogeneous) items and when bidders can have arbitrary demand and…
We consider portfolio selection under nonparametric $\alpha$-maxmin ambiguity in the neighbourhood of a reference distribution. We show strict concavity of the portfolio problem under ambiguity aversion. Implied demand functions are…
We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…
Constraints on agent's ability to pay play a major role in auction design for any setting where the magnitude of financial transactions is sufficiently large. Those constraints have been traditionally modeled in mechanism design as…
We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…
We consider auctions with N+1 bidders. Of these, N are symmetric and N+1 is "sufficiently strong" relative to the others. The auction is a "tournament" in which the first N players bid to win the right to compete with N+1. The bids of the…
Motivated by Carbon Emissions Trading Schemes, Treasury Auctions, Procurement Auctions, and Wholesale Electricity Markets, which all involve the auctioning of homogeneous multiple units, we consider the problem of learning how to bid in…
Considering that a trader or a trading algorithm interacting with markets during continuous auctions can be modeled by an iterating procedure adjusting the price at which he posts orders at a given rhythm, this paper proposes a procedure…
We present an algorithm for computing pure-strategy epsilon-perfect Bayesian equilibria in sequential auctions with continuous action and value spaces. Importantly, our algorithm includes a verification phase that computes an upper bound on…
Platforms design the form of presentation by which sellers are shown to the buyers. This design not only shapes the buyers' experience but also leads to different market equilibria or dynamics. One component in this design is through the…
We study the optimal auction design problem when bidders' preferences follow the maxmin expected utility model. We suppose that each bidder's set of priors consists of beliefs close to the seller's belief, where "closeness" is defined by a…
A standard result from auction theory is that bidding truthfully in a second price auction is a weakly dominant strategy. The result, however, does not apply in the presence of Cost Per Action (CPA) constraints. Such constraints exist, for…
In a recent publication, using a simple two-period model, which is already capable to capture essential non-convex multiperiod bids, Richstein et al. have shown that in the case of optimal bidding, multi-part bidding always ensures a higher…
We analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of…
On ad exchange platforms the place for advertisement is sold through different kinds of auctions. However, it is not uncommon the situation where the seller repeatedly encounters only one buyer, thus the posted price auction degenerates…
We consider two risk-averse financial agents who negotiate the price of an illiquid indivisible contingent claim in an incomplete semimartingale market environment. Under the assumption that the agents are exponential utility maximizers…