English
Related papers

Related papers: Optimal Auction Design for Flexible Consumers

200 papers

Retailers have significant potential to improve recommendations through strategic bundling and pricing. By taking into account different types of customers and their purchasing decisions, retailers can better accommodate customer…

Optimization and Control · Mathematics 2024-09-06 Maxime Bouscary , Mazen Danaf , Saurabh Amin

Signaling is an important topic in the study of asymmetric information in economic settings. In particular, the transparency of information available to a seller in an auction setting is a question of major interest. We introduce the study…

Computer Science and Game Theory · Computer Science 2012-04-26 Yuval Emek , Michal Feldman , Iftah Gamzu , Renato Paes Leme , Moshe Tennenholtz

We consider assortment optimization over a continuous spectrum of products represented by the unit interval, where the seller's problem consists of determining the optimal subset of products to offer to potential customers. To describe the…

Machine Learning · Statistics 2021-04-15 Yannik Peeters , Arnoud V. den Boer , Michel Mandjes

We are interested in the setting where a seller sells sequentially arriving items, one per period, via a dynamic auction. At the beginning of each period, each buyer draws a private valuation for the item to be sold in that period and this…

Computer Science and Game Theory · Computer Science 2018-12-10 Vahab Mirrokni , Renato Paes Leme , Pingzhong Tang , Song Zuo

We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Theoretical Economics · Economics 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

We study the information design problem in a single-unit auction setting. The information designer controls independent private signals according to which the buyers infer their binary private values. Assuming that the seller adopts the…

Theoretical Economics · Economics 2022-10-28 Yi-Chun Chen , Xiangqian Yang

We study the problem of finding a small subset of items that is \emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with…

Computer Science and Game Theory · Computer Science 2019-02-06 Pasin Manurangsi , Warut Suksompong

Auctions are widely used in exchanges to match buy and sell requests. Once the buyers and sellers place their requests, the exchange determines how these requests are to be matched. The two most popular objectives used while determining the…

Data Structures and Algorithms · Computer Science 2024-03-06 Mohit Garg , Suneel Sarswat

We study mechanisms for selling a single item when buyers have private costs for participating in the mechanism. An agent's participation cost can also be interpreted as an outside option value that she must forego to participate. This…

Computer Science and Game Theory · Computer Science 2023-11-07 Yannai A. Gonczarowski , Nicole Immorlica , Yingkai Li , Brendan Lucier

Mechanisms such as auctions and pricing schemes are utilized to design strategic (noncooperative) games for networked systems. Although the participating players are selfish, these mechanisms ensure that the game outcome is optimal with…

Computer Science and Game Theory · Computer Science 2010-09-03 Tansu Alpcan , Holger Boche , Siddharth Naik

Two sellers compete to sell identical products to a single buyer. Each seller chooses an arbitrary mechanism, possibly involving lotteries, to sell their product. The utility-maximizing buyer can choose to participate in one or both…

Computer Science and Game Theory · Computer Science 2025-05-27 Brendan Lucier , Raghuvansh R. Saxena

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 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

We study a general online combinatorial auction problem in algorithmic mechanism design. A provider allocates multiple types of capacity-limited resources to customers that arrive in a sequential and arbitrary manner. Each customer has a…

Computer Science and Game Theory · Computer Science 2023-10-10 Xiaoqi Tan , Alberto Leon-Garcia , Yuan Wu , Danny H. K. Tsang

We present a method for finding envy-free prices in a combinatorial auction where the consumers' number $n$ coincides with that of distinct items for sale, each consumer can buy one single item and each item has only one unit available.…

Computer Science and Game Theory · Computer Science 2023-08-25 Marcos Salvatierra , Juan G. Colonna , Mario Salvatierra , Alcides de C. Amorim Neto

Daily deals platforms such as Amazon Local, Google Offers, GroupOn, and LivingSocial have provided a new channel for merchants to directly market to consumers. In order to maximize consumer acquisition and retention, these platforms would…

Computer Science and Game Theory · Computer Science 2013-10-03 Yang Cai , Mohammad Mahdian , Aranyak Mehta , Bo Waggoner

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

Computer Science and Game Theory · Computer Science 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

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

This paper studies how to aggregate prosumers (or large consumers) and their collective decisions in electricity markets, with a focus on fairness. Fairness is essential for prosumers to participate in aggregation schemes. Some prosumers…

Optimization and Control · Mathematics 2024-09-02 Zoé Fornier , Vincent Leclère , Pierre Pinson

The design of data markets has gained importance as firms increasingly use machine learning models fueled by externally acquired training data. A key consideration is the externalities firms face when data, though inherently freely…

Computer Science and Game Theory · Computer Science 2024-10-22 Anish Agarwal , Munther Dahleh , Thibaut Horel , Maryann Rui