| Publication | Date of Publication | Type |
|---|
| Online budget-feasible mechanism design with predictions | 2026-02-27 | Paper |
The ground-set-cost budgeted maximum coverage problem
Theory of Computing Systems | 2026-01-02 | Paper |
| Round and bipartize for vertex cover approximation | 2025-01-14 | Paper |
| Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents | 2024-09-20 | Paper |
Budget feasible mechanisms for procurement auctions with divisible agents
Algorithmic Game Theory | 2023-07-28 | Paper |
Budget feasible mechanisms for procurement auctions with divisible agents
Algorithmic Game Theory | 2023-07-28 | Paper |
Greater flexibility in mechanism design through altruism
Algorithmic Game Theory | 2023-07-28 | Paper |
| Approximate pricing in networks: How to boost the betweenness and revenue of a node | 2023-02-03 | Paper |
| The traveling \(k\)-median problem: approximating optimal network coverage | 2022-10-19 | Paper |
Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
Mathematics of Operations Research | 2022-09-26 | Paper |
Cost sharing over combinatorial domains : Complement-free cost functions and beyond
(available as arXiv preprint) | 2022-05-11 | Paper |
Maximum coverage with cluster constraints: an LP-based approximation technique
(available as arXiv preprint) | 2022-03-22 | Paper |
| Maximum coverage with cluster constraints: an LP-based approximation technique | 2022-03-22 | Paper |
Computation and efficiency of potential function minimizers of combinatorial congestion games
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique
(available as arXiv preprint) | 2020-12-08 | Paper |
Topological price of anarchy bounds for clustering games on networks
(available as arXiv preprint) | 2020-06-30 | Paper |
| Topological price of anarchy bounds for clustering games on networks | 2020-06-30 | Paper |
The median routing problem for simultaneous planning of emergency response and non-emergency jobs
European Journal of Operational Research | 2020-05-27 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Theory of Computing Systems | 2019-03-21 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Theoretical Computer Science | 2018-12-04 | Paper |
| scientific article; zbMATH DE number 6851883 (Why is no real title available?) | 2018-03-21 | Paper |
Path deviations outperform approximate stability in heterogeneous congestion games
(available as arXiv preprint) | 2018-02-13 | Paper |
Coordination games on graphs
International Journal of Game Theory | 2017-11-10 | Paper |
Coordination games on graphs
International Journal of Game Theory | 2017-11-10 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| Computing optimal tolls with arc restrictions and heterogeneous players | 2017-03-03 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Algorithmic Game Theory | 2016-09-29 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Algorithmic Game Theory | 2016-09-29 | Paper |
The strong price of anarchy of linear bottleneck congestion games
Theory of Computing Systems | 2016-01-28 | Paper |
Inefficiency of games with social context
Theory of Computing Systems | 2016-01-13 | Paper |
Efficient equilibria in polymatrix coordination games
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Efficient cost-sharing mechanisms for prize-collecting problems
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Mechanisms for Hiring a Matroid Base without Money
Algorithmic Game Theory | 2015-01-14 | Paper |
Bounding the inefficiency of altruism through social contribution games
Web and Internet Economics | 2015-01-12 | Paper |
Coordination games on graphs (extended abstract)
Web and Internet Economics | 2015-01-07 | Paper |
| An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem | 2014-12-18 | Paper |
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| A group-strategyproof mechanism for Steiner forests | 2014-10-13 | Paper |
Inefficiency of games with social context
Algorithmic Game Theory | 2013-10-23 | Paper |
Inefficiency of standard multi-unit auctions
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Selfishness level of strategic games
Algorithmic Game Theory | 2013-03-13 | Paper |
| On the smoothed price of anarchy of the traffic assignment problem | 2012-09-28 | Paper |
Finding social optima in congestion games with positive externalities
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Efficiency of restricted tolls in non-atomic network routing games
Algorithmic Game Theory | 2011-10-28 | Paper |
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research | 2011-04-27 | Paper |
Strict cost sharing schemes for Steiner forest
SIAM Journal on Computing | 2011-04-04 | Paper |
On the inefficiency of equilibria in linear bottleneck congestion games
Algorithmic Game Theory | 2010-10-19 | Paper |
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences | 2010-10-07 | Paper |
| scientific article; zbMATH DE number 5764866 (Why is no real title available?) | 2010-08-06 | Paper |
Online cooperative cost sharing
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
SIAM Journal on Computing | 2008-10-28 | Paper |
Solutions to Real-World Instances of PSPACE-Complete Stacking
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science | 2008-07-31 | Paper |
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research | 2008-05-27 | Paper |
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
Algorithmic Game Theory | 2008-05-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Cost Sharing Methods for Makespan and Completion Time Scheduling
STACS 2007 | 2007-09-03 | Paper |
Matching algorithms are fast in sparse random graphs
Theory of Computing Systems | 2006-10-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science | 2005-09-22 | Paper |
Implementation of <i>O</i> ( <i>nm</i> log <i>n</i> ) weighted matchings in general graphs
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science | 2005-01-11 | Paper |
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1877048 (Why is no real title available?) | 2003-04-03 | Paper |
