GuaranteeNash for Boolean games is NEXP−hard

GuaranteeNash for Boolean games is NEXP−hard

Bibliografiska uppgifter
Huvudupphovsmän:	Ianovski, E, Ong, L
Materialtyp:	Conference item
Publicerad:	2014

Liknande verk

Complexity of mixed equilibria in boolean games
av: Ianovski, E
Publicerad: (2016)

Simulating cardinal preferences in Boolean games: A proof technique
av: Ianovski, E, et al.
Publicerad: (2018)

The complexity of decision problems about equilibria in two-player Boolean games
av: Ianovski, E, et al.
Publicerad: (2018)

Expressiveness and Nash equilibrium in iterated Boolean games
av: Gutierrez, J, et al.
Publicerad: (2021)

Expressiveness and Nash equilibrium in iterated Boolean games
av: Gutierrez, J, et al.
Publicerad: (2016)

Hard and Soft Preparation Sets in Boolean Games
av: Harrenstein, B, et al.
Publicerad: (2015)

Pure Nash Equilibria: Hard and Easy Games
av: Gottlob, G, et al.
Publicerad: (2005)

Pure Nash equilibria: hard and easy games
av: Gottlob, G, et al.
Publicerad: (2003)

A posteriori probabilistic feasibility guarantees for Nash equilibria in uncertain multi-agent games
av: Pantazis, G, et al.
Publicerad: (2021)

Boolean Hedonic Games
av: Aziz, H, et al.
Publicerad: (2016)

Iterated Boolean games
av: Gutierrez, J, et al.
Publicerad: (2013)

Iterated Boolean games
av: Gutierrez, J, et al.
Publicerad: (2015)

Incentive Engineering for Boolean Games.
av: Endriss, U, et al.
Publicerad: (2011)

Characterising the manipulability of Boolean games
av: Harrenstein, BP, et al.
Publicerad: (2017)

Behavioural strategies in weighted boolean games
av: Han, D, et al.
Publicerad: (2020)

Iterated Boolean games for rational verification
av: Gutierrez, J, et al.
Publicerad: (2017)

Relaxing Exclusive Control in Boolean Games
av: Francesco Belardinelli, et al.
Publicerad: (2017-07-01)

John Nash and evolutionary game theory.
av: Young, H
Publicerad: (2009)

Approximate Solutions for Nash Differential Games
av: A. A. Megahed, et al.
Publicerad: (2023-01-01)

Uniqueness of Nash equilibrium in vaccination games
av: Fan Bai
Publicerad: (2016-01-01)

The replicator dynamics of generalized Nash games
av: Jason Lequyer, et al.
Publicerad: (2021-05-01)

On stability in game problems of finding Nash set
av: Sergey E. Bukhtoyarov, et al.
Publicerad: (2005-01-01)

On a hierarchy of Boolean functions hard to compute in constant depth
av: Anna Bernasconi
Publicerad: (2001-01-01)

A terrorism-based differential game: Nash differential game
av: Abd El-Monem A. Megahed
Publicerad: (2021-11-01)

A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
av: Pantazis, G, et al.
Publicerad: (2024)

Distributed robust Lasso-MPC based on Nash optimization for smart grid: Guaranteed robustness and stability
av: Hossein Ahmadian, et al.
Publicerad: (2024-11-01)

Rational Verification in Iterated Electric Boolean Games
av: Youssouf Oualhadj, et al.
Publicerad: (2016-07-01)

Nash and perfect equilibria of discounted repeated games
av: Fudenberg, Drew, et al.
Publicerad: (2011)

On the complexity of Nash equilibria of action-graph games
av: Daskalakis, Constantinos, et al.
Publicerad: (2012)

Nash equilibria in concurrent games with lexicographic preferences
av: Gutierrez, J, et al.
Publicerad: (2017)

One class of Nash equilibria in bimatrix games
av: Aneta Gracjana Blaževič, et al.
Publicerad: (2002-12-01)

Bertrand Game with Nash Bargaining Fairness Concern
av: Wentao Yi, et al.
Publicerad: (2019-01-01)

Pure Nash Equilibria in Concurrent Deterministic Games
av: Patricia Bouyer, et al.
Publicerad: (2015-06-01)

The Complexity of Nash Equilibria in Stochastic Multiplayer Games
av: Michael Ummels, et al.
Publicerad: (2011-09-01)

Indirect Dynamic Negotiation in the Nash Demand Game
av: Tatiana V. Guy, et al.
Publicerad: (2022-01-01)

Nash Equilibria in Symmetric Games with Partial Observation
av: Patricia Bouyer, et al.
Publicerad: (2014-04-01)

Computation of Nash equilibria in three-personmatrix game
av: Sigutė Vakarinienė, et al.
Publicerad: (2009-12-01)

Nash equilibrium seeking for N-coalition noncooperative games
av: Ye, Maojiao, et al.
Publicerad: (2020)

The complexity of Nash equilibria in multiplayer zero-sum games and coordination games
av: Cai, Yang, Ph. D. Massachusetts Institute of Technology
Publicerad: (2011)

Operant Matching as a Nash Equilibrium of an Intertemporal Game
av: Loewenstein, Yonatan, et al.
Publicerad: (2011)