中文
相关论文

相关论文: A Tale of Two Monopolies

200 篇论文

We consider the well known, and notoriously difficult, problem of a single revenue-maximizing seller selling two or more heterogeneous goods to a single buyer whose private values for the goods are drawn from a (possibly correlated) known…

计算机科学与博弈论 · 计算机科学 2022-09-23 Sergiu Hart , Noam Nisan

We study multi-product monopoly pricing where the seller jointly designs the selling mechanism and the information structure for the buyer to learn his values. Unlike the case with exogenous information, we show that when the seller…

计算机科学与博弈论 · 计算机科学 2025-10-29 Yang Cai , Yingkai Li , Jinzhao Wu

In this paper, the optimal pricing strategy in Avellande-Stoikov's for a monopolistic dealer is extended to a general situation where multiple dealers are present in a competitive market. The dealers' trading intensities, their optimal bid…

交易与市场微观结构 · 定量金融 2015-12-31 Wai-Ki Ching , Jia-Wen Gu , Qing-Qing Yang , Tak-Kuen Siu

A monopoly platform sells either a risky product (with unknown utility) or a safe product (with known utility) to agents who sequentially arrive and learn the utility of the risky product by the reporting of previous agents. It is costly…

理论经济学 · 经济学 2023-12-12 Kaiwei Zhang , Xi Weng , Xienan Cheng

Two sellers compete to sell identical products to a single buyer. Each seller chooses an arbitrary mechanism, possibly involving lotteries, to sell their product. The utility-maximizing buyer can choose to participate in one or both…

计算机科学与博弈论 · 计算机科学 2025-05-27 Brendan Lucier , Raghuvansh R. Saxena

We investigate a seller's revenue-maximizing mechanism in a setting where a desirable good is sold together with an undesirable bad (e.g., advertisements) that generates third-party revenue. The buyer's private information is…

理论经济学 · 经济学 2026-02-02 Kolagani Paramahamsa

Personalized pricing is a business strategy to charge different prices to individual consumers based on their characteristics and behaviors. It has become common practice in many industries nowadays due to the availability of a growing…

计算机与社会 · 计算机科学 2022-02-22 Renzhe Xu , Xingxuan Zhang , Peng Cui , Bo Li , Zheyan Shen , Jiazheng Xu

We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, more importantly, even when the optimal solution is…

计算机科学与博弈论 · 计算机科学 2017-07-17 Xi Chen , George Matikas , Dimitris Paparas , Mihalis Yannakakis

We address the problem of improving bidders' strategies in prior-dependent revenue-maximizing auctions and introduce a simple and generic method to design novel bidding strategies if the seller uses past bids to optimize her mechanism. We…

计算机科学与博弈论 · 计算机科学 2021-09-15 Thomas Nedelec , Marc Abeille , Clément Calauzènes , Benjamin Heymann , Vianney Perchet , Noureddine El Karoui

We consider an economic environment with one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ refers to the winning probability of an object, and $t$ denotes the payment that the buyer makes. We consider…

计算机科学与博弈论 · 计算机科学 2024-12-17 Mridu Prabal Goswami

Consider a monopolist selling $n$ items to an additive buyer whose item values are drawn from independent distributions $F_1,F_2,\ldots,F_n$ possibly having unbounded support. Unlike in the single-item case, it is well known that the…

计算机科学与博弈论 · 计算机科学 2021-04-13 Moshe Babaioff , Yannai A. Gonczarowski , Noam Nisan

A monopolist wishes to maximize her profits by finding an optimal price policy. After she announces a menu of products and prices, each agent $x$ will choose to buy that product $y(x)$ which maximizes his own utility, if positive. The…

最优化与控制 · 数学 2021-02-12 Robert J. McCann , Kelvin Shuangjian Zhang

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

We study the envy free pricing problem faced by a seller who wishes to maximize revenue by setting prices for bundles of items. If there is an unlimited supply of items and agents are single minded then we show that finding the revenue…

计算机科学与博弈论 · 计算机科学 2016-09-08 Amos Fiat , Amiram Wingarten

A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market…

理论经济学 · 经济学 2024-10-16 Jose Correa , Andres Cristi , Laura Vargas Koch

We study the problem of selling $n$ items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally,…

计算机科学与博弈论 · 计算机科学 2015-07-23 MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , Saeed Seddighin

Pricing decisions are often made when market information is still poor. In turn, existing theoretical models often reason about the response of optimal prices to changing market characteristics without exploiting all available information…

最优化与控制 · 数学 2021-07-19 Stefanos Leonardos , Costis Melolidakis , Constandina Koki

We study the problem of designing revenue-maximizing mechanisms for a selfish mediator who facilitates trade between a buyer and a seller. We consider a setting where the mediator does not have information advantage and the buyer's…

计算机科学与博弈论 · 计算机科学 2026-03-10 Zhikang Fan , Weiran Shen , Shaojie Tang , Yao Wang

I study the optimal allocation of positional goods in the presence of externalities arising from consumers' concerns about relative consumption. Applications include luxury goods, priority services, education, and organizational…

理论经济学 · 经济学 2025-10-10 Peiran Xiao

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