Berthold Vöcking

Games Econ. Behav., 2019

2018

Primal Beats Dual on Online Packing LPs in the Random-Order Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

2017

Truthful mechanism design via correlated tree rounding.

[BibT_eX]

[DOI]

Yossi Azar

Idan Maor

Rebecca Reiffenhäuser

Math. Program., 2017

2016

Utilitarian Mechanism Design for Single-Minded Agents.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Price of Anarchy for Machines Models.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Truthfulness and Stochastic Dominance with Monetary Transfers.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

2014

Approximation Algorithms for Secondary Spectrum Auctions.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2014

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Thorp Shuffling, Butterflies, and Non-Markovian Couplings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Optimized buffer allocation in multicore platforms.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2014

2013

Economical Caching.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2013

Electronic Markets and Auctions (Dagstuhl Seminar 13461).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Computing approximate Nash equilibria in network congestion games.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Networks, 2012

Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization.

[BibT_eX]

[DOI]

Marcel Ochel

Klaus Radke

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Online Mechanism Design (Randomized Rounding on the Fly).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Scheduling and Power Assignments in the Physical Model.

[BibT_eX]

[DOI]

Alexander Fanghänel

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Improved algorithms for latency minimization in wireless networks.

[BibT_eX]

[DOI]

Alexander Fanghänel

Theor. Comput. Sci., 2011

Approximation Techniques for Utilitarian Mechanism Design.

[BibT_eX]

[DOI]

Patrick Briest

SIAM J. Comput., 2011

Uncoordinated Two-Sided Matching Markets.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Considerate Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

The Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods.

[BibT_eX]

[DOI]

Harald Räcke

SIAM J. Comput., 2010

Selfish Traffic Allocation for Server Farms.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Berechnung von Nash-Gleichgewichten.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.

[BibT_eX]

[DOI]

Melanie Winkler

Sascha Geulen

Electron. Colloquium Comput. Complex., 2010

Online Capacity Maximization in Wireless Networks.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Distributed Contention Resolution in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: distributed contention resolution in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

10211 Abstracts Collection - Flexible Network Design.

[BibT_eX]

[DOI]

Proceedings of the Flexible Network Design, 24.05. - 28.05.2010, 2010

2009

Adaptive routing with stale information.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Pure Nash equilibria in player-specific and weighted congestion games.

[BibT_eX]

[DOI]

Heiner Ackermann

Theor. Comput. Sci., 2009

Economical Caching with Stochastic Prices.

[BibT_eX]

[DOI]

Melanie Winkler

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

Oblivious interference scheduling.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Congestion games: Equilibria, convergence and complexity.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Game Theory for Networks, 2009

Approximability of OFDMA Scheduling.

[BibT_eX]

[DOI]

Marcel Ochel

Proceedings of the Algorithms, 2009

Management of Variable Data Streams in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Utilitarian Mechanism Design for Single-Minded Agents.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Price of Anarchy for Machines Models.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Das Rucksackproblem.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

A Unified Approach to Congestion Games and Two-Sided Markets.

[BibT_eX]

[DOI]

Internet Math., 2008

Who Should Pay for Forwarding Packets?

[BibT_eX]

[DOI]

Internet Math., 2008

Approximating Wardrop equilibria with finitely many agents.

[BibT_eX]

[DOI]

Lars Olbrich

Distributed Comput., 2008

Inapproximability of pure nash equilibria.

[BibT_eX]

[DOI]

Alexander Skopalik

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2007

On the structure and complexity of worst-case equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Decision-making based on approximate and smoothed Pareto curves.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Tight bounds for worst-case equilibria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Smoothed analysis of integer programming.

[BibT_eX]

[DOI]

Math. Program., 2007

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.

[BibT_eX]

[DOI]

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

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Shang-Hua Teng

Eli Upfal

Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007

Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios.

[BibT_eX]

[DOI]

Proceedings of the 2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, 2007

2006

Computing equilibria for a service provider game with (Im)perfect information.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Balanced Allocations: The Heavily Loaded Case.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Typical Properties of Winners and Losers in Discrete Optimization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Foreword.

[BibT_eX]

[DOI]

Aravind Srinivasan

Theory Comput. Syst., 2006

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

On the Impact of Combinatorial Structure on Congestion Games.

[BibT_eX]

[DOI]

Heiner Ackermann

Electron. Colloquium Comput. Complex., 2006

An Experimental Study of Random Knapsack Problems.

[BibT_eX]

[DOI]

Algorithmica, 2006

Congestion Games: Optimization in Competition.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004

Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Random knapsack in expected polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Probabilistic analysis of knapsack core algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing equilibria for congestion games with (im)perfect information.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the Evolution of Selfish Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

How asymmetry helps load balancing.

[BibT_eX]

[DOI]

J. ACM, 2003

Tail Bounds And Expectations For Random Arc Allocation And Applications.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Randomized Pursuit-Evasion In Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An Experimental Study of <i>k</i>-Splittable Scheduling for DNS-Based Traffic Allocation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.

[BibT_eX]

[DOI]

Christof Krick

Harald Räcke

Theory Comput. Syst., 2002

Random Arc Allocation and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Routing and Communication in Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

Almost optimal permutation routing on hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A data tracking scheme for general networks.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.

[BibT_eX]

[DOI]

Christian Scheideler

SIAM J. Comput., 2000

Improved Routing and Sorting on Multibutterflies.

[BibT_eX]

[DOI]

Bruce M. Maggs

Algorithmica, 2000

Caching in networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Randomized Rumor Spreading.

[BibT_eX]

[DOI]

Richard M. Karp

Christian Schindelhauer

Scott Shenker

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Shortest-Path Routing in Arbitrary Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Approximating Multicast Congestion.

[BibT_eX]

[DOI]

Santosh S. Vempala

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Static and dynamic data Management in networks.

[BibT_eX]

[DOI]

PhD thesis, 1998

Universal Continuous Routing Strategies.

[BibT_eX]

[DOI]

Christian Scheideler

Theory Comput. Syst., 1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Richard Cole

Bruce M. Maggs

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

Exploiting Locality for Data Management in Systems of Limited Bandwidth.

[BibT_eX]

[DOI]

Bruce M. Maggs

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Static and Dynamic Data Management in Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

Universal Algorithms for Store-and-Forward and Wormhole Routing.

[BibT_eX]

[DOI]

Robert Cypher

Christian Scheideler

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

A Packet Routing Protocol for Arbitrary Networks.

[BibT_eX]

[DOI]