Search Results for author:
Found 2 papers, 1 papers with code
Time Fairness in Online Knapsack Problems
We propose a parameterized deterministic algorithm where the parameter precisely captures the Pareto-optimal trade-off between fairness (static pricing) and competitiveness (dynamic pricing).
Graphical House Allocation
The classical house allocation problem involves assigning $n$ houses (or items) to $n$ agents according to their preferences.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
