Simulating cardinal preferences in Boolean games: a proof technique
From MaRDI portal
Publication:1641024
DOI10.1016/j.ic.2017.09.008zbMath1395.68256OpenAlexW2795410054MaRDI QIDQ1641024
Publication date: 14 June 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:48f08657-4077-4cd9-b6af-8b86ab6ab771
Applications of game theory (91A80) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effectivity functions and efficient coalitions in Boolean games
- Equilibria problems on games: complexity versus succinctness
- New complexity results about Nash equilibria
- Dependencies between players in Boolean games
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
- Nash and correlated equilibria: Some complexity considerations
- Complementary pivot theory of mathematical programming
- Non-cooperative games
- Fast algorithms for finding randomized strategies in game trees
- Boolean Games with Epistemic Goals
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Complexity of Rational and Irrational Nash Equilibria
- The Complexity of Enumeration and Reliability Problems
- Polynomial algorithms in linear programming
- The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games
- Dependency in Cooperative Boolean Games
- Logics in Artificial Intelligence
- On Satisfiability Games and the Power of Congestion Games
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
This page was built for publication: Simulating cardinal preferences in Boolean games: a proof technique
