English
Related papers

Related papers: Duality and Optimality of Auctions for Uniform Dis…

200 papers

In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller.…

Computer Science and Game Theory · Computer Science 2017-01-05 Maciej Drwal

We consider the problem of designing revenue-optimal auctions for selling two items and bidders' valuations are independent among bidders but negatively correlated among items. In this paper, we obtain the closed-form optimal auction for…

Computer Science and Game Theory · Computer Science 2016-06-03 Pingzhong Tang , Zihe Wang

The paper studies the problem of auction design in a setting where the auctioneer accesses the knowledge of the valuation distribution only through statistical samples. A new framework is established that combines the statistical decision…

Econometrics · Economics 2022-02-22 Haitian Xie

Distributed energy resources (DERs), such as rooftop solar panels, are growing rapidly and are reshaping power systems. To promote DERs, feed-in-tariff (FIT) is usually adopted by utilities to pay DER owners certain fixed rates for…

Computer Science and Game Theory · Computer Science 2021-10-22 Zibo Zhao , Chen Feng , Andrew L. Lu

We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even…

Computer Science and Game Theory · Computer Science 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

The role of a market maker is to simultaneously offer to buy and sell quantities of goods, often a financial asset such as a share, at specified prices. An automated market maker (AMM) is a mechanism that offers to trade according to some…

Computer Science and Game Theory · Computer Science 2024-02-15 Michael J. Curry , Zhou Fan , David C. Parkes

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…

Computer Science and Game Theory · Computer Science 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

We provide a reduction from revenue maximization to welfare maximization in multi-dimensional Bayesian auctions with arbitrary (possibly combinatorial) feasibility constraints and independent bidders with arbitrary (possibly combinatorial)…

Computer Science and Game Theory · Computer Science 2012-07-25 Yang Cai , Constantinos Daskalakis , S. Matthew Weinberg

In this paper, we study online double auctions, where multiple sellers and multiple buyers arrive and depart dynamically to exchange one commodity. We show that there is no deterministic online double auction that is truthful and…

Computer Science and Game Theory · Computer Science 2013-11-04 Dengji Zhao , Dongmo Zhang , Laurent Perrussel

In this paper, we propose a novel sealed-bid auction framework to address the problem of dynamic spectrum allocation in cognitive radio (CR) networks. We design an optimal auction mechanism that maximizes the moderator's expected utility,…

Networking and Internet Architecture · Computer Science 2015-11-16 V. Sriram Siddhardh Nadendla , Swastik Brahma , Pramod K. Varshney

Auction design for the modern advertising market has gained significant prominence in the field of game theory. With the recent rise of auto-bidding tools, an increasing number of advertisers in the market are utilizing these tools for…

Computer Science and Game Theory · Computer Science 2024-12-31 Changfeng Xu , Chao Peng , Chenyang Xu , Zhengfeng Yang

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

Computer Science and Game Theory · Computer Science 2021-04-13 Yannai A. Gonczarowski , S. Matthew Weinberg

We study the bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume…

Computer Science and Game Theory · Computer Science 2024-01-25 Ioannis Caragiannis , Georgios Kalantzis

We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion by a concave utility function, and players play…

Computer Science and Game Theory · Computer Science 2012-06-28 Anand Bhalgat , Tanmoy Chakraborty , Sanjeev Khanna

We investigate a seller's revenue-maximizing mechanism in a setting where a desirable good is sold together with an undesirable bad (e.g., advertisements) that generates third-party revenue. The buyer's private information is…

Theoretical Economics · Economics 2026-02-02 Kolagani Paramahamsa

We interpret multi-product supply chains (SCs) as coordinated markets; under this interpretation, a SC optimization problem is a market clearing problem that allocates resources and associated economic values (prices) to different…

Optimization and Control · Mathematics 2020-07-03 Philip A. Tominac , Victor M. Zavala

We study the menu complexity of optimal and approximately-optimal auctions in the context of the "FedEx" problem, a so-called "one-and-a-half-dimensional" setting where a single bidder has both a value and a deadline for receiving an…

Computer Science and Game Theory · Computer Science 2017-11-08 Raghuvansh R. Saxena , Ariel Schvartzman , S. Matthew Weinberg

Recently, joint advertising has gained significant attention as an effective approach to enhancing the efficiency and revenue of advertising slot allocation. Unlike traditional advertising, which allocates advertising slots exclusively to a…

Computer Science and Game Theory · Computer Science 2025-12-18 Chun Fang , Luowen Liu , Kun Huang , Tao Ruan , Sheng Yan , Zhen Wang , Huan Li , Qiang Liu , Xingxing Wang

We introduce draft auctions, which is a sequential auction format where at each iteration players bid for the right to buy items at a fixed price. We show that draft auctions offer an exponential improvement in social welfare at equilibrium…

Computer Science and Game Theory · Computer Science 2013-11-13 Nikhil R. Devanur , Jamie Morgenstern , Vasilis Syrgkanis