The following pages link to (Q2934597):
Displaying 24 items.
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
- Profit sharing with thresholds and non-monotone player utilities (Q506517) (← links)
- Selfish bin packing (Q534779) (← links)
- Bayesian ignorance (Q714780) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Capacitated network design games (Q904684) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Equilibria in load balancing games (Q1048257) (← links)
- Price of Pareto optimality in hedonic games (Q2046008) (← links)
- Machine load balancing game with linear externalities (Q2096168) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- Collusion in Atomic Splittable Routing Games (Q3012948) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- A Unified Framework for Strong Price of Anarchy in Clustering Games (Q3449509) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
