Pages that link to "Item:Q5900524"
From MaRDI portal
The following pages link to Computing correlated equilibria in multi-player games (Q5900524):
Displayed 45 items.
- A linear-time algorithm for trust region problems (Q304248) (← links)
- Computation of correlated equilibrium with global-optimal expected social welfare (Q415417) (← links)
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Generalized correlated equilibrium for two-person games in extensive form with perfect information (Q539469) (← links)
- Action-graph games (Q625044) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Properties and applications of dual reduction (Q976771) (← links)
- The query complexity of correlated equilibria (Q1651292) (← links)
- Selecting efficient correlated equilibria through distributed learning (Q1682711) (← links)
- Correlated equilibrium in a nutshell (Q1698976) (← links)
- Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition (Q1706316) (← links)
- Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments (Q1712152) (← links)
- Symmetric games revisited (Q1737120) (← links)
- Learning to play efficient coarse correlated equilibria (Q1741209) (← links)
- Correlated equilibrium of games in fuzzy environment (Q2035290) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Solving possibilistic games with incomplete information (Q2077019) (← links)
- Defense coordination in security games: equilibrium analysis and mechanism design (Q2093398) (← links)
- A survey on decomposition of finite strategic-form games (Q2094087) (← links)
- Strong robustness to incomplete information and the uniqueness of a correlated equilibrium (Q2150438) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- The communication complexity of graphical games on grid graphs (Q2190386) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Bargaining and cooperation in strategic form games with suspended realizations of threats (Q2453427) (← links)
- Belief-invariant and quantum equilibria in games of incomplete information (Q2664942) (← links)
- BLUEPRINT FOR AN ALGORITHMIC ECONOMICS (Q2873501) (← links)
- Multilinear Games (Q2959817) (← links)
- Inverse Game Theory: Learning Utilities in Succinct Games (Q3460806) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- (Q4638112) (← links)
- Efficient Online Linear Optimization with Approximation Algorithms (Q4991673) (← links)
- (Q5009504) (← links)
- Coordination Games on Weighted Directed Graphs (Q5085129) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- Games of incomplete information: a framework based on belief functions (Q5918578) (← links)
- Games of incomplete information: a framework based on belief functions (Q5918697) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Provably efficient reinforcement learning in decentralized general-sum Markov games (Q6159512) (← links)