English
Related papers

Related papers: Bilateral Trade with Correlated Values

200 papers

We analyze a model of selling a single object to a principal-agent pair who want to acquire the object for a firm. The principal and the agent have different assessments of the object's value to the firm. The agent is budget-constrained…

Theoretical Economics · Economics 2024-10-07 Debasis Mishra , Kolagani Paramahamsa

We investigate the power of randomness in the context of a fundamental Bayesian optimal mechanism design problem--a single seller aims to maximize expected revenue by allocating multiple kinds of resources to "unit-demand" agents with…

Computer Science and Game Theory · Computer Science 2010-02-24 Shuchi Chawla , David Malec , Balasubramanian Sivan

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

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

The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermined and uncontroversial agreement on the (in)divisibility of…

Computer Science and Game Theory · Computer Science 2025-03-31 Xiaohui Bei , Shengxin Liu , Xinhang Lu

We consider auctions with N+1 bidders. Of these, N are symmetric and N+1 is "sufficiently strong" relative to the others. The auction is a "tournament" in which the first N players bid to win the right to compete with N+1. The bids of the…

Theoretical Economics · Economics 2024-09-18 Luca Anderlini , GaOn Kim

A celebrated impossibility result by Myerson and Satterthwaite (1983) shows that any truthful mechanism for two-sided markets that maximizes social welfare must run a deficit, resulting in a necessity to relax welfare efficiency and the use…

Computer Science and Game Theory · Computer Science 2024-02-20 Paul Dütting , Federico Fusco , Philip Lazos , Stefano Leonardi , Rebecca Reiffenhäuser

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show…

Computer Science and Game Theory · Computer Science 2014-06-06 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline

Most analyses of manipulation of voting schemes have adopted two assumptions that greatly diminish their practical import. First, it is usually assumed that the manipulators have full knowledge of the votes of the nonmanipulating agents.…

Computer Science and Game Theory · Computer Science 2012-10-19 Tyler Lu , Pingzhong Tang , Ariel D. Procaccia , Craig Boutilier

We study the design of Bayesian incentive compatible mechanisms in single parameter domains, for the objective of optimizing social efficiency as measured by social cost. In the problems we consider, a group of participants compete to…

Computer Science and Game Theory · Computer Science 2013-05-06 Hu Fu , Brendan Lucier , Balasubramanian Sivan , Vasilis Syrgkanis

We study the problem of designing truthful and fair mechanisms when allocating a mixture of divisible and indivisible goods. We first show that there does not exist an EFM (envy-free for mixed goods) and truthful mechanism in general. This…

Computer Science and Game Theory · Computer Science 2023-05-17 Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

Computer Science and Game Theory · Computer Science 2021-04-13 Yannai A. Gonczarowski , S. Matthew Weinberg

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by…

Computer Science and Game Theory · Computer Science 2013-01-14 Paul W. Goldberg , Carmine Ventre

I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders'…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

We consider a monopoly seller who optimally auctions a single object to a single potential buyer, with a known distribution of valuations. We show that a tight lower bound on the seller's expected revenue is $1/e$ times the geometric…

Computer Science and Game Theory · Computer Science 2015-06-02 Omer Tamuz

Mechanism design for a social utility being the sum of agents' utilities (SoU) is a well-studied problem. There are, however, a number of problems of theoretical and practical interest where a designer may have a different objective than…

Computer Science and Game Theory · Computer Science 2015-09-29 Abhinav Sinha , Achilleas Anastasopoulos

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

Computer Science and Game Theory · Computer Science 2014-03-26 Allan Borodin , Mark Braverman , Brendan Lucier , Joel Oren

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

A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical value distribution of the buyer population and chooses the…

Computer Science and Game Theory · Computer Science 2023-05-12 Siddhartha Banerjee , Kamesh Munagala , Yiheng Shen , Kangning Wang
‹ Prev 1 8 9 10 Next ›