| Publication | Date of Publication | Type |
|---|
Improved approximation algorithms for the expanding search problem
| 2025-01-06 | Paper |
Incremental maximization via continuization
| 2024-11-14 | Paper |
Maximizing a submodular function with bounded curvature under an unknown knapsack constraint
| 2024-08-22 | Paper |
Competitive strategies for symmetric rendezvous on the line
| 2024-07-19 | Paper |
The polyhedral geometry of truthful auctions
| 2024-06-19 | Dataset |
Impartial selection with additive guarantees via iterated deletion
Games and Economic Behavior | 2024-04-30 | Paper |
Reduction of Potential-Based Flow Networks
Mathematics of Operations Research | 2024-03-01 | Paper |
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
SIAM Journal on Discrete Mathematics | 2024-02-27 | Paper |
The polyhedral geometry of truthful auctions
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Optimal impartial correspondences
Web and Internet Economics | 2023-08-04 | Paper |
Generalized Permutahedra and Optimal Auctions
SIAM Journal on Applied Algebra and Geometry | 2023-04-11 | Paper |
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium
Optimization Methods & Software | 2023-03-15 | Paper |
On the robustness of potential-based flow networks
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Equilibria in Multiclass and Multidimensional Atomic Congestion Games
Mathematics of Operations Research | 2023-01-09 | Paper |
Fractionally subadditive maximization under an incremental knapsack constraint
| 2022-10-19 | Paper |
Packing under convex quadratic constraints
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Parametric computation of minimum-cost flows with piecewise quadratic costs
Mathematics of Operations Research | 2022-05-17 | Paper |
Packing under convex quadratic constraints
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Pure Nash Equilibria in Resource Graph Games
Journal of Artificial Intelligence Research | 2022-02-07 | Paper |
Generalized permutahedra and optimal auctions
| 2021-08-02 | Paper |
Demand-independent optimal tolls
| 2021-07-28 | Paper |
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
| 2021-06-28 | Paper |
Distance-Preserving Graph Contractions
| 2021-06-15 | Paper |
Nobel, Milgrom and Wilson
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2021-06-11 | Paper |
Travelling on graphs with small highway dimension
Algorithmica | 2021-04-19 | Paper |
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hiring secretaries over time: the benefit of concurrent employment
Mathematics of Operations Research | 2020-04-30 | Paper |
Broadcasting a file in a communication network
Journal of Scheduling | 2020-04-22 | Paper |
Travelling on graphs with small highway dimension
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Tight bounds for undirected graph exploration with pebbles and multiple agents
Journal of the ACM | 2020-02-11 | Paper |
Greedy metric minimum online matchings with random arrivals
Operations Research Letters | 2020-02-10 | Paper |
The online best reply algorithm for resource allocation problems
| 2020-02-04 | Paper |
Computing all Wardrop equilibria parametrized by the flow demand
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Distance-Preserving Graph Contractions
SIAM Journal on Discrete Mathematics | 2019-09-06 | Paper |
Bottleneck routing with elastic demands
Operations Research Letters | 2019-06-11 | Paper |
Sensitivity analysis for convex separable optimization over integral polymatroids
SIAM Journal on Optimization | 2018-08-21 | Paper |
Undirected Graph Exploration with ⊝(log log n) Pebbles
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computing network tolls with support constraints
Networks | 2018-05-23 | Paper |
Complexity and approximation of the continuous network design problem
SIAM Journal on Optimization | 2017-08-16 | Paper |
Packing a knapsack of unknown capacity
SIAM Journal on Discrete Mathematics | 2017-07-14 | Paper |
Approximate pure Nash equilibria in weighted congestion games
| 2017-03-22 | Paper |
Complexity and Approximation of the Continuous Network Design Problem
| 2017-03-22 | Paper |
Packing a knapsack of unknown capacity
| 2017-03-03 | Paper |
Efficiency of equilibria in uniform matroid congestion games
Algorithmic Game Theory | 2016-09-29 | Paper |
Congestion games with variable demands
Mathematics of Operations Research | 2016-04-15 | Paper |
Bottleneck routing with elastic demands
Web and Internet Economics | 2016-01-08 | Paper |
Impartial Selection and the Power of up to Two Choices
Web and Internet Economics | 2016-01-08 | Paper |
Equilibria in a class of aggregative location games
Journal of Mathematical Economics | 2015-12-18 | Paper |
Optimal impartial selection
SIAM Journal on Computing | 2015-11-04 | Paper |
Scheduling bidirectional traffic on a path
Automata, Languages, and Programming | 2015-10-27 | Paper |
Sharing non-anonymous costs of multiple resources optimally
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Multimarket oligopolies with restricted market access
Algorithmic Game Theory | 2015-01-14 | Paper |
Resource competition on integral polymatroids
Web and Internet Economics | 2015-01-07 | Paper |
Congestion games with higher demand dimensions
Web and Internet Economics | 2015-01-07 | Paper |
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
Theoretical Computer Science | 2014-12-02 | Paper |
On the existence of pure Nash equilibria in weighted congestion games
Mathematics of Operations Research | 2014-10-21 | Paper |
Computing pure Nash and strong equilibria in bottleneck congestion games
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Congestion games with player-specific costs revisited
Algorithmic Game Theory | 2013-10-23 | Paper |
Strong equilibria in games with the lexicographical improvement property
International Journal of Game Theory | 2013-06-26 | Paper |
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Optimal file distribution in peer-to-peer networks
Algorithms and Computation | 2011-12-16 | Paper |
Characterizing the existence of potential functions in weighted congestion games
Theory of Computing Systems | 2011-11-23 | Paper |
On the existence of pure Nash equilibria in weighted congestion games
Automata, Languages and Programming | 2010-09-07 | Paper |
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Characterizing the existence of potential functions in weighted congestion games
Algorithmic Game Theory | 2009-12-01 | Paper |
