English
Related papers

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

200 papers

We quantify the value of the monopoly's bargaining power in terms of competition complexity--that is, the number of additional bidders the monopoly must attract in simple auctions to match the expected revenue of the optimal mechanisms…

Computer Science and Game Theory · Computer Science 2025-06-12 Hedyeh Beyhaghi , Linda Cai , Yiding Feng , Yingkai Li , S. Matthew Weinberg

We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these…

Computer Science and Game Theory · Computer Science 2012-10-01 Paul Duetting , Monika Henzinger , Martin Starnberger

We design a fixed-price auction mechanism for a seller to sell multiple items in a tree-structured market. The buyers have independently drawn valuation from a uniform distribution, and the seller would like to incentivize buyers to invite…

Computer Science and Game Theory · Computer Science 2024-08-01 Feiyang Yu

In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…

Computer Science and Game Theory · Computer Science 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

In two-sided markets, Myerson and Satterthwaite's impossibility theorem states that one can not maximize the gain-from-trade while also satisfying truthfulness, individual-rationality and no deficit. Attempts have been made to circumvent…

Computer Science and Game Theory · Computer Science 2019-12-10 Rica Gonen , Erel Segal-Halevi

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions. A mechanism is supposed to facilitate trade between these…

Computer Science and Game Theory · Computer Science 2017-10-24 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Stefano Turchetta

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite…

Computer Science and Game Theory · Computer Science 2019-03-12 Shipra Agrawal , Constantinos Daskalakis , Vahab Mirrokni , Balasubramanian Sivan

In this paper we design information elicitation mechanisms for Bayesian auctions. While in Bayesian mechanism design the distributions of the players' private types are often assumed to be common knowledge, information elicitation considers…

Computer Science and Game Theory · Computer Science 2018-06-27 Jing Chen , Bo Li , Yingkai Li

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…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

Auction is the common paradigm for resource allocation which is a fundamental problem in human society. Existing research indicates that the two primary objectives, the seller's revenue and the allocation efficiency, are generally…

Computer Science and Game Theory · Computer Science 2019-05-27 Bin Li , Dong Hao , Dengji Zhao , Makoto Yokoo

We study gains from trade in multi-dimensional two-sided markets. Specifically, we focus on a setting with $n$ heterogeneous items, where each item is owned by a different seller $i$, and there is a constrained-additive buyer with…

Computer Science and Game Theory · Computer Science 2022-03-15 Yang Cai , Kira Goldner , Steven Ma , Mingfei Zhao

We consider the problem of designing auctions which maximize consumer surplus (i.e., the social welfare minus the payments charged to the buyers). In the consumer surplus maximization problem, a seller with a set of goods faces a set of…

Computer Science and Game Theory · Computer Science 2025-03-18 Tomer Ezra , Daniel Schoepflin , Ariel Shaulker

We establish a rigorous duality theory, under No Unbounded Profit with Bounded Risk, for an infinite horizon problem of optimal consumption in the presence of an income stream that can terminate randomly at an exponentially distributed…

Mathematical Finance · Quantitative Finance 2021-11-30 Ashley Davey , Michael Monoyios , Harry Zheng

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

This paper designs a market algorithm for fractional ownership of an indivisible asset. It provides an efficient market mechanism, named Direct Fractional Auction (DFA) that offers valuable assets to both small and large investors who can…

General Economics · Economics 2024-11-19 Dmitriy Taubman , Boris Gleyzer , Ke Yang , Farhad Rassekh

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

This paper proposes a new combinatorial auction framework for local energy flexibility markets, which addresses the issue of prosumers' inability to bundle multiple flexibility time intervals. To solve the underlying NP-complete winner…

Machine Learning · Computer Science 2023-07-27 Awadelrahman M. A. Ahmed , Frank Eliassen , Yan Zhang

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

Computer Science and Game Theory · Computer Science 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

The market economy deals with many interacting agents such as buyers and sellers who are autonomous intelligent agents pursuing their own interests. One such multi-agent system (MAS) that plays an important role in auctions is the…

Computer Science and Game Theory · Computer Science 2010-05-30 Sumanth Sudeendra , Megha Saini , Shrisha Rao