| A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching | 0 | 0.34 | 2022 |
| Decentralized Update Selection with Semi-strategic Experts | 0 | 0.34 | 2022 |
| Fair Division of Indivisible Goods: A Survey. | 0 | 0.34 | 2022 |
| Fair Division of Indivisible Goods: A Survey | 0 | 0.34 | 2022 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint | 0 | 0.34 | 2022 |
| RAPID MIXING OF THE SWITCH MARKOV CHAIN FOR 2-CLASS JOINT DEGREE MATRICES | 0 | 0.34 | 2022 |
| A Few Queries Go A Long Way: Information-Distortion Tradeoffs In Matching | 0 | 0.34 | 2021 |
| Maximum Nash Welfare And Other Stories About Efx | 0 | 0.34 | 2021 |
| Submodular Maximization Subject To A Knapsack Constraint: Combinatorial Algorithms With Near-Optimal Adaptive Complexity | 0 | 0.34 | 2021 |
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness | 0 | 0.34 | 2021 |
| Inequity Aversion Pricing Over Social Networks: Approximation Algorithms And Hardness Results | 0 | 0.34 | 2021 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint | 0 | 0.34 | 2020 |
| Maximum Nash Welfare and Other Stories About EFX | 0 | 0.34 | 2020 |
| A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint | 0 | 0.34 | 2020 |
| Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination | 0 | 0.34 | 2020 |
| Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. | 0 | 0.34 | 2019 |
| Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online. | 0 | 0.34 | 2019 |
| Connected realizations of joint-degree matrices. | 0 | 0.34 | 2018 |
| Comparing Approximate Relaxations of Envy-Freeness. | 1 | 0.36 | 2018 |
| An Improved Envy-Free Cake Cutting Protocol for Four Agents. | 2 | 0.38 | 2018 |
| Rapid mixing of the switch Markov chain for strongly stable degree sequences | 1 | 0.35 | 2018 |
| Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness. | 4 | 0.45 | 2017 |
| On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. | 1 | 0.37 | 2017 |
| Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. | 2 | 0.39 | 2016 |
| Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. | 0 | 0.34 | 2016 |
| On Truthful Mechanisms for Maximin Share Allocations. | 6 | 0.51 | 2016 |
| Graphic Realizations of Joint-Degree Matrices | 0 | 0.34 | 2015 |
| Approximation Algorithms for Computing Maximin Share Allocations. | 24 | 1.19 | 2015 |
| Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability | 8 | 0.53 | 2015 |
| Provably-secure schemes for basic query support in outsourced databases | 37 | 2.03 | 2007 |
