中文
相关论文

相关论文: Optimal Mechanism Design with Flexible Consumers a…

200 篇论文

We study the problem of designing revenue-maximizing auctions for allocating multiple goods to flexible consumers. In our model, each consumer is interested in a subset of goods known as its flexibility set and wants to consume one good…

计算机科学与博弈论 · 计算机科学 2018-02-01 Shiva Navabi , Ashutosh Nayyar

We consider the problem of designing an expected-revenue maximizing mechanism for allocating multiple non-perishable goods of $k$ varieties to flexible consumers over $T$ time steps. In our model, a random number of goods of each variety…

计算机科学与博弈论 · 计算机科学 2020-07-08 Shiva Navabi , Ashutosh Nayyar

Assortment optimization concerns the problem of selling items with fixed prices to a buyer who will purchase at most one. Typically, retailers select a subset of items, corresponding to an "assortment" of brands to carry, and make each…

计算机科学与博弈论 · 计算机科学 2022-05-23 Will Ma

Time or money? That is a question! In this paper, we consider this dilemma in the pricing regime, in which we try to find the optimal pricing scheme for identical items with heterogenous time-sensitive buyers. We characterize the…

计算机科学与博弈论 · 计算机科学 2024-02-23 Zhengyang Liu , Liang Shan , Zihe Wang

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…

计算机科学与博弈论 · 计算机科学 2024-02-23 Jihyeok Jung , Chan-Oi Song , Deok-Joo Lee , Kiho Yoon

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…

计算机科学与博弈论 · 计算机科学 2020-10-16 Will Ma

We consider a model of bilateral trade with private values. The value of the buyer and the cost of the seller are jointly distributed. The true joint distribution is unknown to the designer, however, the marginal distributions of the value…

理论经济学 · 经济学 2023-01-02 Komal Malik

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

计算机科学与博弈论 · 计算机科学 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

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…

计算机科学与博弈论 · 计算机科学 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

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

计算机科学与博弈论 · 计算机科学 2020-04-20 Yang Cai , Mingfei Zhao

We study optimal bundling when consumers differ in one dimension. We introduce a partial order on the set of bundles defined by (i) set inclusion and (ii) sales volumes (if sold alone and priced optimally). We show that if the undominated…

理论经济学 · 经济学 2023-04-11 Frank Yang

We consider a monopolist seller facing a single buyer with additive valuations over n heterogeneous, independent items. It is known that in this important setting optimal mechanisms may require randomization [HR12], use menus of infinite…

计算机科学与博弈论 · 计算机科学 2015-11-17 Aviad Rubinstein

We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion by a concave utility function, and players play…

计算机科学与博弈论 · 计算机科学 2012-06-28 Anand Bhalgat , Tanmoy Chakraborty , Sanjeev Khanna

We consider a monopolist seller with $n$ heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The…

计算机科学与博弈论 · 计算机科学 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

A recent line of research has established a novel desideratum for designing approximately-revenue-optimal multi-item mechanisms, namely the buy-many constraint. Under this constraint, prices for different allocations made by the mechanism…

计算机科学与博弈论 · 计算机科学 2024-05-17 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

计算机科学与博弈论 · 计算机科学 2024-11-19 Zhikang Fan , Weiran Shen

We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…

计算机科学与博弈论 · 计算机科学 2020-02-18 Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , S. Matthew Weinberg

Coordinating the interactions between flexibility assets in multi-carrier integrated energy systems (MIES) can lead to an efficient integration of variable renewable energy resources, and a cost-efficient energy transition. However, the…

系统与控制 · 电气工程与系统科学 2025-09-04 Christian Doh Dinga , Sander van Rijn , Laurens de Vries , Milos Cvetkovic

In the mechanism design theory, a designer would like to implement a desired social choice function which specifies her favorite outcome for each possible profile of all agents' types. Traditionally, the designer may be in a dilemma in the…

计算机科学与博弈论 · 计算机科学 2019-06-04 Haoyang Wu

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

计算机科学与博弈论 · 计算机科学 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla
‹ 上一页 1 2 3 10 下一页 ›