![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Fair Division with Allocator’s Preference
We consider the problem of fairly allocating indivisible resources to agents, which has been studied for years. Most previous work focuses on fairness and/or efficiency among agents given agents’ preferences. How...
-
Chapter and Conference Paper
EFX Under Budget Constraint
Fair division captures many real-world scenarios and plays an important role in many research fields including computer science, economy, operations research, etc. For the problem of indivisible goods allocati...
-
Chapter and Conference Paper
A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem
Team formation in social networks has attracted much attention due to its many applications such as the online labour market. In this paper, we focus on the problem of forming multiple teams of experts with di...
-
Chapter and Conference Paper
Optimal Algorithms for Running Max and Min Filters on Random Inputs
Given a d-dimensional array and an integer p, the max (or min) filter is the set of maximum (or minimum) elements within a d-dimensional sliding window of edge length p inside the array. The current best algorith...