English
Related papers

Related papers: Auctions with a Profit Sharing Contract

200 papers

Motivated by the recent popularity of machine learning training services, we introduce a contract design problem in which a provider sells a service that results in an outcome of uncertain quality for the buyer. The seller has a set of…

Computer Science and Game Theory · Computer Science 2026-05-06 Krishnamurthy Iyer , Alec Sun , Haifeng Xu , You Zu

We propose a new all-pay auction format in which risk-loving bidders pay a constant fee each time they bid for an object whose monetary value is common knowledge among the bidders, and bidding fees are the only source of benefit for the…

Computer Science and Game Theory · Computer Science 2016-03-03 Ali Kakhbod

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

A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…

Theoretical Economics · Economics 2021-10-26 Kenneth Hendricks , Thomas Wiseman

This paper studies optimal auction design when valuations depend endogenously on post-auction collaboration between the seller and the winning bidder. Both parties exert non-contractible efforts after the auction, generating a double moral…

Theoretical Economics · Economics 2026-04-21 Dazhong Wang , Ruqu Wang , Xinyi Xu

We consider an outsourcing problem where a software agent procures multiple services from providers with uncertain reliabilities to complete a computational task before a strict deadline. The service consumer requires a procurement strategy…

Computer Science and Game Theory · Computer Science 2021-10-26 Farzaneh Farhadi , Maria Chli , Nicholas R. Jennings

On ad exchange platforms the place for advertisement is sold through different kinds of auctions. However, it is not uncommon the situation where the seller repeatedly encounters only one buyer, thus the posted price auction degenerates…

Computer Science and Game Theory · Computer Science 2019-02-05 Nikita Kalinin

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

A speculator can take advantage of a procurement auction by acquiring items for sale before the auction. The accumulated market power can then be exercised in the auction and may lead to a large enough gain to cover the acquisition costs. I…

Theoretical Economics · Economics 2026-01-29 Shanglyu Deng

Situations where a group of agents come together to jointly buy a resource that they individually cannot afford to buy are commonly observed in markets. For example in the US market for radio spectrum, a recent proposal invited small firms…

Computer Science and Game Theory · Computer Science 2015-03-09 Vijay Kamble , Jean Walrand

We consider pricing in settings where a consumer discovers his value for a good only as he uses it, and the value evolves with each use. We explore simple and natural pricing strategies for a seller in this setting, under the assumption…

Computer Science and Game Theory · Computer Science 2014-11-06 Shuchi Chawla , Nikhil R. Devanur , Anna Karlin , Balasubramanian Sivan

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose…

Computer Science and Game Theory · Computer Science 2021-11-30 Vishnu V. Narayan , Gautam Rayaprolu , Adrian Vetta

We study the problem of characterizing revenue optimal auctions for single-minded buyers. Each buyer is interested only in a specific bundle of items and has a value for the same. Both his bundle and its value are his private information.…

Computer Science and Game Theory · Computer Science 2010-09-14 Vineet Abhishek , Bruce Hajek

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…

Computer Science and Game Theory · Computer Science 2012-07-09 Anna Osepayshvili , Michael P. Wellman , Daniel Reeves , Jeffrey K. MacKie-Mason

We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution $D$ in every round). Prior work assumes that the buyer is fully rational…

Computer Science and Game Theory · Computer Science 2017-11-28 Mark Braverman , Jieming Mao , Jon Schneider , S. Matthew Weinberg

It is well-known that selling different goods in a single bundle can significantly increase revenue. However, bundling is no longer profitable if the goods have high production costs. To overcome this challenge, we introduce a new…

Computer Science and Game Theory · Computer Science 2021-02-23 Will Ma , David Simchi-Levi

We study mechanisms for selling a single item when buyers have private costs for participating in the mechanism. An agent's participation cost can also be interpreted as an outside option value that she must forego to participate. This…

Computer Science and Game Theory · Computer Science 2023-11-07 Yannai A. Gonczarowski , Nicole Immorlica , Yingkai Li , Brendan Lucier

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are…

Computer Science and Game Theory · Computer Science 2015-10-02 Marek Adamczyk , Allan Borodin , Diodato Ferraioli , Bart de Keijzer , Stefano Leonardi

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
‹ Prev 1 2 3 10 Next ›