Pages that link to "Item:Q2560099"
From MaRDI portal
The following pages link to A class of games possessing pure-strategy Nash equilibria (Q2560099):
Displaying 50 items.
- Sharing costs in highways: a game theoretic approach (Q257250) (← links)
- On potential equations of finite games (Q273963) (← links)
- Graphical potential games (Q281410) (← links)
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- An application of optimization theory to the study of equilibria for games: a survey (Q301040) (← links)
- Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- Decentralized dynamics for finite opinion games (Q313975) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- A game-theoretic algorithm for non-linear single-path routing problems (Q325393) (← links)
- Vector space structure of finite evolutionary games and its application to strategy profile convergence (Q328203) (← links)
- Information diffusion in social sensing (Q330313) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Bio-inspired paradigms in network engineering games (Q351783) (← links)
- Essential equilibria of discontinuous games (Q372371) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Partition equilibrium always exists in resource selection games (Q372982) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- On the structure of weakly acyclic games (Q372989) (← links)
- A hierarchy of heuristic-based models of crowd dynamics (Q377770) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Representation of finite games as network congestion games (Q378323) (← links)
- Social context congestion games (Q386894) (← 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)
- Large-scale dynamics of mean-field games driven by local Nash equilibria (Q404310) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- On finite potential games (Q458983) (← links)
- A minimally altruistic refinement of Nash equilibrium (Q459420) (← links)
- The ring design game with fair cost allocation (Q476847) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Dynamic potential games: the discrete-time stochastic case (Q483902) (← links)
- Resource buying games (Q487012) (← links)
- Cournot tatonnement and potentials (Q492880) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- Strong equilibrium in network congestion games: increasing versus decreasing costs (Q495760) (← links)
- Nonconvergence to saddle boundary points under perturbed reinforcement learning (Q495761) (← links)
- Strong Nash equilibrium in games with common and complementary local utilities (Q502326) (← links)
- Profit sharing with thresholds and non-monotone player utilities (Q506517) (← links)
- Evolutionary potential games on lattices (Q515571) (← links)
- Paradoxes in social networks with multiple products (Q516241) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
