English
Related papers

Related papers: Multi-Parameter Mechanisms for Consumer Surplus Ma…

200 papers

This note pursues two primary objectives. First, we analyze the outcomes of an all-pay auction within a store where buyers with and without financial constraints arrive at varying rates, and where buyer types are private information.…

Theoretical Economics · Economics 2024-04-16 Cemil Selcuk

We examine information structure design, also called "persuasion" or "signaling", in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a…

Computer Science and Game Theory · Computer Science 2020-03-09 Shaddin Dughmi , David Kempe , Ruixin Qiang

Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amounts of space, and an advertiser can provide multiple…

Computer Science and Game Theory · Computer Science 2022-06-08 Gagan Aggarwal , Kshipra Bhawalkar , Aranyak Mehta , Divyarthi Mohan , Alexandros Psomas

In budget-feasible mechanism design, a buyer wishes to procure a set of items of maximum value from self-interested players. We have a valuation function $v:2^U \to \mathbb{R}_+$, where $U$ is the set of all items, where $v(S)$ specifies…

Computer Science and Game Theory · Computer Science 2026-03-25 Rian Neogi , Kanstantsin Pashkovich , Chaitanya Swamy

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

Motivated by applications such as college admission and insurance rate determination, we propose an evaluation problem where the inputs are controlled by strategic individuals who can modify their features at a cost. A learner can only…

Computer Science and Game Theory · Computer Science 2020-11-05 Nika Haghtalab , Nicole Immorlica , Brendan Lucier , Jack Z. Wang

We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-optimal in this setting is a major open problem in mechanism…

Computer Science and Game Theory · Computer Science 2023-10-13 Yang Cai , Ziyun Chen , Jinzhao Wu

We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common economic situations, and yet it has not been studied, to our…

Computer Science and Game Theory · Computer Science 2013-12-02 Yaron Singer

We consider the pricing problem faced by a seller who assigns a price to a good that confers its benefits not only to its buyers, but also to other individuals around them. For example, a snow-blower is potentially useful not only to the…

Computer Science and Game Theory · Computer Science 2013-05-02 Michal Feldman , David Kempe , Brendan Lucier , Renato Paes Leme

A decision maker is choosing between an active action (e.g., purchase a house, invest certain stock) and a passive action. The payoff of the active action depends on the buyer's private type and also an unknown state of nature. An…

Computer Science and Game Theory · Computer Science 2021-10-29 Shuze Liu , Weiran Shen , Haifeng Xu

Buying and selling of data online has increased substantially over the last few years. Several frameworks have already been proposed that study query pricing in theory and practice. The key guiding principle in these works is the notion of…

Databases · Computer Science 2019-09-10 Shuchi Chawla , Shaleen Deep , Paraschos Koutris , Yifeng Teng

We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a…

Computer Science and Game Theory · Computer Science 2024-10-04 Alireza Fallah , Michael I. Jordan , Annie Ulichney

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…

Computer Science and Game Theory · Computer Science 2014-12-31 Jason D. Hartline , Tim Roughgarden

Over the past few years, more and more Internet advertisers have started using automated bidding for optimizing their advertising campaigns. Such advertisers have an optimization goal (e.g. to maximize conversions), and some constraints…

Computer Science and Game Theory · Computer Science 2023-02-01 Gagan Aggarwal , Andres Perlroth , Junyao Zhao

We propose a new model for aggregating preferences over a set of indivisible items based on a quantile value. In this model, each agent is endowed with a specific quantile, and the value of a given bundle is defined by the corresponding…

Computer Science and Game Theory · Computer Science 2026-05-06 Haris Aziz , Shivika Narang , Mashbat Suzuki

The growing demand for data and AI-generated digital goods, such as personalized written content and artwork, necessitates effective pricing and feedback mechanisms that account for uncertain utility and costly production. Motivated by…

Computer Science and Game Theory · Computer Science 2023-06-06 Zachary Robertson , Oluwasanmi Koyejo

We study online combinatorial auctions with production costs proposed by Blum et al. using the online primal dual framework. In this model, buyers arrive online, and the seller can produce multiple copies of each item subject to a…

Data Structures and Algorithms · Computer Science 2014-11-18 Zhiyi Huang , Anthony Kim

The framework of budget-feasible mechanism design studies procurement auctions where the auctioneer (buyer) aims to maximize his valuation function subject to a hard budget constraint. We study the problem of designing truthful mechanisms…

Computer Science and Game Theory · Computer Science 2019-05-07 Georgios Amanatidis , Pieter Kleer , Guido Schäfer

We consider a multi-dimensional screening problem of selling a product with multiple quality levels and design virtual value functions to derive conditions that imply optimality of only selling highest quality. A challenge of designing…

Computer Science and Game Theory · Computer Science 2015-08-25 Nima Haghpanah , Jason Hartline

We study the problem of designing optimal auctions under restrictions on the set of permissible allocations. In addition to allowing us to restrict to deterministic mechanisms, we can also indirectly model non-additive valuations. We prove…

Computer Science and Game Theory · Computer Science 2016-06-07 Ian Kash , Rafael Frongillo