Search Results for author:
Found 5 papers, 0 papers with code
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
For Round-Robin we show that all of its pure Nash equilibria induce allocations that are EF1 with respect to the underlying true values, while for the algorithm of Plaut and Roughgarden we show that the corresponding allocations not only are EFX but also satisfy maximin share fairness, something that is not true for this algorithm in the non-strategic setting!
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
In the weighted bipartite matching problem, the goal is to find a maximum-weight matching in a bipartite graph with nonnegative edge weights.
Computer Science and Game Theory
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Submodular maximization is a classic algorithmic problem with multiple applications in data mining and machine learning; there, the growing need to deal with massive instances motivates the design of algorithms balancing the quality of the solution with applicability.
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing.
Trend Detection based Regret Minimization for Bandit Problems
In this paper, we study this problem when the losses of the actions also satisfy certain structural properties, and especially, do show a trend structure.
