Simulating cardinal preferences in Boolean games: a proof technique
type: Item
instance of: scholarly article
title: Simulating cardinal preferences in Boolean games: a proof technique
zbMATH Open document ID: 1395.68256
author: Egor Ianovski
author: Luke Ong
published in: Information and Computation
publication date: 2018-06-14T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6889869
MaRDI profile type: Publication
OpenAlex ID: W2795410054
cites work: Boolean Games with Epistemic Goals
cites work: Algorithms and Computation
cites work: Mathematical Foundations of Computer Science 2005
cites work: Equilibria problems on games: complexity versus succinctness
cites work: On Satisfiability Games and the Power of Congestion Games
cites work: Complexity of Rational and Irrational Nash Equilibria
cites work: The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games
cites work: Dependencies between players in Boolean games
cites work: Effectivity functions and efficient coalitions in Boolean games
cites work: Q2934593
cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
cites work: New complexity results about Nash equilibria
cites work: Complementary pivot theory of mathematical programming
cites work: Q5808751
cites work: Logics in Artificial Intelligence
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: Polynomial algorithms in linear programming
cites work: Fast algorithms for finding randomized strategies in game trees
cites work: Q3457252
cites work: Non-cooperative games
cites work: Dependency in Cooperative Boolean Games
cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Theory of games and economic behavior.
cites work: Q3524712
cites work: Q3457195
DOI: 10.1016/J.IC.2017.09.008
description: scientific article; zbMATH DE number 6889869