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
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 ⋮ On the Complexity of Equilibrium Computation in First-Price Auctions ⋮ Congestion Games with Complementarities ⋮ Cost-Sharing in Generalised Selfish Routing ⋮ Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games ⋮ Partition Equilibrium Always Exists in Resource Selection Games ⋮ Improved Lower Bounds on the Price of Stability of Undirected Network Design Games ⋮ On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users ⋮ Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ On the Complexity of Pareto-optimal Nash and Strong Equilibria ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Altruistic Hedonic Games ⋮ NONCOOPERATIVE GAMES FROM TU GAMES WITH INFORMATION COST ⋮ A Maximum Principle Approach to a Deterministic Mean Field Game of Control with Absorption ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ Cost-Sharing Scheduling Games on Restricted Unrelated Machines ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Unnamed Item ⋮ Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ Bottleneck Routing with Elastic Demands ⋮ Inverse Game Theory: Learning Utilities in Succinct Games ⋮ Price competition with elastic traffic ⋮ Weighted Boolean Formula Games ⋮ A Selective Tour Through Congestion Games ⋮ CONGESTION GAMES AND POTENTIALS RECONSIDERED ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Coordination Games on Weighted Directed Graphs ⋮ Stochastic differential games: the potential approach ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ The Value of Information in Selfish Routing ⋮ Computing Approximate Nash Equilibria in Network Congestion Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mean Field Equilibria for Resource Competition in Spatial Settings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Load Balancing Congestion Games and Their Asymptotic Behavior ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ On lookahead equilibria in congestion games ⋮ Resource Allocation Games with Multiple Resource Classes ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ An Online Learning Approach to a Multi-player N-armed Functional Bandit ⋮ Unnamed Item ⋮ Unnamed Item ⋮ HOW INDIVIDUALS LEARN TO TAKE TURNS: EMERGENCE OF ALTERNATING COOPERATION IN A CONGESTION GAME AND THE PRISONER'S DILEMMA ⋮ BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING ⋮ Scheduling games with machine-dependent priority lists ⋮ Cost Sharing in Production Economies ⋮ Evolutionary Game Theory ⋮ Networks and Stability ⋮ Delay Tolerant Networks in Partially Overlapped Networks: A Non-cooperative Game Approach ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE ⋮ Minimum-effort coordination games: Stochastic potential and logit equilibrium ⋮ Potential games with continuous player sets ⋮ Congestion games with priority-based scheduling ⋮ $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games ⋮ When Ignorance Helps: Graphical Multicast Cost Sharing Games ⋮ Parameterized shifted combinatorial optimization ⋮ Malicious Bayesian Congestion Games ⋮ Public congestion network situations and related games ⋮ Unnamed Item ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ On privacy vs. cooperation in multi-agent systems ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Window-Games between TCP Flows ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Non-cooperative Cost Sharing Games Via Subsidies ⋮ On existence of equilibrium under social coalition structures ⋮ Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Cost-sharing games in real-time scheduling systems ⋮ Sample Path Large Deviations for Stochastic Evolutionary Game Dynamics ⋮ Rare Nash Equilibria and the Price of Anarchy in Large Static Games ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Project games ⋮ Unnamed Item ⋮ Management of Variable Data Streams in Networks ⋮ Dynamics of Profit-Sharing Games ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Asynchronous Congestion Games ⋮ Value of Information in Bayesian Routing Games ⋮ Selfishness Need Not Be Bad ⋮ Location–Price Competition in Mobile Operator Market ⋮ Family of chaotic maps from game theory ⋮ The Price of Stability of Weighted Congestion Games ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ Online Learning of Nash Equilibria in Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Buck-Passing Game ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash equilibria in restricted budget games ⋮ Pure Nash Equilibria in Resource Graph Games ⋮ The structure of utility functions ensuring the existence of an exact potential in a strategic game ⋮ A survey of static and dynamic potential games ⋮ The complexity of welfare maximization in congestion games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ The cutting power of preparation ⋮ On the convergence of multicast games in directed networks ⋮ Congestion games revisited ⋮ Computing approximate Nash equilibria in network congestion games ⋮ Price floors and competition ⋮ Multicriteria games and potentials ⋮ Improved lower bounds on the price of stability of undirected network design games ⋮ On a generalized Cournot oligopolistic competition game ⋮ Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions ⋮ A congestion game framework for service chain composition in NFV with function benefit ⋮ On Lookahead Equilibria in Congestion Games ⋮ A Game-Theoretic Approach to Graph Clustering ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Sharing Non-anonymous Costs of Multiple Resources Optimally ⋮ Approximate separable multichoice optimization over monotone systems ⋮ Bottleneck routing with elastic demands ⋮ Directed graphical structure, Nash equilibrium, and potential games ⋮ On basis and pure Nash equilibrium of finite pure harmonic games ⋮ Timing matters: online dynamics in broadcast games ⋮ Chaotic congestion games ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Congestion Games with Mixed Objectives ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ On the Price of Stability of Undirected Multicast Games ⋮ Opinion Formation Games with Dynamic Social Influences ⋮ The power of one evil secret agent ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ On equilibria for ADM minimization games ⋮ On Three-Player Potential Games ⋮ On singleton congestion games with resilience against collusion ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Computational aspects of uncertainty profiles and angel-daemon games ⋮ Equilibrium and potential in coalitional congestion games ⋮ Ordinal potentials in smooth games ⋮ With potential games, which outcome is better? ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Greediness and equilibrium in congestion games ⋮ Stability vs. optimality in selfish ring routing ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Network potentials ⋮ Committing to correlated strategies with multiple leaders ⋮ Bounding the inefficiency of Nash equilibria in games with finitely many players ⋮ Stability of jurisdiction structures under the equal share and median rules ⋮ Games and cost of change ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Selfish routing with incomplete information ⋮ Approximate Nash equilibria in anonymous games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Interactive decisions and potential games ⋮ An experimental study of costly coordination ⋮ Congestion network problems and related games ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Two-group knapsack game ⋮ Taxed congestion games with failures ⋮ Iterated potential and robustness of equilibria ⋮ A testable model of consumption with externalities ⋮ Games of competition in a stochastic environment ⋮ Multistage interval scheduling games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Signalling and obfuscation for congestion control ⋮ Dynamic resource allocation games ⋮ Optimal Transport and Cournot-Nash Equilibria ⋮ Congestion Games with Variable Demands ⋮ A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ A Stackelberg strategy for routing flow over time ⋮ Congestion Games with Multi-Dimensional Demands ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Potential functions for finding stable coalition structures ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ The projection dynamic and the geometry of population games ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ Complexity and Optimality of the Best Response Algorithm in Random Potential Games ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ Dynamic Resource Allocation Games ⋮ Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case ⋮ On the stability of an adaptive learning dynamics in traffic games ⋮ On Stackelberg strategies in affine congestion games ⋮ Convergence Dynamics of Graphical Congestion Games ⋮ A survey on networking games in telecommunications ⋮ AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING ⋮ Generalized potentials and robust sets of equilibria ⋮ Heterogeneity and chaos in congestion games ⋮ Selfish unsplittable flows ⋮ Nonspecific networking ⋮ Self-organizing flows in social networks ⋮ Enforcing efficient equilibria in network design games via subsidies ⋮ Self-organizing Flows in Social Networks ⋮ Equilibrium routing under uncertainty ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Forward induction and market entry with an endogenous outside option ⋮ Algebraic verification of finite group-based potential games with vector payoffs ⋮ Orthogonal decomposition of incomplete-profile finite game space ⋮ Equilibria in bottleneck games ⋮ A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ Modeling, analysis, and dynamics of Bayesian games via matrix-based method ⋮ Pure-strategy equilibrium in Bayesian potential games with absolutely continuous information ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ A note on social learning in non-atomic routing games ⋮ Implicit coordination in an \(n\)-player target selection game ⋮ A common generalization of budget games and congestion games ⋮ Cost-sharing games with rank-based utilities ⋮ On the impact of player capability on congestion games ⋮ Fair ride allocation on a line ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ A Unified Framework for Pricing in Nonconvex Resource Allocation Games ⋮ On poisoned Wardrop equilibrium in congestion games ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ The price of anarchy in series-parallel network congestion games ⋮ A unified stochastic approximation framework for learning in games ⋮ Scheduling games with rank-based utilities ⋮ Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks ⋮ Choosing a batch to be processed ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ The calculation and simulation of the price of anarchy for network formation games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pure Nash equilibria in a generalization of congestion games allowing resource failures ⋮ Matrix approach to verification of finite multi-potential games ⋮ Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ An abstraction-refinement methodology for reasoning about network games ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Congestion games with mixed objectives ⋮ Robust perfect equilibrium in large games ⋮ Weighted and near weighted potential games with application to game theoretic control ⋮ Self-fulfilling signal of an endogenous state in network congestion games ⋮ Equilibrium computation in resource allocation games ⋮ On congestion games with player-specific costs and resource failures ⋮ Beyond Pigouvian taxes: a worst case analysis ⋮ Correlated equilibrium and potential games ⋮ Potential differential games ⋮ A universal construction generating potential games ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ Minimality of consistent solutions for strategic games, in particular for potential games ⋮ Primary versus secondary infrastructure capacity allocation mechanisms ⋮ Vector games with potential function ⋮ Axiomatic characterizations of solutions for Bayesian games ⋮ Strong equilibrium in congestion games ⋮ Pure strategy Nash equilibrium in a group formation game with positive externalities ⋮ Sensitivity of wardrop equilibria: revisited ⋮ Allocating costs in set covering problems ⋮ Coordination games on graphs ⋮ Weakly-acyclic (internet) routing games ⋮ Equilibria and approximate equilibria in infinite potential games ⋮ Efficiency in a forced contribution threshold public good game ⋮ Multi-round cooperative search games with multiple players ⋮ How noise matters. ⋮ Dynamic club formation with coordination ⋮ Network structure and strong equilibrium in route selection games. ⋮ Incomplete-profile potential games ⋮ Regret-based continuous-time dynamics. ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Incentive-based search for efficient equilibria of the public goods game ⋮ Social optimality and cooperation in nonatomic congestion games. ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ From Boolean game to potential game ⋮ Stochastic learning in multi-agent optimization: communication and payoff-based approaches ⋮ Potential maximizers and network formation ⋮ Discounted and finitely repeated minority games with public signals ⋮ On the equivalence of robustness to canonical and general elaborations ⋮ Computing solutions of the multiclass network equilibrium problem with affine cost functions ⋮ Non-atomic one-round walks in congestion games ⋮ The problem of multiple commons: a market design approach ⋮ On the existence of a pure strategy Nash equilibrium in group formation games ⋮ A new model for selfish routing ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ A game-theoretical model of the landscape theory ⋮ Improved bounds on equilibria solutions in the network design game ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Congestion control for a system with parallel stations and homogeneous customers using priority passes ⋮ The price of atomic selfish ring routing ⋮ Strategies and evolution in the minority game: a multi-round strategy experiment ⋮ Window-games between TCP flows ⋮ Stackelberg strategies for atomic congestion games ⋮ Non-cooperative cost sharing games via subsidies ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Opinion formation games with dynamic social influences ⋮ Congestion games viewed from M-convexity ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ Club networks with multiple memberships and noncooperative stability ⋮ A payoff-based learning procedure and its application to traffic games ⋮ A review of transport market modeling using game-theoretic principles ⋮ Optimization of multi-criteria facility-based systems via vector potential approach ⋮ Brown's original fictitious play ⋮ Symmetries and the complexity of pure Nash equilibrium ⋮ Strong price of anarchy ⋮ Distributed consensus in noncooperative inventory games ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Competitive location, production, and market selection ⋮ Traffic congestion pricing via network congestion game approach ⋮ Efficient graph topologies in network routing games ⋮ Strategic basins of attraction, the path dominance core, and network formation games ⋮ Equilibrium in a finite local public goods economy ⋮ Internalization of social cost in congestion games ⋮ Potentials in cooperative TU-games ⋮ Urgency-aware optimal routing in repeated games through artificial currencies ⋮ Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach ⋮ A Shapley value representation of potential games ⋮ A comprehensive survey on STP approach to finite games ⋮ Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Weighted congestion games with separable preferences ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ Social learning in nonatomic routing games ⋮ Delegation and ambiguity in correlated equilibrium ⋮ Chaotic triopoly game: a congestion case ⋮ Computing equilibrium in network utility-sharing and discrete election games ⋮ Atomic congestion games with random players: network equilibrium and the price of anarchy ⋮ Two-terminal routing games with unknown active players ⋮ Load balancing congestion games and their asymptotic behavior ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure ⋮ A survey on decomposition of finite strategic-form games ⋮ Large deviations and stochastic stability in population games ⋮ A unifying approximate potential for weighted congestion games ⋮ Timed network games
Cites Work
This page was built for publication: A class of games possessing pure-strategy Nash equilibria
