Pages that link to "Item:Q3177741"

The following pages link to Intrinsic Robustness of the Price of Anarchy (Q3177741):

Displaying 41 items.

• On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
• Tight inefficiency bounds for perception-parameterized affine congestion games (Q1628591) (← links)
• Non-atomic one-round walks in congestion games (Q1731512) (← links)
• The impact of worst-case deviations in non-atomic network routing games (Q1733381) (← links)
• Limited-trust equilibria (Q2028831) (← links)
• Delegation and ambiguity in correlated equilibrium (Q2078094) (← links)
• Bounding quality of pure Nash equilibria in dual-role facility location games (Q2091109) (← links)
• Principal-agent VCG contracts (Q2138089) (← links)
• Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
• Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
• Bayesian generalized network design (Q2202025) (← links)
• Smart routing of electric vehicles for load balancing in smart grids (Q2203089) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
• The price of anarchy for utilitarian scheduling games on related machines (Q2419358) (← links)
• Exploration-exploitation in multi-agent learning: catastrophe theory meets game theory (Q2667841) (← links)
• Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
• Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
• Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
• Selfishness Need Not Be Bad (Q4994166) (← links)
• The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users (Q5000644) (← links)
• The Price of Stability of Weighted Congestion Games (Q5002839) (← links)
• (Q5075788) (← links)
• Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
• Game efficiency through linear programming duality (Q5090446) (← links)
• (Q5111703) (← links)
• Location Games on Networks: Existence and Efficiency of Equilibria (Q5219715) (← links)
• The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
• Congestion Games with Complementarities (Q5283369) (← links)
• An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
• Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)
• Scheduling games with machine-dependent priority lists (Q5896089) (← links)
• Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5919605) (← links)
• A convergence analysis of the price of anarchy in atomic congestion games (Q6038662) (← links)
• Congestion games with priority-based scheduling (Q6049927) (← links)
• (Q6087217) (← links)
• Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
• Competitive algorithms for demand response management in a smart grid (Q6124769) (← links)
• Reception capacity: definitions, game theory and hardness (Q6536157) (← links)
• Routing MEV in constant function market makers (Q6609166) (← links)
• Nonatomic non-cooperative neighbourhood balancing games (Q6614537) (← links)