Related papers: Optimal auction duration: A price formation viewpo…
Designing an incentive compatible auction that maximizes expected revenue is a central problem in Auction Design. While theoretical approaches to the problem have hit some limits, a recent research direction initiated by Duetting et al.…
We study how storage, operating as a price maker within a market environment, may be optimally operated over an extended period of time. The optimality criterion may be the maximisation of the profit of the storage itself, where this profit…
Online auctions have expanded rapidly over the last decade and have become a fascinating new type of business or commercial transaction in this digital era. Here we introduce a master equation for the bidding process that takes place in…
An auction house cannot generally provide the optimal auction technology to every client. Instead it provides one or several auction technologies, and clients select the most appropriate one. For example, eBay provides ascending auctions…
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…
This paper studies optimal market making for large-tick assets in the presence of latency. We consider a random walk model for the asset price, and formulate the market maker's optimization problem using Markov Decision Processes (MDP). We…
Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…
A central problem in Microeconomics is to design auctions with good revenue properties. In this setting, the bidders' valuations for the items are private knowledge, but they are drawn from publicly known prior distributions. The goal is to…
In this article, we develop a general framework to study optimal execution and to price block trades. We prove existence of optimal liquidation strategies and we provide regularity results for optimal strategies under very general…
We study the optimal timing strategies for trading a mean-reverting price process with afinite deadline to enter and a separate finite deadline to exit the market. The price process is modeled by a diffusion with an affine drift that…
In a multiple-object auction, every bidder tries to win as many objects as possible with a bidding algorithm. This paper studies position-randomized auctions, which form a special class of multiple-object auctions where a bidding algorithm…
Throttling is a popular method of budget management for online ad auctions in which the platform modulates the participation probability of an advertiser in order to smoothly spend her budget across many auctions. In this work, we…
We study sequential procurement auctions where the sellers are provided with a ``best and final offer'' (BAFO) strategy. This strategy allows each seller $i$ to effectively ``freeze'' their price while remaining active in the auction, and…
This article considers the pricing and hedging of a call option when liquidity matters, that is, either for a large nominal or for an illiquid underlying asset. In practice, as opposed to the classical assumptions of a price-taking agent in…
The Competition Complexity of an auction measures how much competition is needed for the revenue of a simple auction to surpass the optimal revenue. A classic result from auction theory by Bulow and Klemperer [9], states that the…
We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…
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…
In a fixed time horizon, appropriately executing a large amount of a particular asset -- meaning a considerable portion of the volume traded within this frame -- is challenging. Especially for illiquid or even highly liquid but also highly…
We consider an outsourcing problem where a software agent procures multiple services from providers with uncertain reliabilities to complete a computational task before a strict deadline. The service consumer requires a procurement strategy…
Motivated by applications such as cloud computing, gig platforms, and blockchain auctions, we study optimal selling mechanisms for dynamic markets with stochastic supply and demand. In our model, buyers with private valuations and…