The following pages link to Worst-case equilibria (Q458478):
Displaying 50 items.
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem (Q1997319) (← links)
- How good is a two-party election game? (Q2031050) (← links)
- Selfish bin packing with parameterized punishment (Q2039667) (← links)
- On weak Pareto optimality of nonatomic routing networks (Q2082187) (← links)
- Defense coordination in security games: equilibrium analysis and mechanism design (Q2093398) (← links)
- Non-blind strategies in timed network congestion games (Q2112118) (← links)
- Timed network games (Q2112796) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Selfish bin packing under harmonic mean cost sharing mechanism (Q2136882) (← links)
- On various open-end bin packing game (Q2149858) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Transportation network with externalities (Q2196061) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- On understanding price-QoS war for competitive market and confused consumers (Q2218475) (← links)
- Improving the price of anarchy for selfish routing via coordination mechanisms (Q2249743) (← links)
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- Bounds on price of anarchy on linear cost functions (Q2351278) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Efficiency and complexity of price competition among single-product vendors (Q2407455) (← links)
- Implementation of optimal schedules in outsourcing with identical suppliers (Q2417955) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- Coordinating oligopolistic players in unrelated machine scheduling (Q2514126) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Robust equilibria in location games (Q2629657) (← links)
- The price of defense (Q2663706) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Incentive ratio: a game theoretical analysis of market equilibria (Q2672255) (← links)
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context (Q2698591) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Efficiency Loss in a Cournot Oligopoly with Convex Market Demand (Q2840916) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A mean-risk model for the traffic assignment problem with stochastic travel times (Q2875605) (← links)
- Tight bounds for worst-case equilibria (Q2944540) (← links)
- Efficient Equilibria in Polymatrix Coordination Games (Q2946422) (← links)
- Resource Allocation Games with Multiple Resource Classes (Q2971166) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- The power of one secret agent (Q3301024) (← links)
- Hierarchical Network Formation Games (Q3303895) (← links)
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines (Q3449583) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
