| Public Signals in Network Congestion Games | 0 | 0.34 | 2022 |
| Seniorities and Minimal Clearing in Financial Network Games | 0 | 0.34 | 2022 |
| The secretary recommendation problem | 0 | 0.34 | 2022 |
| Asynchronous Opinion Dynamics in Social Networks. | 0 | 0.34 | 2022 |
| Fair Division of Indivisible Goods for a Class of Concave Valuations | 0 | 0.34 | 2022 |
| Maximizing Nash Social Welfare in 2-Value Instances. | 0 | 0.34 | 2022 |
| Efficient Black-Box Reductions For Separable Cost Sharing | 0 | 0.34 | 2021 |
| Algorithms for Persuasion with Limited Communication | 0 | 0.34 | 2021 |
| Stochastic Probing with Increasing Precision. | 0 | 0.34 | 2021 |
| Algorithmic Persuasion with Evidence | 0 | 0.34 | 2021 |
| When Dividing Mixed Manna Is Easier Than Dividing Goods - Competitive Equilibria with a Constant Number of Chores. | 0 | 0.34 | 2021 |
| Strategic Payments in Financial Networks. | 0 | 0.34 | 2020 |
| Prophet Inequalities for Bayesian Persuasion | 0 | 0.34 | 2020 |
| Web and Internet Economics - 16th International Conference, WINE 2020, Beijing, China, December 7-11, 2020, Proceedings | 0 | 0.34 | 2020 |
| Earning and Utility Limits in Fisher Markets. | 0 | 0.34 | 2019 |
| Packing Returning Secretaries. | 0 | 0.34 | 2018 |
| Approximating the Nash Social Welfare with Budget-Additive Valuations. | 2 | 0.39 | 2018 |
| Dynamics in matching and coalition formation games with structural constraints. | 1 | 0.37 | 2018 |
| On Fair Division for Indivisible Items. | 0 | 0.34 | 2018 |
| On Fair Division of Indivisible Items. | 0 | 0.34 | 2018 |
| Efficient Black-Box Reductions for Separable Cost Sharing. | 0 | 0.34 | 2018 |
| Tracing Equilibrium in Dynamic Markets via Distributed Adaptation | 0 | 0.34 | 2018 |
| Stable Matching with Network Externalities. | 1 | 0.35 | 2017 |
| Combinatorial Secretary Problems with Ordinal Information. | 2 | 0.37 | 2017 |
| Earning Limits in Fisher Markets with Spending-Constraint Utilities. | 2 | 0.40 | 2017 |
| On Proportional Allocation in Hedonic Games. | 1 | 0.36 | 2017 |
| Opinion Formation Games with Aggregation and Negative Influence. | 1 | 0.36 | 2017 |
| Ascending-Price Algorithms for Unknown Markets | 1 | 0.36 | 2016 |
| Preface to Special Issue on Algorithmic Game Theory. | 0 | 0.34 | 2016 |
| Computing Equilibria in Markets with Budget-Additive Utilities. | 2 | 0.39 | 2016 |
| Learning Market Parameters Using Aggregate Demand Queries. | 0 | 0.34 | 2016 |
| Ultra-fast Load Balancing on Scale-free Networks | 0 | 0.34 | 2015 |
| Combinatorial Auctions with Conflict-Based Externalities | 0 | 0.34 | 2015 |
| Smoothness for Simultaneous Composition of Mechanisms with Admission | 0 | 0.34 | 2015 |
| Hedonic Coalition Formation In Networks | 7 | 0.49 | 2015 |
| Tatonnement for Linear and Gross Substitutes Markets | 1 | 0.36 | 2015 |
| Secretary Markets with Local Information | 0 | 0.34 | 2015 |
| Truthful Mechanism Design via Correlated Tree Rounding | 2 | 0.36 | 2015 |
| Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. | 3 | 0.39 | 2014 |
| On the Complexity of Pareto-Optimal Nash and Strong Equilibria. | 0 | 0.34 | 2013 |
| Brief announcement: threshold load balancing in networks | 3 | 0.53 | 2013 |
| Designing Profit Shares in Matching and Coalition Formation Games. | 4 | 0.42 | 2013 |
| Locally stable marriage with strict preferences | 6 | 0.44 | 2013 |
| Friendship and Stable Matching. | 2 | 0.38 | 2013 |
| Truthfulness and stochastic dominance with monetary transfers | 3 | 0.39 | 2013 |
| Jamming-Resistant Learning in Wireless Networks. | 7 | 0.44 | 2013 |
| Threshold Load Balancing in Networks. | 2 | 0.38 | 2013 |
| Sleeping Experts In Wireless Networks | 3 | 0.37 | 2013 |
| Routing games with progressive filling. | 3 | 0.41 | 2013 |
| Universally Truthful Secondary Spectrum Auctions | 1 | 0.37 | 2013 |
