Publications 2007
- Conference Publications
- A Unified Approach to Congestion Games and Two- Sided Markets
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE)San Diego, USA, 2007, Pages 30-41. - Who Should Pay for Forwarding Packets?
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE)San Diego, USA, 2007, Pages 208-219. - On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
In Proc. of the 3rd International Workshop on Internet and Network Economics (WINE)San Diego, USA, 2007, Pages 419-430. - Approximating Wardrop Equilibria with Finitely Many Agents
In Proc. of the 21st International Symposium on Distributed Computing (DISC)Lemesos, Cyprus, 2007, Pages 238-252. - Distributed Load Balancing Algorithm for Adaptive Channel Allocation for Cognitive Radios
Simon Fischer, Marina Petrova, Petri Mähönen, Berthold VöckingIn Proc. of the 2nd Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom)Orlando, USA, 2007, to appear. - A First Step towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
In Proc. of the 4th Symposium on Stochastic Algorithms, Foundations, and Applications (SAGA)Zürich, Switzerland, 2007, Pages 58-69. - On the Complexity of the Traffic Grooming Problem in Optical Networks
In Proc. of the 4th International Conference on Fun With Algorithms (FUN)Castiglioncello, Italy, 2007, to appear. - Reordering Buffers for General Metric Spaces
In Proc. of the 39th Annual ACM Symposium on Theory of Computing (STOC)San Diego, USA, 2007, Pages 556-564. - The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In Proc. of the 12th Conference on Integer Programming and Combinatorial Optimization (IPCO)Ithaca, USA, 2007, Pages 53-67. - Considering Suppressed Packets Improves Buffer Management in QoS Switches
In Proc. of the 18th Symposium on Discrete Algorithms (SODA)New Orleans, USA, 2007, Pages 209-218. - Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
In Proc. of the 18th Symposium on Discrete Algorithms (SODA)New Orleans, USA, 2007, Pages 1295-1304. (BibTeX)
- A Unified Approach to Congestion Games and Two- Sided Markets
- Journal Publications
- Decision-Making Based on Approximate and Smoothed Pareto Curves
Theoretical Computer Science, Volume 378 (3), 2007, Pages 253-270. - On the Structure and Complexity of Worst-Case Equilibria
Theoretical Computer Science, Volume 378 (2), 2007, Pages 165-174. - On-line Load Balancing made Simple: Greedy Strikes Back.
Journal of Discrete Algorithms, Volume 5 (1), 2007, Pages 162-175. - Smoothed Analysis of Integer Programming
Mathematical Programming, Volume 110 (1), 2007, Pages 21-56. - Tight bounds for Worst-Case Equilibria
ACM Transactions on Algorithms, Volume 3 (1), 2007.
- Decision-Making Based on Approximate and Smoothed Pareto Curves
Publications 2006
- Conference Publications
- Congestion Games: Optimization in Competition (Survey Paper)
In Proc. of the 2nd Algorithms and Complexity in Durham Workshop (ACiD)Durham, UK, 2006, Pages 9-20. (BibTeX) - REPLEX — Dynamic Traffic Engineering Based on Wardrop Routing Policies
In Proc. of the 2nd Conference on Future Networking Technologies (CoNext)Lisboa, Portugal, 2006, Pages 6-17. (BibTeX) - Pure Nash Equilibria in Player-Specific and Weighted Congestion Games
In Proc. of the 2nd International Workshop on Internet and Network Economics (WINE)Patras, Greece, 2006, Pages 50-61. (BibTeX) - On the Impact of Combinatorial Structure on Congestion Games
In Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS)Berkeley, USA, 2006, Pages 613-622. (BibTeX) - Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
In Proc. of the 14th Annual European Symposium on Algorithms (ESA)Zürich, Switzerland, 2006, Pages 352-363. (BibTeX) - Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
In Proc. of the 38th Annual ACM Symposium on Theory of Computing (STOC)Seattle, USA, 2006, Pages 653 - 662. (BibTeX) - Evaluation of Online Strategies for Reordering Buffers
In Proc. of the 5th Workshop on Experimental and Efficient Algorithms (WEA)Menorca Island, Spain, 2006, Pages 183-194. (BibTeX)
- Congestion Games: Optimization in Competition (Survey Paper)
- Journal Publications
- Balanced Allocations: The Heavily Loaded Case
SIAM Journal on Computing, Volume 35 (6), 2006, Pages 1350-1385. (BibTeX) - Typical Properties of Winners and Losers in Discrete Optimization
SIAM Journal on Computing, Volume 35 (4), 2006, Pages 855-881. (BibTeX) - An Experimental Study of Random Knapsack Problems
Algorithmica, Volume 45 (1), 2006, Pages 121-136. (BibTeX) - Computing Equilibria for a Service Provider Game with (Im)perfect Information
ACM Transactions on Algorithms, Volume 2 (4), 2006, Pages 679-706.
- Balanced Allocations: The Heavily Loaded Case
Publications 2005
- Conference Publications
- Decision Making Based on Approximate and Smoothed Pareto Curves
In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC)Sanya, China, 2005, Pages 675-684. (BibTeX) - A 1.5-Approximation of the Minimal Manhattan Network Problem
In Proc. of the 16th Annual International Symposium on Algorithms and Computation (ISAAC)Sanya, China, 2005, Pages 246-255. (BibTeX) - On the Structure and Complexity of Worst-Case Equilibria
In Proc. of the 1st Workshop on Internet and Network Economics (WINE)Hong Kong, China, 2005, Pages 151-160. (BibTeX) - Adaptive routing with stale information
In Proc. of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC)Las Vegas, USA, 2005, Pages 276-283. (BibTeX) - Reordering Buffer Management for Non-uniform Cost Models
In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)Lisbon, Portugal, 2005, Pages 627-638. (BibTeX) - Smoothed Analysis of Integer Programming
In Proc. of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO)Berlin, Germany, 2005, Pages 276-290. (BibTeX) - Aggregating inconsistent information: ranking and clustering
In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC)Baltimore, USA, 2005, Pages 684-693. (BibTeX) - Approximation Techniques for Utilitarian Mechanims Design
In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC)Baltimore, USA, 2005, Pages 39-48. (BibTeX)
- Decision Making Based on Approximate and Smoothed Pareto Curves
- Journal Publications
- The one-dimensional Ising model: Mutation versus recombination
Theoretical Computer Science, Volume 344 (2-3), 2005, Pages 208-225. (BibTeX)
- The one-dimensional Ising model: Mutation versus recombination
- Annual Report 2005 [pdf]
Previous annual reports