English
Related papers

Related papers: Predict and Match: Prophet Inequalities with Uncer…

200 papers

We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability.…

Computer Science and Game Theory · Computer Science 2021-09-08 Xiaohui Bei , Xinhang Lu , Pasin Manurangsi , Warut Suksompong

Forecasting accuracy is bounded by the information available about the future. This paper makes that statement precise using information-theoretic tools. Under logarithmic loss, the expected performance of any probabilistic forecast…

Applications · Statistics 2026-04-01 Peter Maurice Catt

In this work, we revisit the problem of fairly allocating a number of indivisible items that are located on a line to multiple agents. A feasible allocation requires that the allocated items to each agent are connected on the line. The…

Computer Science and Game Theory · Computer Science 2022-05-24 Ankang Sun , Bo Li

We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous…

Machine Learning · Computer Science 2020-08-07 Ramesh Johari , Vijay Kamble , Yash Kanoria

In fair division, equitability dictates that each participant receives the same level of utility. In this work, we study equitable allocations of indivisible goods among agents with additive valuations. While prior work has studied…

Computer Science and Game Theory · Computer Science 2019-05-28 Rupert Freeman , Sujoy Sikdar , Rohit Vaish , Lirong Xia

We study the online metric matching problem. There are $m$ servers and $n$ requests located in a metric space, where all servers are available upfront and requests arrive one at a time. Upon the arrival of a new request, it needs to be…

Data Structures and Algorithms · Computer Science 2025-10-16 Mingwei Yang , Sophie H. Yu

Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \textit{equitability up to one item} (EQ1) and focus on the…

Computer Science and Game Theory · Computer Science 2025-08-22 Hadi Hosseini , Aditi Sethia

This paper addresses the problem of managing perishable inventory under multiple sources of uncertainty, including stochastic demand, unreliable supplier fulfillment, and probabilistic product shelf life. We develop a discrete-event…

Neural and Evolutionary Computing · Computer Science 2025-11-04 Leonardo Kanashiro Felizardo , Edoardo Fadda , Mariá Cristina Vasconcelos Nascimento

In this paper we study the problem of information sharing among rational self-interested agents as a dynamic game of asymmetric information. We assume that the agents imperfectly observe a Markov chain and they are called to decide whether…

Computer Science and Game Theory · Computer Science 2021-03-30 Konstantinos Ntemos , George Pikramenos , Nicholas Kalouptsidis

In many realistic problems of allocating resources, economy efficiency must be taken into consideration together with social equality, and price rigidities are often made according to some economic and social needs. We study the…

Computer Science and Game Theory · Computer Science 2014-05-27 Wei Huang , Jian Lou , Zhonghua Wen

Newsvendor problem is an extensively researched topic in inventory management. In this class of inventory problems, shortage and excess costs are considered to be proportional to the quantity lost. But, for critical goods or commodities,…

Applications · Statistics 2020-07-09 Soham Ghosh , Mamta Sahare , Sujay Mukhoti

This work introduces \emph{sharding} and \emph{Poissonization} as a unified framework for analyzing prophet inequalities. Sharding involves splitting a random variable into several independent random variables, shards, that collectively…

Data Structures and Algorithms · Computer Science 2024-04-05 Elfarouk Harb

We study competitive equilibrium in the canonical Fisher market model, but with indivisible goods. In this model, every agent has a budget of artificial currency with which to purchase bundles of goods. Equilibrium prices match between…

Computer Science and Game Theory · Computer Science 2019-11-25 Moshe Babaioff , Noam Nisan , Inbal Talgam-Cohen

This paper studies an open question in the warehouse problem where a merchant trading a commodity tries to find an optimal inventory-trading policy to decide on purchase and sale quantities during a fixed time horizon in order to maximize…

Data Structures and Algorithms · Computer Science 2023-02-24 Ishan Bansal , Oktay Günlük

We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would…

Computer Science and Game Theory · Computer Science 2018-06-12 Georgios Amanatidis , Evangelos Markakis , Afshin Nikzad , Amin Saberi

Selling a perfectly divisible item to potential buyers is a fundamental task with apparent applications to pricing communication bandwidth and cloud computing services. Surprisingly, despite the rich literature on single-item auctions,…

Computer Science and Game Theory · Computer Science 2025-02-11 Ioannis Caragiannis , Zhile Jiang , Apostolis Kerentzis

Motivated by recent progress on pricing in the AI literature, we study marketplaces that contain multiple vendors offering identical or similar products and unit-demand buyers with different valuations on these vendors. The objective of…

We study prior-independent pricing for selling a single item to a single buyer when the seller observes only a single sample from the valuation distribution, while the buyer knows the distribution. Classical robust pricing approaches either…

Computer Science and Game Theory · Computer Science 2026-02-23 Zhihao Gavin Tang , Yixin Tao , Shixin Wang

Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stopping time problems where random variables get revealed…

Data Structures and Algorithms · Computer Science 2025-07-15 Moran Feldman , Ola Svensson , Rico Zenklusen

In the envy-free perfect matching problem, $n$ items with unit supply are available to be sold to $n$ buyers with unit demand. The objective is to find allocation and prices such that both seller's revenue and buyers' surpluses are…

Computer Science and Game Theory · Computer Science 2023-08-25 Marcos Salvatierra
‹ Prev 1 8 9 10 Next ›