The following pages link to (Q4737150):
Displaying 46 items.
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Selfish bin packing (Q534779) (← links)
- Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Facets of the fully mixed Nash equilibrium conjecture (Q987401) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Equilibria in load balancing games (Q1048257) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Machine load balancing game with linear externalities (Q2096168) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Selfish routing with incomplete information (Q2471698) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Inverse Game Theory: Learning Utilities in Succinct Games (Q3460806) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Facets of the Fully Mixed Nash Equilibrium Conjecture (Q5459980) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)
- Project games (Q5925706) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
