research
∙
08/22/2023
Towards Optimal Subsidy Bounds for Envy-freeable Allocations
We study the fair division of indivisible items with subsidies among n a...
share
research
∙
08/18/2023
The Last Success Problem with a Single Sample
The last success problem is an optimal stopping problem that aims to max...
research
∙
06/09/2023
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
The fair allocation of mixed goods, consisting of both divisible and ind...
research
∙
05/15/2023
Size-stochastic Knapsack Online Contention Resolution Schemes
Online contention resolution schemes (OCRSs) are effective rounding tech...
research
∙
11/07/2022
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks
Network analysis has played a key role in knowledge discovery and data m...
research
∙
09/02/2022
Optimal design of lottery with cumulative prospect theory
A lottery is a popular form of gambling between a seller and multiple bu...
research
∙
08/16/2022
Random Assignment of Indivisible Goods under Constraints
We consider the problem of random assignment of indivisible goods, in wh...
research
∙
06/13/2022
Fair Division with Two-Sided Preferences
We study a fair division setting in which a number of players are to be ...
research
∙
11/14/2021
Online Max-min Fair Allocation
We study an online version of the max-min fair allocation problem for in...
research
∙
05/05/2021
Fair and Truthful Mechanism with Limited Subsidy
The notion of envy-freeness is a natural and intuitive fairness requirem...
research
∙
07/16/2020
Fair Ride Allocation on a Line
With the advent of the ride-sharing platform, the carpooling has become ...
research
∙
09/22/2019
Online Knapsack Problems with a Resource Buffer
In this paper, we introduce online knapsack problems with a resource buf...
research
∙
07/09/2019
Approximately Stable Matchings with General Constraints
This paper focuses on two-sided matching where one side (a hospital or f...
research
∙
06/14/2019
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising
Computational advertising has been studied to design efficient marketing...
research
∙
05/17/2019
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
Aggregating responses from crowd workers is a fundamental task in the pr...
research
∙
11/22/2018
Tight Approximation for Unconstrained XOS Maximization
A set function is called XOS if it can be represented by the maximum of ...
research
∙
06/30/2018
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
The parity of the length of paths and cycles is a classical and well-stu...
research
∙
05/20/2018
Randomized Strategies for Robust Combinatorial Optimization
In this paper, we study the following robust optimization problem. Given...
research
∙
04/27/2018
Subgame Perfect Equilibria of Sequential Matching Games
We study a decentralized matching market in which firms sequentially mak...
research
∙
04/27/2018
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game
We study a decentralized matching market in which each firm sequentially...
research
∙
03/07/2018
Submodular maximization with uncertain knapsack capacity
We consider the maximization problem of monotone submodular functions un...
research
∙
11/17/2017