scientific article
From MaRDI portal
Publication:3524711
zbMath1151.91381MaRDI QIDQ3524711
Publication date: 12 September 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Ranking games ⋮ The computational complexity of iterated elimination of dominated strategies ⋮ Equilibrium computation of the Hart and Mas-Colell bargaining model ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ Complexity of stability in trading networks ⋮ Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection ⋮ Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach ⋮ Uniqueness of stationary equilibrium payoffs in coalitional bargaining ⋮ Computational aspects of uncertainty profiles and angel-daemon games ⋮ Equilibria and efficiency loss in games on networks ⋮ Stochastic Games ⋮ Nash equilibria in symmetric graph games with partial observation ⋮ Computing solutions of the paintshop-necklace problem ⋮ Imitation games and computation ⋮ Critical infrastructure protection using secrecy -- a discrete simultaneous game ⋮ Model Checking Strategic Equilibria ⋮ On the complexity of stable fractional hypergraph matching ⋮ The Complexity of Contracts ⋮ Uncomputability and undecidability in economic theory
This page was built for publication:
