中文
相关论文

相关论文: Posted Pricing sans Discrimination

200 篇论文

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

计算机科学与博弈论 · 计算机科学 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We…

计算机科学与博弈论 · 计算机科学 2017-09-04 Yang Cai , Constantinos Daskalakis

Sequential posted pricing auctions are popular because of their simplicity in practice and their tractability in theory. A usual assumption in their study is that the Bayesian prior distributions of the buyers are known to the seller, while…

机器学习 · 计算机科学 2024-06-14 Sahil Singla , Yifan Wang

This paper studies an online selection problem, where a seller seeks to sequentially sell multiple copies of an item to arriving buyers. We consider an adversarial setting, making no modeling assumptions about buyers' valuations for the…

计算机科学与博弈论 · 计算机科学 2024-10-11 Bo Sun , Hossein Nekouyan Jazi , Xiaoqi Tan , Raouf Boutaba

We study revenue maximization through sequential posted-price (SPP) mechanisms in single-dimensional settings with $n$ buyers and independent but not necessarily identical value distributions. We construct the SPP mechanisms by considering…

计算机科学与博弈论 · 计算机科学 2021-01-11 Hedyeh Beyhaghi , Negin Golrezaei , Renato Paes Leme , Martin Pal , Balasubramanian Sivan

Social goods are goods that grant value not only to their owners but also to the owners' surroundings, be it their families, friends or office mates. The benefit a non-owner derives from the good is affected by many factors, including the…

计算机科学与博弈论 · 计算机科学 2017-07-04 Alon Eden , Tomer Ezra , Michal Feldman

We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone submodular value function for the subset of agents whose…

计算机科学与博弈论 · 计算机科学 2025-04-15 Andreas Charalampopoulos , Dimitris Fotakis , Panagiotis Patsilinakos , Thanos Tolias

In this paper, we study third-degree price discrimination in a model first presented by Bergemann, Brooks, and Morris [2015]. Since such price discrimination might create market segments with vastly different posted prices, we consider…

理论经济学 · 经济学 2025-10-20 Kamesh Munagala , Yiheng Shen , Renzhe Xu

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

计算机科学与博弈论 · 计算机科学 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

We study the design of prior-independent auctions in a setting with heterogeneous bidders. In particular, we consider the setting of selling to $n$ bidders whose values are drawn from $n$ independent but not necessarily identical…

计算机科学与博弈论 · 计算机科学 2023-11-08 Guru Guruganesh , Aranyak Mehta , Di Wang , Kangning Wang

In today's economy, selling a new zero-marginal cost product is a real challenge, as it is difficult to determine a product's "correct" sales price based on its profit and dissemination. As an example, think of the price of a new app or…

交易与市场微观结构 · 定量金融 2021-08-03 Daniel Fraiman

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

This paper addresses the online $k$-selection problem with diseconomies of scale (OSDoS), where a seller seeks to maximize social welfare by optimally pricing items for sequentially arriving buyers, accounting for increasing marginal…

计算机科学与博弈论 · 计算机科学 2025-02-05 Hossein Nekouyan Jazi , Bo Sun , Raouf Boutaba , Xiaoqi Tan

We consider a combinatorial auction setting where buyers have fractionally subadditive (XOS) valuations over the items and the seller's objective is to maximize the social welfare. A prophet inequality in this setting bounds the competitive…

计算机科学与博弈论 · 计算机科学 2025-05-23 Shuchi Chawla , Trung Dang , Zhiyi Huang , Yifan Wang

Dynamic pricing is the practice of adjusting the selling price of a product to maximize a firm's revenue by responding to market demand. The literature typically distinguishes between two settings: infinite inventory, where the firm has…

机器学习 · 计算机科学 2025-10-15 Anush Anand , Pranav Agrawal , Tejas Bodas

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

In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…

人工智能 · 计算机科学 2023-03-24 Bin Li , Yahui Lei

In many shopping scenarios, e.g., in online shopping, customers have a large menu of options to choose from. However, most of the buyers do not browse all the options and make decision after considering only a small part of the menu. To…

计算机科学与博弈论 · 计算机科学 2018-02-15 Nick Gravin , Zhihao Gavin Tang

This paper considers Bayesian revenue maximization in the $k$-unit setting, where a monopolist seller has $k$ copies of an indivisible item and faces $n$ unit-demand buyers (whose value distributions can be non-identical). Four basic…

计算机科学与博弈论 · 计算机科学 2022-07-22 Yaonan Jin , Shunhua Jiang , Pinyan Lu , Hengjie Zhang