Picture for Philip Lazos

Philip Lazos

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

Add code
Sep 17, 2021
Viaarxiv icon

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

Add code
Feb 16, 2021
Figure 1 for Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Figure 2 for Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Viaarxiv icon

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Add code
Jul 09, 2020
Figure 1 for Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Viaarxiv icon