Pages that link to "Item:Q4816625"

The following pages link to CONGESTION GAMES AND POTENTIALS RECONSIDERED (Q4816625):

Displaying 23 items.

• An application of optimization theory to the study of equilibria for games: a survey (Q301040) (← links)
• Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
• Network topology and the efficiency of equilibrium (Q863283) (← links)
• Nash equilibria in all-optical networks (Q1043952) (← links)
• Social optimality and cooperation in nonatomic congestion games. (Q1421898) (← links)
• A universal construction generating potential games (Q1651287) (← links)
• Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
• Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
• Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
• A game-theoretical model of the landscape theory (Q1996175) (← links)
• An axiomatization of the Nash equilibrium concept (Q2273951) (← links)
• Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
• Nonspecific networking (Q2344966) (← links)
• A survey of static and dynamic potential games (Q2360803) (← links)
• Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
• The cutting power of preparation (Q2379185) (← links)
• On the convergence of multicast games in directed networks (Q2379922) (← links)
• Congestion games revisited (Q2384723) (← links)
• Selfish routing with incomplete information (Q2471698) (← links)
• Weighted Boolean Formula Games (Q3464467) (← links)
• Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (Q4971386) (← links)
• Potential games with continuous player sets (Q5937317) (← links)
• Equilibria in bottleneck games (Q6052979) (← links)