Guido Schäfer

Artem Tsikiridis

CoRR, 2024

2023

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Round and Bipartize for Vertex Cover Approximation.

[BibT_eX]

[DOI]

Danish Kashaev

Proceedings of the Approximation, 2023

2022

Cost Sharing over Combinatorial Domains.

[BibT_eX]

[DOI]

Georgios Birmpas

Evangelos Markakis

ACM Trans. Economics and Comput., 2022

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online.

[BibT_eX]

[DOI]

Georgios Amanatidis

Math. Oper. Res., 2022

A Round and Bipartize Approximation Algorithm for Vertex Cover.

[BibT_eX]

[DOI]

Danish Kashaev

CoRR, 2022

The enriched median routing problem and its usefulness in practice.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2022

Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents.

[BibT_eX]

[DOI]

Sophie Klumper

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Greater Flexibility in Mechanism Design Through Altruism.

[BibT_eX]

[DOI]

Ruben Brokkelkamp

Sjir Hoeijmakers

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions.

[BibT_eX]

[DOI]

Andries van Beek

Ruben Brokkelkamp

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Computation and efficiency of potential function minimizers of combinatorial congestion games.

[BibT_eX]

[DOI]

Math. Program., 2021

Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm.

[BibT_eX]

[DOI]

Willem Feijen

CoRR, 2021

Capturing Corruption with Hybrid Auctions: Social Welfare Loss in Multi-Unit Auctions.

[BibT_eX]

[DOI]

Andries van Beek

Ruben Brokkelkamp

CoRR, 2021

The Traveling k-Median Problem: Approximating Optimal Network Coverage.

[BibT_eX]

[DOI]

Dylan Huizing

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020

The median routing problem for simultaneous planning of emergency response and non-emergency jobs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique.

[BibT_eX]

[DOI]

Bernard G. Zweers

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

2019

Tight inefficiency bounds for perception-parameterized affine congestion games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Topological Price of Anarchy Bounds for Clustering Games on Networks.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond.

[BibT_eX]

[DOI]

Georgios Birmpas

Evangelos Markakis

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

On Fair Cost Facility Location Games with Non-singleton Players.

[BibT_eX]

[DOI]

Félix Carvalho Rodrigues

Eduardo C. Xavier

Proceedings of the XLIV Latin American Computer Conference - Selected Papers, 2018

On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games.

[BibT_eX]

[DOI]

Félix Carvalho Rodrigues

Eduardo C. Xavier

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

The Curse of Ties in Congestion Games with Limited Lookahead.

[BibT_eX]

[DOI]

Carla Groenland

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Coordination games on graphs.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2017

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Steiner Forest.

[BibT_eX]

[DOI]

Irving van Heuven van Staereling

Encyclopedia of Algorithms, 2016

The Ground-Set-Cost Budgeted Maximum Coverage Problem.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

The Strong Price of Anarchy of Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Orestis Telelis

Theory Comput. Syst., 2015

Inefficiency of Games with Social Context.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Efficient cost-sharing mechanisms for prize-collecting problems.

[BibT_eX]

[DOI]

Math. Program., 2015

Coordination Games on Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Efficient Equilibria in Polymatrix Coordination Games.

[BibT_eX]

[DOI]

Mona Rahn

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Budgeted Matching via the Gasoline Puzzle.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

Altruism and Its Impact on the Price of Anarchy.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Selfishness Level of Strategic Games.

[BibT_eX]

[DOI]

Krzysztof R. Apt

J. Artif. Intell. Res., 2014

Coordination Games on Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players.

[BibT_eX]

[DOI]

Tomas Jelinek

Marcus Klaas

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Mechanisms for Hiring a Matroid Base without Money.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

2013

Bounding the Inefficiency of Altruism through Social Contribution Games.

[BibT_eX]

[DOI]

Mona Rahn

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Inefficiency of Standard Multi-unit Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Finding Social Optima in Congestion Games with Positive Externalities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Budgeted matching and budgeted matroid intersection via the gasoline puzzle.

[BibT_eX]

[DOI]

Math. Program., 2011

The Robust Price of Anarchy of Altruistic Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Efficiency of Restricted Tolls in Non-atomic Network Routing Games.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Mahyar Salek

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

On the Smoothed Price of Anarchy of the Traffic Assignment Problem.

[BibT_eX]

[DOI]

Luciana S. Buriol

Marcus Ritt

Félix Carvalho Rodrigues

Proceedings of the ATMOS 2011, 2011

2010

Strict Cost Sharing Schemes for Steiner Forest.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Stackelberg Routing in Arbitrary Networks.

[BibT_eX]

[DOI]

Vincenzo Bonifaci

Tobias Harks

Math. Oper. Res., 2010

Connected facility location via random facility sampling and core detouring.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games.

[BibT_eX]

[DOI]

Orestis Telelis

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Online Cooperative Cost Sharing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2008

Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game.

[BibT_eX]

[DOI]

Jochen Könemann

Stefan H. M. van Zwam

SIAM J. Comput., 2008

Approximating connected facility location problems via random facility sampling and core detouring.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Cost Sharing Methods for Makespan and Completion Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Solutions to Real-World Instances of PSPACE-Complete Stacking.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Matching Algorithms Are Fast in Sparse Random Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.

[BibT_eX]

[DOI]

Luca Becchetti

Alberto Marchetti-Spaccamela

Tjark Vredeveld

Math. Oper. Res., 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

Topology matters: Smoothed competitiveness of metrical task systems.

[BibT_eX]

[DOI]

Naveen Sivadasan

Theor. Comput. Sci., 2005

A group-strategyproof mechanism for Steiner forests.

[BibT_eX]

[DOI]

Jochen Könemann

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.

[BibT_eX]

[DOI]

Jochen Könemann

Stefan H. M. van Zwam

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.

[BibT_eX]

[DOI]

Luca Becchetti

Alberto Marchetti-Spaccamela

Tjark Vredeveld

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

Worst case instances are fragile: average case and smoothed competitive analysis of algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2004

Cross-monotonic cost sharing methods for connected facility location games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.

[BibT_eX]

[DOI]

Hannah Bast

Algorithmica, 2003

Scheduling to Minimize Flow Time Metrics.

[BibT_eX]

[DOI]

Luca Becchetti

Alberto Marchetti-Spaccamela

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002

Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2002

All-pairs shortest-paths computation in the presence of negative cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.

[BibT_eX]

[DOI]