English
Related papers

Related papers: Private Interdependent Valuations

200 papers

We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each agent possesses a private signal that captures her…

Computer Science and Game Theory · Computer Science 2025-08-01 Michal Feldman , Simon Mauras , Divyarthi Mohan , Rebecca Reiffenhäuser

In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of $n$ items, each of which must be allocated to one of $m$ agents. Each agent $\ell$ has a valuation function $v_\ell$, where $v_\ell(S)$ denotes the welfare…

Data Structures and Algorithms · Computer Science 2017-12-18 Nitish Korula , Vahab Mirrokni , Morteza Zadimoghaddam

Mechanism design for one-sided markets has been investigated for several decades in economics and in computer science. More recently, there has been an increased attention on mechanisms for two-sided markets, in which buyers and sellers act…

Computer Science and Game Theory · Computer Science 2021-03-09 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Tim Roughgarden , Stefano Turchetta

Recent empirical work demonstrates that online advertisement can exhibit bias in the delivery of ads across users even when all advertisers bid in a non-discriminatory manner. We study the design of ad auctions that, given fair bids, are…

Computer Science and Game Theory · Computer Science 2021-12-02 Shuchi Chawla , Meena Jagadeesan

We propose and study a novel mechanism design setup where each bidder holds two kinds of private information: (1) type variable, which can be misreported; (2) information variable, which the bidder may want to conceal or partially reveal,…

Computer Science and Game Theory · Computer Science 2023-01-31 Jibang Wu , Ashwinkumar Badanidiyuru , Haifeng Xu

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

We consider a monopoly information holder selling information to a budget-constrained decision maker, who may benefit from the seller's information. The decision maker has a utility function that depends on his action and an uncertain state…

Computer Science and Game Theory · Computer Science 2020-02-18 Yiling Chen , Haifeng Xu , Shuran Zheng

We explore the performance of polynomial-time incentive-compatible mechanisms in single-crossing domains. Single-crossing domains were extensively studied in the economics literature. Roughly speaking, a domain is single crossing if…

Computer Science and Game Theory · Computer Science 2023-05-23 Moshe Babaioff , Shahar Dobzinski , Shiri Ron

We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor \delta{} in (0,1), and the mechanism designer knows \delta. The classical notions of implementation in…

Computer Science and Game Theory · Computer Science 2011-12-07 Alessandro Chiesa , Silvio Micali , Zeyuan Allen Zhu

In combinatorial auctions, a designer must decide how to allocate a set of indivisible items amongst a set of bidders. Each bidder has a valuation function which gives the utility they obtain from any subset of the items. Our focus is…

Computer Science and Game Theory · Computer Science 2017-03-31 Shaddin Dughmi , Bryan Wilder

In budget-feasible mechanism design, there is a set of items $U$, each owned by a distinct seller. The seller of item $e$ incurs a private cost $\overline{c}_e$ for supplying her item. A buyer wishes to procure a set of items from the…

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

A single unit of a good is sold to one of two bidders. Each bidder has either a high prior valuation or a low prior valuation for the good. Their prior valuations are independently and identically distributed. Each bidder may observe an…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…

Computer Science and Game Theory · Computer Science 2009-04-17 Patrick Briest , Shuchi Chawla , Robert Kleinberg , S. Matthew Weinberg

In a typical decentralized autonomous organization (DAO), people organize themselves into a group that is programmatically managed. DAOs can act as bidders in auctions, with a DAO's bid treated by the auctioneer as if it had been submitted…

Computer Science and Game Theory · Computer Science 2023-06-30 Maryam Bahrani , Pranav Garimidi , Tim Roughgarden

We expand the literature on the price of anarchy (PoA) of simultaneous item auctions by considering settings with correlated values; we do this via the fundamental economic model of interdependent values (IDV). It is well-known that in…

Computer Science and Game Theory · Computer Science 2021-03-02 Alon Eden , Michal Feldman , Inbal Talgam-Cohen , Ori Zviran

Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d., or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when…

Computer Science and Game Theory · Computer Science 2023-07-11 Nikhil R. Devanur , Zhiyi Huang , Christos-Alexandros Psomas

We are interested in mechanisms that maximize social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the…

Computer Science and Game Theory · Computer Science 2008-10-20 Krzysztof R. Apt , Vangelis Markakis

We consider an environment where sellers compete over buyers. All sellers are a-priori identical and strategically signal buyers about the product they sell. In a setting motivated by on-line advertising in display ad exchanges, where firms…

Computer Science and Game Theory · Computer Science 2012-03-30 Gleb Polevoy , Rann Smorodinsky , Moshe Tennenholtz

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

A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…

Theoretical Economics · Economics 2020-08-10 Alex Suzdaltsev