Congestion games with player-specific payoff functions
From MaRDI portal
Publication:1915710
DOI10.1006/game.1996.0027zbMath0848.90131OpenAlexW2102736491MaRDI QIDQ1915710
Publication date: 1 July 1996
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8bb011a6a54499b8046b02c1881ed4112cd4c902
Related Items
Congestion Games with Complementarities, On the Complexity of Pareto-optimal Nash and Strong Equilibria, The complexity of welfare maximization in congestion games, On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games, Unnamed Item, Price competition with elastic traffic, Weighted Boolean Formula Games, CONGESTION GAMES AND POTENTIALS RECONSIDERED, Coordination Games on Weighted Directed Graphs, Fair allocation of indivisible goods: beyond additive valuations, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Sharing Non-anonymous Costs of Multiple Resources Optimally, Social welfare in search games with asymmetric information, Equilibria in bottleneck games, Cost-sharing games with rank-based utilities, Optimal Cost-Sharing in General Resource Selection Games, Congestion Games with Mixed Objectives, Using Temporal Dummy Players in Cost-Sharing Games, Exact price of anarchy for weighted congestion games with two players, Price of Anarchy in Networks with Heterogeneous Latency Functions, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Restoring Pure Equilibria to Weighted Congestion Games, COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER RESTRICTED NETWORK CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE, Learning in games by random sampling, Malicious Bayesian Congestion Games, Congestion Games with Variable Demands, Computing Nash equilibria for scheduling on restricted parallel links, The uniqueness property for networks with several origin-destination pairs, On the Existence of Pure Nash Equilibria in Weighted Congestion Games, Window-Games between TCP Flows, Subjective vs. Objective Reality — The Risk of Running Late, On existence of equilibrium under social coalition structures, Cost-sharing games in real-time scheduling systems, The price of anarchy in nonatomic consumption-relevance congestion games, Cost-sharing games in real-time scheduling systems, Project games, Efficiency of Equilibria in Uniform Matroid Congestion Games, Strong and Weak Acyclicity in Iterative Voting, Network investment games with Wardrop followers, Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach, Asynchronous Congestion Games, Convergence Dynamics of Graphical Congestion Games, Value of Information in Bayesian Routing Games, Location–Price Competition in Mobile Operator Market, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks, Selfish unsplittable flows, Equilibria in Multiclass and Multidimensional Atomic Congestion Games, Pure Nash equilibria in restricted budget games, Pure Nash Equilibria in Resource Graph Games, A survey of static and dynamic potential games, Matrix approach to verification of finite multi-potential games, The complexity of equilibria for risk-modeling valuations, Congestion games with load-dependent failures: Identical resources, Optimal cost sharing for capacitated facility location games, Congestion games with mixed objectives, Coordination mechanisms, An application of optimization theory to the study of equilibria for games: a survey, Ordinal status games on networks, Weighted and near weighted potential games with application to game theoretic control, Efficient coordination mechanisms for unrelated machine scheduling, Strong equilibria in games with the lexicographical improvement property, Cost-sharing scheduling games on restricted unrelated machines, When ignorance helps: graphical multicast cost sharing games, The cutting power of preparation, On the convergence of multicast games in directed networks, Congestion games revisited, Vector space structure of finite evolutionary games and its application to strategy profile convergence, On congestion games with player-specific costs and resource failures, A universal construction generating potential games, Vector games with potential function, Network topology and the efficiency of equilibrium, Bio-inspired paradigms in network engineering games, Mean field linear quadratic games with set up costs, Strong equilibrium in congestion games, Pure strategy Nash equilibrium in a group formation game with positive externalities, On the complexity of Pareto-optimal Nash and strong equilibria, On the structure of weakly acyclic games, Computing pure Nash and strong equilibria in bottleneck congestion games, Representation of finite games as network congestion games, Coordination games on graphs, Iterative voting and acyclic games, Weakly-acyclic (internet) routing games, Timing matters: online dynamics in broadcast games, Action-graph games, Equilibria in a class of aggregative location games, The power of one evil secret agent, Cournot tâtonnement and dominance solvability in finite games, Congestion games with capacitated resources, Minimizing expectation plus variance, Convergence to approximate Nash equilibria in congestion games, On the performance of approximate equilibria in congestion games, Externality effects in the formation of societies, Dynamic club formation with coordination, Graphical congestion games, A logarithmic approximation for polymatroid congestion games, Congestion games with failures, Designing fast converging cost sharing methods for multicast transmissions, Characterizing the existence of potential functions in weighted congestion games, Nash equilibria: complexity, symmetries, and approximation, On finite potential games, Ordinal potentials in smooth games, On best response dynamics in weighted congestion games with polynomial delays, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Scheduling to maximize participation, Cournot tatonnement and potentials, On the existence of a pure strategy Nash equilibrium in group formation games, Best-response potential games, On convergence rates of game theoretic reinforcement learning algorithms, Sparse covers for sums of indicators, The complexity of pure equilibria in mix-weighted congestion games on parallel links, Network topology and equilibrium existence in weighted network congestion games, Strong Nash equilibrium in games with common and complementary local utilities, Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game, A new model for selfish routing, Selfish routing with incomplete information, Paradoxes in social networks with multiple products, Nash equilibria in discrete routing games with convex latency functions, A game-theoretical model of the landscape theory, Approximate Nash equilibria in anonymous games, Acyclicity of improvements in finite game forms, On pure conjectural equilibrium with non-manipulable information, Coalition formation with local public goods and group-size effect, Games of social interactions with local and global externalities, Stability and segregation in group formation, Nash equilibrium in compact-continuous games with a potential, Best response dynamics in finite games with additive aggregation, Evolutionary equilibrium in Bayesian routing games: specialization and niche formation, Taxed congestion games with failures, Window-games between TCP flows, Facets of the fully mixed Nash equilibrium conjecture, The emergence of rational behavior in the presence of stochastic perturbations, Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms, 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, Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes, Potentials in cooperative TU-games, Social media as author-audience games, Weighted congestion games with separable preferences, Decentralized inertial best-response with voluntary and limited communication in random communication networks, Two-terminal routing games with unknown active players, Cooperative congestion games: existence of a Nash-stable coalition structure, Characterization of pure strategy equilibria infinite anonymous games, The distributed Kolkata paise restaurant game, Location-price competition in airline networks, Escaping Braess's paradox through approximate Caratheodory's theorem, Equilibria in ordinal status games, A classification of weakly acyclic games
