English
Related papers

Related papers: The Value of Information Concealment

200 papers

A common practice in many auctions is to offer bidders an opportunity to improve their bids, known as a Best and Final Offer (BAFO) stage. This final bid can depend on new information provided about either the asset or the competitors. This…

Computer Science and Game Theory · Computer Science 2021-04-21 Galit Ashkenazi-Golan , Yevgeny Tsodikovich , Yannick Viossat

We study probabilistic single-item second-price auctions where the item is characterized by a set of attributes. The auctioneer knows the actual instantiation of all the attributes, but he may choose to reveal only a subset of these…

Computer Science and Game Theory · Computer Science 2013-02-22 Mingyu Guo , Argyrios Deligkas

We consider a scenario in which a database stores sensitive data of users and an analyst wants to estimate statistics of the data. The users may suffer a cost when their data are used in which case they should be compensated. The analyst…

Computer Science and Game Theory · Computer Science 2012-04-19 Lisa Fleischer , Yu-Han Lyu

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

In many decision-making scenarios, individuals strategically choose what information to disclose to optimize their own outcomes. It is unclear whether such strategic information disclosure can lead to good societal outcomes. To address this…

Computer Science and Game Theory · Computer Science 2026-04-07 Siddhartha Banerjee , Kamesh Munagala , Yiheng Shen , Kangning Wang

We study revenue optimization pricing algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation. We show that, in the case when both the seller and the buyer…

Computer Science and Game Theory · Computer Science 2018-05-08 Arsenii Vanunts , Alexey Drutsa

Generating good revenue is one of the most important problems in Bayesian auction design, and many (approximately) optimal dominant-strategy incentive compatible (DSIC) Bayesian mechanisms have been constructed for various auction settings.…

Computer Science and Game Theory · Computer Science 2020-08-07 Jing Chen , Bo Li , Yingkai Li , Pinyan Lu

We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

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

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

This paper considers Bayesian revenue maximization in the $k$-unit setting, where a monopolist seller has $k$ copies of an indivisible item and faces $n$ unit-demand buyers (whose value distributions can be non-identical). Four basic…

Computer Science and Game Theory · Computer Science 2022-07-22 Yaonan Jin , Shunhua Jiang , Pinyan Lu , Hengjie Zhang

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

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 study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-maximizing auctions under this communication restriction. For…

Computer Science and Game Theory · Computer Science 2011-10-13 L. Blumrosen , N. Nisan , I. Segal

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

Computer Science and Game Theory · Computer Science 2022-09-22 Sergiu Hart , Noam Nisan

Many auction settings implicitly or explicitly require that bidders are treated equally ex-ante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or…

Computer Science and Game Theory · Computer Science 2014-11-06 Christos Tzamos , Christopher A. Wilkens

Auction theory traditionally assumes that bidders' valuation distributions are known to the auctioneer, such as in the celebrated, revenue-optimal Myerson auction. However, this theory does not describe how the auctioneer comes to possess…

Computer Science and Game Theory · Computer Science 2014-07-11 Avrim Blum , Yishay Mansour , Jamie Morgenstern

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data providing agencies sell user information to advertisers to allow…

Computer Science and Game Theory · Computer Science 2012-04-26 Moshe Babaioff , Robert Kleinberg , Renato Paes Leme

We provide simple and approximately revenue-optimal mechanisms in the multi-item multi-bidder settings. We unify and improve all previous results, as well as generalize the results to broader cases. In particular, we prove that the better…

Computer Science and Game Theory · Computer Science 2019-08-27 Yang Cai , Mingfei Zhao

We study a market for private data in which a data analyst publicly releases a statistic over a database of private information. Individuals that own the data incur a cost for their loss of privacy proportional to the differential privacy…

Computer Science and Game Theory · Computer Science 2012-10-01 Pranav Dandekar , Nadia Fawaz , Stratis Ioannidis