English
Related papers

Related papers: Approximate Revenue Maximization in Interdependent…

200 papers

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

I study a principal-agent model in which a principal hires an agent to collect information about an unknown continuous state. The agent acquires a signal whose distribution is centered around the state, controlling the signal's precision at…

Theoretical Economics · Economics 2026-05-05 Fan Wu

We consider a multi-dimensional screening problem of selling a product with multiple quality levels and design virtual value functions to derive conditions that imply optimality of only selling highest quality. A challenge of designing…

Computer Science and Game Theory · Computer Science 2015-08-25 Nima Haghpanah , Jason Hartline

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a…

Computer Science and Game Theory · Computer Science 2015-03-13 Ning Chen , Xiaotie Deng , Paul. W. Goldberg , Jinshan Zhang

In many settings, money is a tool of exchange with minimal inherent utility --- agents will spend it in a way that maximizes the value of goods received subject to reasonable constraints, giving only second-order consideration to the…

Computer Science and Game Theory · Computer Science 2018-07-17 Christopher A Wilkens , Ruggiero Cavallo , Rad Niazadeh , Samuel Taggart

Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amounts of space, and an advertiser can provide multiple…

Computer Science and Game Theory · Computer Science 2022-06-08 Gagan Aggarwal , Kshipra Bhawalkar , Aranyak Mehta , Divyarthi Mohan , Alexandros Psomas

We consider reallocation problems in settings where the initial endowment of each agent consists of a subset of the resources. The private information of the players is their value for every possible subset of the resources. The goal is to…

Computer Science and Game Theory · Computer Science 2014-04-29 Liad Blumrosen , Shahar Dobzinski

Optimizing within the affine maximizer auctions (AMA) is an effective approach for revenue maximizing mechanism design. The AMA mechanisms are strategy-proof and individually rational (if the agents' valuations for the outcomes are…

Computer Science and Game Theory · Computer Science 2020-06-26 Mingyu Guo , Hideaki Hata , Ali Babar

Standard ad auction formats do not immediately extend to settings where multiple size configurations and layouts are available to advertisers. In these settings, the sale of web advertising space increasingly resembles a combinatorial…

Computer Science and Game Theory · Computer Science 2020-11-10 Rad Niazadeh , Jason Hartline , Nicole Immorlica , Mohammad Reza Khani , Brendan Lucier

We study a simple problem of allocating common-value goods. The designer seeks to allocate the goods to as many unit-demand agents as possible without monetary transfers, while agents, who possess partial private information about the…

Theoretical Economics · Economics 2026-04-22 Hiroto Sato , Ryo Shirakawa

We study gains from trade in multi-dimensional two-sided markets. Specifically, we focus on a setting with $n$ heterogeneous items, where each item is owned by a different seller $i$, and there is a constrained-additive buyer with…

Computer Science and Game Theory · Computer Science 2022-03-15 Yang Cai , Kira Goldner , Steven Ma , Mingfei Zhao

We study arbitrage opportunities, market viability and utility maximization in market models with an insider. Assuming that an economic agent possesses from the beginning an additional information in the form of a random variable G, which…

Risk Management · Quantitative Finance 2016-10-03 Ngoc Huy Chau , Wolfgang Runggaldier , Peter Tankov

We study multi-item profit maximization when there is an underlying distribution over buyers' values. In practice, a full description of the distribution is typically unavailable, so we study the setting where the mechanism designer only…

Machine Learning · Computer Science 2023-05-09 Maria-Florina Balcan , Tuomas Sandholm , Ellen Vitercik

This study considers an optimal reinsurance, investment, and dividend strategy control problem for insurance companies in a regulated Markov regime-switching environment, intending to maximize long-run average reward. Unlike existing single…

Optimization and Control · Mathematics 2025-12-18 Lingjia Zeng , Manman Li

In revenue maximization of selling a digital product in a social network, the utility of an agent is often considered to have two parts: a private valuation, and linearly additive influences from other agents. We study the incomplete…

Computer Science and Game Theory · Computer Science 2011-09-27 Wei Chen , Pinyan Lu , Xiaorui Sun , Bo Tang , Yajun Wang , Zeyuan Allen Zhu

This study introduces an optimal mechanism in a dynamic stochastic knapsack environment. The model features a single seller who has a fixed quantity of a perfectly divisible item. Impatient buyers with a piece-wise linear utility function…

Computer Science and Game Theory · Computer Science 2024-02-23 Jihyeok Jung , Chan-Oi Song , Deok-Joo Lee , Kiho Yoon

In practice, most auction mechanisms are not strategy-proof, so equilibrium analysis is required to predict bidding behavior. In many auctions, though, an exact equilibrium is not known and one would like to understand whether -- manually…

Computer Science and Game Theory · Computer Science 2024-08-22 Fabian R. Pieroth , Tuomas Sandholm

A patient seller aims to sell a good to an impatient buyer (i.e., one who discounts utility over time). The buyer will remain in the market for a period of time $T$, and her private value is drawn from a publicly known distribution. What is…

Computer Science and Game Theory · Computer Science 2023-02-14 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

Revenue-optimal auction design is a challenging problem with significant theoretical and practical implications. Sequential auction mechanisms, known for their simplicity and strong strategyproofness guarantees, are often limited by…

Computer Science and Game Theory · Computer Science 2024-07-12 Sai Srivatsa Ravindranath , Zhe Feng , Di Wang , Manzil Zaheer , Aranyak Mehta , David C. Parkes

We consider the optimal pricing problem for a model of the rich media advertisement market, as well as other related applications. In this market, there are multiple buyers (advertisers), and items (slots) that are arranged in a line such…

Computer Science and Game Theory · Computer Science 2013-08-07 Xiaotie Deng , Paul Goldberg , Yang Sun , Bo Tang , Jinshan Zhang