Pages that link to "Item:Q733733"

The following pages link to Network design with weighted players (Q733733):

Displaying 42 items.

• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
• Network-formation games with regular objectives (Q342715) (← links)
• \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
• The ring design game with fair cost allocation (Q476847) (← links)
• Competitive cost sharing with economies of scale (Q547291) (← links)
• Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
• Price of stability in survivable network design (Q647493) (← links)
• Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
• Non-cooperative facility location and covering games (Q964406) (← links)
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
• Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
• Strategic multiway cut and multicut games (Q1946494) (← links)
• Non-cooperative queueing games on a network of single server queues (Q2052440) (← links)
• A unifying approximate potential for weighted congestion games (Q2109950) (← links)
• Timing matters: online dynamics in broadcast games (Q2190382) (← links)
• The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
• Dynamic resource allocation games (Q2286736) (← links)
• Geometric spanner games (Q2330124) (← links)
• Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
• Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
• Congestion Games with Variable Demands (Q2800374) (← links)
• Dynamic Resource Allocation Games (Q2819456) (← links)
• On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
• Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
• Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
• Hierarchical Network Formation Games (Q3303895) (← links)
• Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
• Cost-Sharing Scheduling Games on Restricted Unrelated Machines (Q3449583) (← links)
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games (Q3449591) (← links)
• The Price of Matching with Metric Preferences (Q3452808) (← links)
• Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)
• Dynamics of Profit-Sharing Games (Q4985773) (← links)
• Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
• Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
• The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games (Q5870354) (← links)
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games (Q5891841) (← links)
• Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
• Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
• Equilibrium analysis of customer attraction games (Q6609143) (← links)