Pages that link to "Item:Q3580952"
From MaRDI portal
The following pages link to The complexity of pure Nash equilibria (Q3580952):
Displaying 50 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Decentralized dynamics for finite opinion games (Q313975) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Resource buying games (Q487012) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Network movement games (Q511922) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Graphical congestion games (Q639291) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← 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)
- Synthesis from component libraries with costs (Q683714) (← links)
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities (Q684137) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Competitive routing over time (Q719282) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← 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)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Coordination mechanisms (Q838145) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Capacitated network design games (Q904684) (← links)
- Congestion games with capacitated resources (Q904685) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- How to find Nash equilibria with extreme total latency in network congestion games? (Q966426) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Weighted congestion games with separable preferences (Q1036603) (← links)
