| Publication | Date of Publication | Type |
|---|
Threshold testing and semi-online prophet inequalities
| 2025-01-06 | Paper |
Asynchronous opinion dynamics in social networks
Distributed Computing | 2024-09-10 | Paper |
Delegated online search
Artificial Intelligence | 2024-08-26 | Paper |
Satiation in Fisher markets and approximation of Nash social welfare
Mathematics of Operations Research | 2024-06-27 | Paper |
scientific article; zbMATH DE number 7788377 (Why is no real title available?)
| 2024-01-15 | Paper |
Stochastic Probing with Increasing Precision
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
Packing returning secretaries
Networks | 2023-12-11 | Paper |
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Seniorities and minimal clearing in financial network games
Algorithmic Game Theory | 2023-07-28 | Paper |
scientific article; zbMATH DE number 7650394 (Why is no real title available?)
| 2023-02-03 | Paper |
Algorithms for persuasion with limited communication
Mathematics of Operations Research | 2022-09-26 | Paper |
Fair Division of Indivisible Goods for a Class of Concave Valuations
Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
On fair division for indivisible items
| 2022-07-21 | Paper |
Packing returning secretaries
| 2022-07-21 | Paper |
The secretary recommendation problem
Games and Economic Behavior | 2022-07-15 | Paper |
When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores
| 2022-06-01 | Paper |
Efficient black-box reductions for separable cost sharing
| 2021-07-28 | Paper |
Efficient black-box reductions for separable cost sharing
Mathematics of Operations Research | 2021-06-03 | Paper |
Combinatorial secretary problems with ordinal information
| 2020-05-27 | Paper |
Secretary markets with local information
Distributed Computing | 2019-11-27 | Paper |
Ascending-price algorithms for unknown markets
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Opinion formation games with aggregation and negative influence
Theory of Computing Systems | 2019-09-05 | Paper |
Dynamics in matching and coalition formation games with structural constraints
Artificial Intelligence | 2019-01-18 | Paper |
Distributed selfish load balancing on networks
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Approximating the Nash social welfare with budget-additive valuations
| 2018-03-15 | Paper |
Computing equilibria in markets with budget-additive utilities
| 2018-03-02 | Paper |
On proportional allocation in hedonic games
| 2018-02-13 | Paper |
Earning limits in Fisher markets with spending-constraint utilities
| 2018-02-13 | Paper |
Opinion formation games with aggregation and negative influence
Algorithmic Game Theory | 2018-02-13 | Paper |
Stable matching with network externalities
Algorithmica | 2017-10-09 | Paper |
Distributed selfish load balancing on networks
| 2017-09-29 | Paper |
Truthful mechanism design via correlated tree rounding
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
Locally stable marriage with strict preferences
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
Smoothness for Simultaneous Composition of Mechanisms with Admission
Web and Internet Economics | 2017-02-10 | Paper |
Concurrent imitation dynamics in congestion games
Distributed Computing | 2016-05-23 | Paper |
Combinatorial auctions with conflict-based externalities
Web and Internet Economics | 2016-01-08 | Paper |
Secretary markets with local information
Automata, Languages, and Programming | 2015-11-04 | Paper |
Maintaining Near-Popular Matchings
Automata, Languages, and Programming | 2015-11-04 | Paper |
Ultra-fast load balancing on scale-free networks
Automata, Languages, and Programming | 2015-11-04 | Paper |
Tradeoffs and average-case equilibria in selfish routing
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Designing profit shares in matching and coalition formation games
Web and Internet Economics | 2015-01-12 | Paper |
Matching Dynamics with Constraints
Web and Internet Economics | 2015-01-07 | Paper |
Online capacity maximization in wireless networks
Journal of Scheduling | 2014-08-18 | Paper |
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Jamming-resistant learning in wireless networks
Automata, Languages, and Programming | 2014-07-01 | Paper |
Online independent set beyond the worst-case: secretaries, prophets, and periods
Automata, Languages, and Programming | 2014-07-01 | Paper |
Computing pure Nash and strong equilibria in bottleneck congestion games
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
On the complexity of Pareto-optimal Nash and strong equilibria
Theory of Computing Systems | 2013-10-21 | Paper |
Friendship and stable matching
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Locally stable marriage with strict preferences
Lecture Notes in Computer Science | 2013-08-07 | Paper |
Local matching dynamics in social networks
Information and Computation | 2013-06-06 | Paper |
Stackelberg network pricing games
| 2013-03-19 | Paper |
Strategic cooperation in cost sharing games
International Journal of Game Theory | 2013-03-04 | Paper |
Dynamics in network interaction games
Distributed Computing | 2013-02-04 | Paper |
On Stackelberg pricing with computationally bounded customers
Networks | 2012-11-15 | Paper |
Stackelberg network pricing games
Algorithmica | 2012-04-26 | Paper |
Contribution games in networks
Algorithmica | 2012-04-26 | Paper |
Distributed algorithms for QoS load balancing
Distributed Computing | 2012-02-06 | Paper |
Competitive routing over time
Theoretical Computer Science | 2011-10-10 | Paper |
Local matching dynamics in social networks
Automata, Languages and Programming | 2011-07-07 | Paper |
Convergence time of power-control dynamics
Automata, Languages and Programming | 2011-07-07 | Paper |
Competitive cost sharing with economies of scale
Algorithmica | 2011-07-01 | Paper |
On the complexity of Pareto-optimal Nash and strong equilibria
Algorithmic Game Theory | 2010-10-19 | Paper |
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Contribution Games in Social Networks
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Non-cooperative facility location and covering games
Theoretical Computer Science | 2010-04-15 | Paper |
Doing good with spam is hard
Algorithmic Game Theory | 2009-12-01 | Paper |
Dynamics in Network Interaction Games
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Altruism in Atomic Congestion Games
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Non-cooperative tree creation
Algorithmica | 2009-05-13 | Paper |
Tradeoffs and Average-Case Equilibria in Selfish Routing
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On Finding Graph Clusterings with Maximum Modularity
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
The Influence of Link Restrictions on (Random) Selfish Routing
Algorithmic Game Theory | 2008-05-02 | Paper |
Non-cooperative Facility Location and Covering Games
Algorithms and Computation | 2008-04-24 | Paper |
Competitive Cost Sharing with Economies of Scale
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Non-cooperative Tree Creation
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 1982184 (Why is no real title available?)
| 2003-09-16 | Paper |
