Pages that link to "Item:Q2560099"
From MaRDI portal
The following pages link to A class of games possessing pure-strategy Nash equilibria (Q2560099):
Displayed 50 items.
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- A geometric approach to the price of anarchy in nonatomic congestion games (Q2519480) (← links)
- The projection dynamic and the geometry of population games (Q2519486) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Generalized potentials and robust sets of equilibria (Q2571802) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Price floors and competition (Q2642879) (← links)
- Multicriteria games and potentials (Q2644433) (← links)
- Signalling and obfuscation for congestion control (Q2799244) (← links)
- Optimal Transport and Cournot-Nash Equilibria (Q2800367) (← links)
- Congestion Games with Variable Demands (Q2800374) (← links)
- Congestion Games with Multi-Dimensional Demands (Q2807005) (← links)
- The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
- Complexity and Optimality of the Best Response Algorithm in Random Potential Games (Q2819446) (← links)
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games (Q2819450) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Convergence Dynamics of Graphical Congestion Games (Q2840915) (← links)
- AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING (Q2852569) (← links)
- Self-organizing Flows in Social Networks (Q2868636) (← links)
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times (Q2875605) (← links)
- The complexity of welfare maximization in congestion games (Q2892161) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- On Lookahead Equilibria in Congestion Games (Q2937746) (← links)
- A Game-Theoretic Approach to Graph Clustering (Q2940545) (← links)
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Q2947026) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Congestion Games with Mixed Objectives (Q2958352) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
- Opinion Formation Games with Dynamic Social Influences (Q2959850) (← links)
- On Three-Player Potential Games (Q2965223) (← links)
- On lookahead equilibria in congestion games (Q2971063) (← links)
- Resource Allocation Games with Multiple Resource Classes (Q2971166) (← links)
- BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING (Q2997921) (← links)
- Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach (Q3006025) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- Public congestion network situations and related games (Q3057160) (← links)
- Partition Equilibrium Always Exists in Resource Selection Games (Q3162506) (← links)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
- On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- NONCOOPERATIVE GAMES FROM TU GAMES WITH INFORMATION COST (Q3166238) (← links)
- Price competition with elastic traffic (Q3184599) (← 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)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)