The following pages link to (Q5715720):
Displaying 50 items.
- A mixed cooperative dual to the Nash equilibrium (Q275881) (← links)
- Norm-based mechanism design (Q322076) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs (Q420790) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Action-graph games (Q625044) (← links)
- Equilibria of graphical games with symmetries (Q627165) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Computing equilibria in discounted dynamic games (Q668745) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Ranking games (Q835803) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria (Q845734) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- Dependencies between players in Boolean games (Q962907) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints (Q1029586) (← links)
- On discrete preferences and coordination (Q1686225) (← links)
- 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 (Q1718839) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Manipulating games by sharing information (Q2016078) (← links)
- Computing equilibrium in network utility-sharing and discrete election games (Q2082218) (← links)
- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
- On congestion games with player-specific costs and resource failures (Q2151881) (← links)
- The communication complexity of graphical games on grid graphs (Q2190386) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Directed graphical structure, Nash equilibrium, and potential games (Q2417148) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach (Q2510117) (← links)
- On basis and pure Nash equilibrium of finite pure harmonic games (Q2674935) (← links)
- Rational generating functions and integer programming games (Q2893918) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- Dependencies Between Players in Boolean Games (Q3524987) (← links)
- Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph (Q5013401) (← links)
- Pure Nash Equilibria in Resource Graph Games (Q5026179) (← links)
- The Polymatrix Gap Conjecture (Q5038398) (← links)
- A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850) (← links)
