The following pages link to Max Klimm (Q378093):
Displaying 50 items.
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Nobel, Milgrom and Wilson (Q2032412) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Broadcasting a file in a communication network (Q2173055) (← links)
- The online best reply algorithm for resource allocation problems (Q2292625) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- Bottleneck routing with elastic demands (Q2417055) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- Congestion games with variable demands (Q2800374) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- Congestion Games with Player-Specific Costs Revisited (Q2856135) (← links)
- Resource Competition on Integral Polymatroids (Q2936985) (← links)
- Congestion Games with Higher Demand Dimensions (Q2937009) (← links)
- Multimarket Oligopolies with Restricted Market Access (Q2938657) (← links)
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Q2947026) (← links)
- Packing a Knapsack of Unknown Capacity (Q2965490) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- Approximate Pure Nash Equilibria in Weighted Congestion Games (Q2969621) (← links)
- Optimal File Distribution in Peer-to-Peer Networks (Q3104615) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- Optimal Impartial Selection (Q3449559) (← links)
- Impartial Selection and the Power of up to Two Choices (Q3460784) (← links)
- Bottleneck Routing with Elastic Demands (Q3460804) (← links)
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Q3586381) (← links)
- Characterizing the Existence of Potential Functions in Weighted Congestion Games (Q3648846) (← links)
- Undirected Graph Exploration with ⊝(log log <i>n</i>) Pebbles (Q4575577) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
- Computing network tolls with support constraints (Q4642456) (← links)
- Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games (Q4924646) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- (Q5002840) (← links)
- Pure Nash Equilibria in Resource Graph Games (Q5026179) (← links)
- Packing Under Convex Quadratic Constraints (Q5041751) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Hiring Secretaries over Time: The Benefit of Concurrent Employment (Q5108268) (← links)
- Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians (Q5146962) (← links)
- Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Q5215469) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Computing all Wardrop Equilibria parametrized by the Flow Demand (Q5236240) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q5348461) (← links)
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games (Q5870354) (← links)
- Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium (Q5882229) (← links)
- Generalized Permutahedra and Optimal Auctions (Q5886833) (← links)
- On the existence of pure Nash equilibria in weighted congestion games (Q5891841) (← links)
