On the computational complexity of games with uncertainty
From MaRDI portal
Cites work
- A Complementarity Framework for Forward Contracting Under Uncertainty
- A Multiple Leader Stackelberg Model and Analysis
- A Social Equilibrium Existence Theorem*
- A stochastic multiple-leader Stackelberg model: analysis, computation, and application
- Analysis on the forward market equilibrium model
- Bilevel and multilevel programming: A bibliography review
- Bilevel linear programming
- Coalition-proof Nash equilibria. I: Concepts
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Decision making under uncertainty in electricity markets
- Discounted robust stochastic games and an application to queueing control
- Dynamic noncooperative game theory
- Equilibrium points in n -person games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Existence, uniqueness, and computation of robust Nash equilibria in a class of multi-leader-follower games
- Game theory on the blockchain: a model for games with smart contracts
- Games with Incomplete Information Played by ‘Bayesian’ Players, Part III. The Basic Probability Distribution of the Game
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Generalized Nash equilibrium problems
- Generalized Nash games and quasi-variational inequalities
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 2212211 (Why is no real title available?)
- Introduction to stochastic programming.
- Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets
- Mathematical Programs with Equilibrium Constraints
- Multi-leader-follower games: models, methods and applications
- Nash and correlated equilibria: Some complexity considerations
- Non-cooperative games
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On the complexity of the parity argument and other inefficient proofs of existence
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Robust game theory
- Robust Nash equilibria in \(4\)-person non-cooperative games: uniqueness and reformulation
- Robust newsvendor competition under asymmetric information
- Settling the complexity of computing two-player Nash equilibria
- Stochastic equilibrium problems and stochastic mathematical programs with equilibrium constraints: a survey
- The Generalized Quasi-Variational Inequality Problem
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
- Variational inequality formulation of a class of multi-leader-follower games
This page was built for publication: On the computational complexity of games with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902182)
