scientific article; zbMATH DE number 2243403
From MaRDI portal
zbMath1134.91312arXiv1109.2152MaRDI QIDQ5715720
Gianluigi Greco, Francesco Scarcello, Georg Gottlob
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1109.2152
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
A mixed cooperative dual to the Nash equilibrium, The Polymatrix Gap Conjecture, Some results of Maria Serna on strategic games: complexity of equilibria and models, On the Complexity of Pareto-optimal Nash and Strong Equilibria, Ranking games, On the complexity of constrained Nash equilibria in graphical games, How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium, The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria, A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games, Norm-based mechanism design, Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results, On congestion games with player-specific costs and resource failures, Weighted Boolean Formula Games, On the complexity of Pareto-optimal Nash and strong equilibria, Directed graphical structure, Nash equilibrium, and potential games, On discrete preferences and coordination, The communication complexity of graphical games on grid graphs, Public goods games in directed networks, Action-graph games, Equilibria of graphical games with symmetries, A Metaheuristic Approach to Compute Pure Nash Equilibria, On the Complexity of Equilibria Problems in Angel-Daemon Games, On parameterized complexity of binary networked public goods game, Dependencies Between Players in Boolean Games, Computational aspects of uncertainty profiles and angel-daemon games, On Sparse Discretization for Graphical Games, A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form, Equilibria problems on games: complexity versus succinctness, New complexity results about Nash equilibria, The complexity of uniform Nash equilibria and related regular subgraph problems, Computing equilibria in discounted dynamic games, Equilibrium paths in discounted supergames, Efficiently enumerating minimal triangulations, Dependencies between players in Boolean games, Constraint games for stable and optimal allocation of demands in SDN, Connectivity and equilibrium in random games, Manipulating games by sharing information, Interdependent defense games with applications to internet security at the level of autonomous systems, On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach, Symmetries and the complexity of pure Nash equilibrium, On the Hardness and Existence of Quasi-Strict Equilibria, Comparing the notions of optimality in CP-nets, strategic games and soft constraints, Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph, Pure Nash equilibria in graphical games and treewidth, Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT, Pure Nash Equilibria in Resource Graph Games
