Berthold Vöcking

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 8

Top Venues

CoRR

Math. Program.

STOC

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR (2023)
René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200 (1) (2023)
Berthold Vöcking
A universally-truthful approximation scheme for multi-unit auctions. Games Econ. Behav. 113 (2019)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal Beats Dual on Online Packing LPs in the Random-Order Model. SIAM J. Comput. 47 (5) (2018)
Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking
Truthful mechanism design via correlated tree rounding. Math. Program. 163 (1-2) (2017)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. ACM Trans. Algorithms 13 (1) (2016)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Truthfulness and Stochastic Dominance with Monetary Transfers. ACM Trans. Economics and Comput. 4 (2) (2016)
Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking
Truthful Mechanism Design via Correlated Tree Rounding. EC (2015)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Algorithmica 68 (1) (2014)
Artur Czumaj, Berthold Vöcking
Thorp Shuffling, Butterflies, and Non-Markovian Couplings. ICALP (1) (2014)
Maximilian Odendahl, Andres Goens, Rainer Leupers, Gerd Ascheid, Benjamin Ries, Berthold Vöcking, Tomas Henriksson
Optimized buffer allocation in multicore platforms. DATE (2014)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation Algorithms for Secondary Spectrum Auctions. ACM Trans. Internet Techn. 14 (2-3) (2014)
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) (2014)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal beats dual on online packing LPs in the random-order model. STOC (2014)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553 (2014)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Truthfulness and stochastic dominance with monetary transfers. EC (2013)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. ACM Trans. Comput. Theory 5 (2) (2013)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
Primal Beats Dual on Online Packing LPs in the Random-Order Model. CoRR (2013)
Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking
Electronic Markets and Auctions (Dagstuhl Seminar 13461). Dagstuhl Reports 3 (11) (2013)
Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA (2013)
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
Online capacity maximization in wireless networks. J. Sched. 16 (1) (2013)
Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR (2013)
Marcel Ochel, Klaus Radke, Berthold Vöcking
Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization. ICALP (2) (2012)
Berthold Vöcking
Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract). ICALP (2) (2012)
Berthold Vöcking
A universally-truthful approximation scheme for multi-unit auctions. SODA (2012)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing approximate Nash equilibria in network congestion games. Networks 59 (4) (2012)
Piotr Krysta, Berthold Vöcking
Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) (2012)
Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS (2012)
Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking
Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412 (24) (2011)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40 (1) (2011)
Patrick Briest, Piotr Krysta, Berthold Vöcking
Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40 (6) (2011)
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
Considerate Equilibrium. IJCAI (2011)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation algorithms for secondary spectrum auctions. SPAA (2011)
Melanie Winkler, Berthold Vöcking, Sascha Geulen
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. Electron. Colloquium Comput. Complex. 17 (2010)
Simon Fischer, Harald Räcke, Berthold Vöcking
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. 39 (8) (2010)
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
Online capacity maximization in wireless networks. SPAA (2010)
Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking
Considerate Equilibrium CoRR (2010)
Thomas Kesselheim, Berthold Vöcking
Distributed Contention Resolution in Wireless Networks. DISC (2010)
Thomas Kesselheim, Berthold Vöcking
Brief announcement: distributed contention resolution in wireless networks. PODC (2010)
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
Online Capacity Maximization in Wireless Networks. Electron. Colloquium Comput. Complex. 17 (2010)
Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
10211 Abstracts Collection - Flexible Network Design. Flexible Network Design (2010)
Martin Hoefer, Berthold Vöcking
Berechnung von Nash-Gleichgewichten. Inform. Spektrum 33 (5) (2010)
Artur Czumaj, Piotr Krysta, Berthold Vöcking
Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39 (5) (2010)
Sascha Geulen, Berthold Vöcking, Melanie Winkler
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm. COLT (2010)
Martin Hoefer, Thomas Kesselheim, Berthold Vöcking
Approximation Algorithms for Secondary Spectrum Auctions CoRR (2010)
Matthias Englert, Berthold Vöcking, Melanie Winkler
Economical Caching with Stochastic Prices. SAGA (2009)
Berthold Vöcking
Congestion games: Equilibria, convergence and complexity. GAMENETS (2009)
Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking
Management of Variable Data Streams in Networks. Algorithmics of Large and Complex Networks (2009)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated two-sided matching markets. SIGecom Exch. 8 (1) (2009)
Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking
Economical Caching. STACS (2009)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410 (17) (2009)
Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking
Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) (2009)
Marcel Ochel, Berthold Vöcking
Approximability of OFDMA Scheduling. ESA (2009)
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking
Oblivious interference scheduling. PODC (2009)
Simon Fischer, Berthold Vöcking
Adaptive routing with stale information. Theor. Comput. Sci. 410 (36) (2009)
Simon Fischer, Lars Olbrich, Berthold Vöcking
Approximating Wardrop equilibria with finitely many agents. Distributed Comput. 21 (2) (2008)
Alexander Skopalik, Berthold Vöcking
Inapproximability of pure nash equilibria. STOC (2008)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5 (4) (2008)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
Uncoordinated two-sided matching markets. EC (2008)
Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking
Computing Approximate Nash Equilibria in Network Congestion Games. SIROCCO (2008)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
On the impact of combinatorial structure on congestion games. J. ACM 55 (6) (2008)
Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking
Who Should Pay for Forwarding Packets? Internet Math. 5 (4) (2008)
René Beier, Heiko Röglin, Berthold Vöcking
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO (2007)
Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking
Who Should Pay for Forwarding Packets? WINE (2007)
Simon Fischer, Lars Olbrich, Berthold Vöcking
Approximating Wardrop Equilibria with Finitely Many Agents. DISC (2007)
Artur Czumaj, Berthold Vöcking
Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3 (1) (2007)
Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378 (3) (2007)
Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Heiko Röglin, Berthold Vöcking
Smoothed analysis of integer programming. Math. Program. 110 (1) (2007)
Simon Fischer, Marina Petrova, Petri Mähönen, Berthold Vöcking
Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios. CrownCom (2007)
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking
A Unified Approach to Congestion Games and Two-Sided Markets. WINE (2007)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. SODA (2007)
Simon Fischer, Berthold Vöcking
On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. 378 (2) (2007)
Peter Sanders, Aravind Srinivasan, Berthold Vöcking
Foreword. Theory Comput. Syst. 39 (6) (2006)
Matthias Englert, Heiko Röglin, Berthold Vöcking
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. Electron. Colloquium Comput. Complex. 13 (092) (2006)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. 13 (067) (2006)
Simon Fischer, Harald Räcke, Berthold Vöcking
Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC (2006)
René Beier, Berthold Vöcking
An Experimental Study of Random Knapsack Problems. Algorithmica 45 (1) (2006)
Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35 (6) (2006)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE (2006)
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms 2 (4) (2006)
Heiner Ackermann, Heiko Röglin, Berthold Vöcking
On the Impact of Combinatorial Structure on Congestion Games. FOCS (2006)
Berthold Vöcking
Congestion Games: Optimization in Competition. ACiD (2006)
René Beier, Berthold Vöcking
Typical Properties of Winners and Losers in Discrete Optimization. SIAM J. Comput. 35 (4) (2006)
Patrick Briest, Piotr Krysta, Berthold Vöcking
Approximation techniques for utilitarian mechanism design. STOC (2005)
Simon Fischer, Berthold Vöcking
Adaptive routing with stale information. PODC (2005)
Heiko Röglin, Berthold Vöcking
Smoothed Analysis of Integer Programming. IPCO (2005)
Simon Fischer, Berthold Vöcking
On the Structure and Complexity of Worst-Case Equilibria. WINE (2005)
Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC (2005)
Simon Fischer, Berthold Vöcking
On the Evolution of Selfish Routing. ESA (2004)
Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking
Foreword. Theory Comput. Syst. 37 (3) (2004)
René Beier, Berthold Vöcking
Probabilistic analysis of knapsack core algorithms. SODA (2004)
René Beier, Berthold Vöcking
Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69 (3) (2004)
René Beier, Berthold Vöcking
Typical properties of winners and losers in discrete optimization. STOC (2004)
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
Computing equilibria for congestion games with (im)perfect information. SODA (2004)
René Beier, Berthold Vöcking
An Experimental Study of Random Knapsack Problems. ESA (2004)
Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12 (3) (2003)
Piotr Krysta, Peter Sanders, Berthold Vöcking
Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS (2003)
Berthold Vöcking
How asymmetry helps load balancing. J. ACM 50 (4) (2003)
Peter Sanders, Berthold Vöcking
Tail Bounds And Expectations For Random Arc Allocation And Applications. Comb. Probab. Comput. 12 (3) (2003)

Berthold Vöcking.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Berthold Vöcking