Pages that link to "Item:Q5189544"
From MaRDI portal
The following pages link to The Complexity of Computing a Nash Equilibrium (Q5189544):
Displaying 50 items.
- Projections and functions of Nash equilibria (Q267106) (← links)
- A mixed cooperative dual to the Nash equilibrium (Q275881) (← links)
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium (Q298924) (← links)
- An application of optimization theory to the study of equilibria for games: a survey (Q301040) (← links)
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- On the approximation performance of fictitious play in finite games (Q378343) (← links)
- Economic models for cloud service markets: pricing and capacity planning (Q391260) (← links)
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
- Computation of equilibrium values in the Baron and Ferejohn bargaining model (Q894603) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes (Q1620199) (← links)
- Buying optimal payoffs in bi-matrix games (Q1630445) (← links)
- Evolutionary game theory: a renaissance (Q1651914) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin (Q1716851) (← links)
- Reductions in \textbf{PPP} (Q1730025) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Analytical complexity and errors of solving control problems for organizational and technical systems (Q1792540) (← links)
- Dynamics in network interaction games (Q1938382) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution (Q2007652) (← links)
- The complexity of the parity argument with potential (Q2037189) (← links)
- Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto (Q2052549) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Defense coordination in security games: equilibrium analysis and mechanism design (Q2093398) (← links)
- Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
- Bounded rationality in differential games: a reinforcement learning-based approach (Q2094046) (← links)
- Bounded rationality in learning, perception, decision-making, and stochastic games (Q2094047) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Characterising the intersection of QMA and coQMA (Q2099640) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
