A class of games possessing pure-strategy Nash equilibria
From MaRDI portal
Publication:2560099
DOI10.1007/BF01737559zbMath0259.90059OpenAlexW2054129049MaRDI QIDQ2560099
Publication date: 1973
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01737559
Related Items (only showing first 100 items - show all)
On potential equations of finite games ⋮ Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Graphical potential games ⋮ Concurrent imitation dynamics in congestion games ⋮ Congestion games with malicious players ⋮ Strong equilibrium in cost sharing connection games ⋮ Congestion games with load-dependent failures: Identical resources ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ An application of optimization theory to the study of equilibria for games: a survey ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Competitive online multicommodity routing ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ When ignorance helps: graphical multicast cost sharing games ⋮ Decentralized dynamics for finite opinion games ⋮ Computing equilibria: a computational complexity perspective ⋮ Strategic decentralization in binary choice composite congestion games ⋮ A game-theoretic algorithm for non-linear single-path routing problems ⋮ Vector space structure of finite evolutionary games and its application to strategy profile convergence ⋮ Information diffusion in social sensing ⋮ Network-formation games with regular objectives ⋮ The price of anarchy for polynomial social cost ⋮ On the performance of mildly greedy players in cut games ⋮ Bio-inspired paradigms in network engineering games ⋮ Pigouvian pricing and stochastic evolutionary implementation ⋮ Essential equilibria of discontinuous games ⋮ On the complexity of Pareto-optimal Nash and strong equilibria ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Partition equilibrium always exists in resource selection games ⋮ Mixing time and stationary expected social welfare of logit dynamics ⋮ On the structure of weakly acyclic games ⋮ A hierarchy of heuristic-based models of crowd dynamics ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Representation of finite games as network congestion games ⋮ Decompositions and potentials for normal form games ⋮ Social context congestion games ⋮ Nash equilibria with minimum potential in undirected broadcast games ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Large-scale dynamics of mean-field games driven by local Nash equilibria ⋮ Logit dynamics with concurrent updates for local interaction potential games ⋮ A polynomial oracle-time algorithm for convex integer minimization ⋮ Action-graph games ⋮ Equilibria in a class of aggregative location games ⋮ Capacitated network design games ⋮ Congestion games with capacitated resources ⋮ Minimizing expectation plus variance ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Externality effects in the formation of societies ⋮ Weak equilibrium in a spatial model ⋮ Graphical congestion games ⋮ Convergence and approximation in potential games ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Repeated congestion games with bounded rationality ⋮ Congestion games with failures ⋮ Tight bounds for selfish and greedy load balancing ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ Performance of one-round walks in linear congestion games ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Equilibria, fixed points, and complexity classes ⋮ On finite potential games ⋮ A minimally altruistic refinement of Nash equilibrium ⋮ The ring design game with fair cost allocation ⋮ Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games ⋮ Strategic complementarities and nested potential games ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Dynamic potential games: the discrete-time stochastic case ⋮ Resource buying games ⋮ Cournot tatonnement and potentials ⋮ Minimizing Rosenthal potential in multicast games ⋮ LP-based covering games with low price of anarchy ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Strong equilibrium in network congestion games: increasing versus decreasing costs ⋮ Nonconvergence to saddle boundary points under perturbed reinforcement learning ⋮ Strong Nash equilibrium in games with common and complementary local utilities ⋮ Profit sharing with thresholds and non-monotone player utilities ⋮ Evolutionary potential games on lattices ⋮ Paradoxes in social networks with multiple products ⋮ Synthesis from component libraries with costs ⋮ Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games ⋮ The impact of social ignorance on weighted congestion games ⋮ Acyclicity of improvements in finite game forms ⋮ On pure conjectural equilibrium with non-manipulable information ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Games of social interactions with local and global externalities ⋮ Potential games in volatile environments ⋮ Best response equivalence ⋮ Competitive routing over time ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Network design with weighted players ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ On coset weighted potential game ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ Anti-conformism in the threshold model of collective behavior ⋮ Regular quantal response equilibrium ⋮ Sharing costs in highways: a game theoretic approach
Cites Work
This page was built for publication: A class of games possessing pure-strategy Nash equilibria
