English
Related papers

Related papers: Private Interdependent Valuations: New Bounds for …

200 papers

We study independent private values auction environments in which the auctioneer's revenue depends nonlinearly on bidders' interim winning probabilities. Our framework accommodates heterogeneity among bidders and places no ad hoc…

Theoretical Economics · Economics 2026-02-23 Pasha Andreyanov , Ilia Krasikov , Alex Suzdaltsev

We study the efficiency of simple combinatorial auctions for the allocation of a set of items to a set of agents, with private subadditive valuation functions and budget constraints. The class we consider includes all auctions that allocate…

Computer Science and Game Theory · Computer Science 2020-07-29 Alexandros A. Voudouris

In this paper, we present the first approximation algorithms for the problem of designing revenue optimal Bayesian incentive compatible auctions when there are multiple (heterogeneous) items and when bidders can have arbitrary demand and…

Computer Science and Game Theory · Computer Science 2010-03-30 Sayan Bhattacharya , Gagan Goel , Sreenivas Gollapudi , Kamesh Munagala

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

We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a…

Computer Science and Game Theory · Computer Science 2024-04-10 Simon Mauras , Divyarthi Mohan , Rebecca Reiffenhäuser

In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…

Computer Science and Game Theory · Computer Science 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

We study \emph{combinatorial procurement auctions}, where a buyer with a valuation function $v$ and budget $B$ wishes to buy a set of items. Each item $i$ has a cost $c_i$ and the buyer is interested in a set $S$ that maximizes $v(S)$…

Computer Science and Game Theory · Computer Science 2015-03-19 Ashwinkumar Badanidiyuru , Shahar Dobzinski , Sigal Oren

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

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

We consider a sequential decision-making setting where, at every round $t$, a market maker posts a bid price $B_t$ and an ask price $A_t$ to an incoming trader (the taker) with a private valuation for one unit of some asset. If the trader's…

Computer Science and Game Theory · Computer Science 2025-06-18 Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni , Luigi Foscari , Vinayak Pathak

We study combinatorial auctions for the secondary spectrum market. In this market, short-term licenses shall be given to wireless nodes for communication in their local neighborhood. In contrast to the primary market, channels can be…

Data Structures and Algorithms · Computer Science 2011-04-29 Martin Hoefer , Thomas Kesselheim , Berthold Vöcking

We study the problem of multi-dimensional revenue maximization when selling $m$ items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior distribution. Unlike traditional Bayesian auction design, we…

Computer Science and Game Theory · Computer Science 2022-04-29 Yiannis Giannakopoulos , Diogo Poças , Alexandros Tsigonias-Dimitriadis

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

In many settings agents participate in multiple different auctions that are not necessarily implemented simultaneously. Future opportunities affect strategic considerations of the players in each auction, introducing externalities.…

Computer Science and Game Theory · Computer Science 2011-12-30 Renato Paes Leme , Vasilis Syrgkanis , Eva Tardos

We study sequential procurement auctions where the sellers are provided with a ``best and final offer'' (BAFO) strategy. This strategy allows each seller $i$ to effectively ``freeze'' their price while remaining active in the auction, and…

Computer Science and Game Theory · Computer Science 2025-03-17 Vasilis Gkatzelis , Randolph Preston McAfee , Renato Paes Leme

Pricing based on individual customer characteristics is widely used to maximize sellers' revenues. This work studies offline personalized pricing under endogeneity using an instrumental variable approach. Standard instrumental variable…

Methodology · Statistics 2023-02-27 Rui Miao , Zhengling Qi , Cong Shi , Lin Lin

We study a new model of complementary valuations, which we call "proportional complementarities." In contrast to common models, such as hypergraphic valuations, in our model, we do not assume that the extra value derived from owning a set…

Computer Science and Game Theory · Computer Science 2019-09-04 Yang Cai , Nikhil R. Devanur , Kira Goldner , R. Preston McAfee

This letter considers the design of an auction mechanism to sell the object of a seller when the buyers quantize their private value estimates regarding the object prior to communicating them to the seller. The designed auction mechanism…

Computer Science and Game Theory · Computer Science 2016-11-03 Nianxia Cao , Swastik Brahma , Pramod K. Varshney

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

In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both…

Computer Science and Game Theory · Computer Science 2015-02-02 Avinatan Hassidim , Yishay Mansour
‹ Prev 1 3 4 5 6 7 10 Next ›