Goto

Collaborating Authors

 South America









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

Neural Information Processing Systems

In this appendix, we include all the material missing from the main paper. Moreover, we restate a key result which connects random sampling and submodular maximization. The original version of the theorem was due to Feige et al. In fact, in what follows we exclusively use S and O for their final versions. Before stating the next lemma, let us introduce some notation for the sake of readability.



Counterbalancing Learning and Strategic Incentives in Allocation Markets

Neural Information Processing Systems

Motivated by the high discard rate of donated organs in the United States, we study an allocation problem in the presence of learning and strategic incentives. We consider a setting where a benevolent social planner decides whether and how to allocate a single indivisible object to a queue of strategic agents. The object has a common true quality, good or bad, which is ex-ante unknown to everyone. Each agent holds an informative, yet noisy, private signal about the quality.