The following pages link to Potential games (Q1817255):
Displaying 50 items.
- Fictitious play in \(3 \times 3\) games: chaos and dithering behaviour (Q719895) (← links)
- Network design with weighted players (Q733733) (← links)
- Double best response dynamics in topology formation game for ad hoc networks (Q747338) (← links)
- Decomposition algorithms for generalized potential games (Q763403) (← links)
- On coset weighted potential game (Q776136) (← links)
- Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
- Two-person pairwise solvable games (Q776846) (← links)
- Optimal search segmentation mechanisms for online platform markets (Q777976) (← links)
- Strategic complements and substitutes, and potential games (Q817267) (← links)
- Price-coupling games and the generation expansion planning problem (Q827267) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Congestion games with load-dependent failures: Identical resources (Q834859) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Coordination mechanisms (Q838145) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- The possibility of impossible stairways: tail events and countable player sets (Q844944) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Anti-coordination and social interactions (Q864885) (← links)
- On `informationally robust equilibria' for bimatrix games (Q868625) (← links)
- Evolution in games with randomly disturbed payoffs (Q869849) (← links)
- Pigouvian pricing and stochastic evolutionary implementation (Q869870) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Contagion and uninvadability in local interaction games: the bilingual game and general supermodular games (Q894010) (← links)
- On the private provision of public goods on networks (Q894039) (← links)
- Characterizing social value of information (Q896962) (← links)
- Potential games with incomplete preferences (Q898661) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Network games with incomplete information (Q898690) (← links)
- Hamiltonian potential functions for differential games (Q901107) (← links)
- Capacitated network design games (Q904684) (← links)
- Congestion games with capacitated resources (Q904685) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Dynamic club formation with coordination (Q908188) (← links)
- Approximate equilibria for Bayesian games (Q924250) (← links)
- Correlated equilibrium and concave games (Q926198) (← links)
- Two more classes of games with the continuous-time fictitious play property (Q926784) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Competing auctions with endogenous quantities (Q938053) (← links)
- On the existence of maximal elements: An impossibility theorem (Q943834) (← links)
- Ex-post implementation and preference aggregation via potentials (Q957859) (← links)
- Learning in games with strategic complementarities revisited (Q960258) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Rage against the machines: how subjects play against learning algorithms (Q971893) (← links)
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Window-games between TCP flows (Q982652) (← links)
