English
Related papers

Related papers: Group buying with bundle discounts: computing effi…

200 papers

We study fair allocation of constrained resources, where a market designer optimizes overall welfare while maintaining group fairness. In many large-scale settings, utilities are not known in advance, but are instead observed after…

Computer Science and Game Theory · Computer Science 2024-11-06 Elita Lobo , Justin Payan , Cyrus Cousins , Yair Zick

Retailers have significant potential to improve recommendations through strategic bundling and pricing. By taking into account different types of customers and their purchasing decisions, retailers can better accommodate customer…

Optimization and Control · Mathematics 2024-09-06 Maxime Bouscary , Mazen Danaf , Saurabh Amin

We consider a fundamental generalization of the classical newsvendor problem where the seller needs to decide on the inventory of a product jointly for multiple locations on a metric as well as a fulfillment policy to satisfy the uncertain…

Optimization and Control · Mathematics 2025-06-04 Ayoub Foussoul , Vineet Goyal

Personalized pricing assigns different prices to customers for the same product based on customer-specific features to improve retailer revenue. However, this practice often raises concerns about fairness at both the individual and group…

Computers and Society · Computer Science 2025-12-15 Zeyu Chen , Bintong Chen , Wei Qian , Jing Huang

Data regulations increasingly enable consumers to switch among market segments, making segmentation an endogenous outcome of strategic interaction. We study a model in which consumers choose segments before a monopolist sets…

Theoretical Economics · Economics 2026-05-14 Zhonghong Kuang , Sanxi Li , Yi Liu , Yang Yu

Inheritances, divorces or liquidations of companies require common assets to be divided among the entitled parties. Legal methods usually consider the market value of goods, while fair division theory takes into account the parties'…

Computer Science and Game Theory · Computer Science 2023-05-10 Marco Dall'Aglio

An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the…

Theoretical Economics · Economics 2020-08-27 Alex Suzdaltsev

We design online algorithms for the fair allocation of public goods to a set of $N$ agents over a sequence of $T$ rounds and focus on improving their performance using predictions. In the basic model, a public good arrives in each round,…

Computer Science and Game Theory · Computer Science 2022-10-03 Siddhartha Banerjee , Vasilis Gkatzelis , Safwan Hossain , Billy Jin , Evi Micha , Nisarg Shah

Problem definition: Traditional monopoly pricing assumes sellers have full information about consumer valuations. We consider monopoly pricing under limited information, where a seller only knows the mean, variance and support of the…

Optimization and Control · Mathematics 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

It is well-known that selling different goods in a single bundle can significantly increase revenue. However, bundling is no longer profitable if the goods have high production costs. To overcome this challenge, we introduce a new…

Computer Science and Game Theory · Computer Science 2021-02-23 Will Ma , David Simchi-Levi

Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-arrivals based on the remaining sets of items and buyers, and…

Computer Science and Game Theory · Computer Science 2022-04-27 Kristóf Bérczi , Erika R. Bérczi-Kovács , Evelin Szögi

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…

Computer Science and Game Theory · Computer Science 2024-10-11 Bo Sun , Hossein Nekouyan Jazi , Xiaoqi Tan , Raouf Boutaba

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…

Computer Science and Game Theory · Computer Science 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

In recent years, many new and interesting models of successful online business have been developed. Many of these are based on the competition between users, such as online auctions, where the product price is not fixed and tends to rise.…

Economics · Quantitative Finance 2016-03-01 Pierluigi Gallo , Francesco Randazzo , Ignazio Gallo

Consider a setting where selfish agents are to be assigned to coalitions or projects from a fixed set P. Each project k is characterized by a valuation function; v_k(S) is the value generated by a set S of agents working on project k. We…

Computer Science and Game Theory · Computer Science 2015-08-28 Elliot Anshelevich , Shreyas Sekar

We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

Computer Science and Game Theory · Computer Science 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang

A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive utilities across rounds. With $n$ symmetric agents, a natural…

Computer Science and Game Theory · Computer Science 2025-12-01 David X. Lin , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

Contextual dynamic pricing aims to set personalized prices based on sequential interactions with customers. At each time period, a customer who is interested in purchasing a product comes to the platform. The customer's valuation for the…

Machine Learning · Statistics 2023-03-07 Yiyun Luo , Will Wei Sun , and Yufeng Liu

We study the problem of a seller dynamically pricing $d$ distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply,…

Data Structures and Algorithms · Computer Science 2017-06-13 Aaron Roth , Aleksandrs Slivkins , Jonathan Ullman , Zhiwei Steven Wu

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

Computer Science and Game Theory · Computer Science 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang