English
Related papers

Related papers: Private Interdependent Valuations

200 papers

Complements between goods - where one good takes on added value in the presence of another - have been a thorn in the side of algorithmic mechanism designers. On the one hand, complements are common in the standard motivating applications…

Computer Science and Game Theory · Computer Science 2012-05-21 Ittai Abraham , Moshe Babaioff , Shaddin Dughmi , Tim Roughgarden

When agents with independent priors bid for a single item, Myerson's optimal auction maximizes expected revenue, whereas Vickrey's second-price auction optimizes social welfare. We address the natural question of trade-offs between the two…

Computer Science and Game Theory · Computer Science 2012-05-15 Ilias Diakonikolas , Christos Papadimitriou , George Pierrakos , Yaron Singer

We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…

Data Structures and Algorithms · Computer Science 2025-10-07 Negin Golrezaei , Sourav Sahoo

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 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 show that every universally truthful randomized mechanism for combinatorial auctions with submodular valuations that provides $m^{\frac 1 2 -\epsilon}$ approximation to the social welfare and uses value queries only must use…

Computer Science and Game Theory · Computer Science 2015-03-17 Shahar Dobzinski

What fraction of the potential social surplus in an environment can be extracted by a revenue-maximizing monopolist? We investigate this problem in Bayesian single-parameter environments with independent private values. The precise answer…

Computer Science and Game Theory · Computer Science 2013-05-03 Robert Kleinberg , Yang Yuan

We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…

Theoretical Economics · Economics 2022-02-16 Ethan Che

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

Theoretical Economics · Economics 2025-10-20 Shixin Wang

We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $\theta^*$, consists of a set of…

Computer Science and Game Theory · Computer Science 2014-03-26 Alessandro Chiesa , Silvio Micali , Zeyuan Allen Zhu

In a combinatorial auction with item bidding, agents participate in multiple single-item second-price auctions at once. As some items might be substitutes, agents need to strategize in order to maximize their utilities. A number of results…

Computer Science and Game Theory · Computer Science 2017-04-17 Paul Dütting , Thomas Kesselheim

We initiate the study of markets for private data, though the lens of differential privacy. Although the purchase and sale of private data has already begun on a large scale, a theory of privacy as a commodity is missing. In this paper, we…

Computer Science and Game Theory · Computer Science 2011-11-30 Arpita Ghosh , Aaron Roth

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

In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be linear in the click-through rate, a budget constraint, and…

Computer Science and Game Theory · Computer Science 2011-12-30 Riccardo Colini-Baldeschi , Monika Henzinger , Stefano Leonardi , Martin Starnberger

Most of the economic reports forecast that almost half of the worldwide market value unlocked by AI over the next decade (up to 6 trillion USD per year) will be in marketing&sales. In particular, AI will enable the optimization of more and…

Computer Science and Game Theory · Computer Science 2022-01-31 Matteo Castiglioni , Diodato Ferraioli , Nicola Gatti , Alberto Marchesi , Giulia Romano

In this paper, a general framework is formalised to characterise the value of information (VoI) in hidden Markov models. Specifically, the VoI is defined as the mutual information between the current, unobserved status at the source and a…

Information Theory · Computer Science 2022-02-15 Zijing Wang , Mihai-Alin Badiu , Justin P. Coon

In the standard single-dimensional model of position auctions, bidders agree on the relative values of the positions and each of them submits a single bid that is interpreted in terms of these values. Motivated by current practice in…

Computer Science and Game Theory · Computer Science 2018-06-22 Paul Dütting , Felix Fischer , David C. Parkes

Decision makers involved in the management of civil assets and systems usually take actions under constraints imposed by societal regulations. Some of these constraints are related to epistemic quantities, as the probability of failure…

Artificial Intelligence · Computer Science 2021-06-10 Shuo Li , Matteo Pozzi

High-stakes auctions are often preceded by nonbinding communication between bidders and the seller. Motivated by these practices, this paper examines a two-period model in which two bidders send private cheap talk messages to the seller…

Theoretical Economics · Economics 2026-03-19 Eric Yan

A monopoly seller is privately and imperfectly informed about the buyer's value of the product. The seller uses information to price discriminate the buyer. A designer offers a mechanism that provides the seller with additional information…

Theoretical Economics · Economics 2023-03-03 Shota Ichihashi , Alex Smolin
‹ Prev 1 4 5 6 7 8 10 Next ›