Simulating cardinal preferences in Boolean games: a proof technique

DOI10.1016/J.IC.2017.09.008MaRDI QIDQ1641024zbMATH OpenOpenAlexFDO

Authors Egor Ianovski, Luke Ong

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Recommendations

• The complexity of decision problems about equilibria in two-player Boolean games
• Logics in Artificial Intelligence
• Łukasiewicz games: a logic-based approach to quantitative strategic interactions
• Dependencies between players in Boolean games
• Effectivity functions and efficient coalitions in Boolean games

Cites work

• scientific article; zbMATH DE number 3069631 (Why is no real title available?)
• Algorithms and Computation
• Bad equilibria (and what to do about them)
• Boolean games with epistemic goals
• Complementary pivot theory of mathematical programming
• Complexity of rational and irrational Nash equilibria
• Delegating decisions in strategic settings
• Dependencies between players in Boolean games
• Dependency in cooperative Boolean games
• Effectivity functions and efficient coalitions in Boolean games
• Equilibria problems on games: complexity versus succinctness
• Equilibrium computation for two-player games in strategic and extensive form
• Fast algorithms for finding randomized strategies in game trees
• Logics in Artificial Intelligence
• Mathematical Foundations of Computer Science 2005
• Nash and correlated equilibria: Some complexity considerations
• New complexity results about Nash equilibria
• Non-cooperative games
• On Satisfiability Games and the Power of Congestion Games
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
• Polynomial algorithms in linear programming
• The Complexity of Enumeration and Reliability Problems
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• The approximation complexity of win-lose games
• The complexity of decision problems about Nash equilibria in win-lose games
• Theory of games and economic behavior.

Cited in

(5)

• Łukasiewicz games: a logic-based approach to quantitative strategic interactions
• scientific article; zbMATH DE number 3860925 (Why is no real title available?)
• Hard and soft preparation sets in Boolean games
• The complexity of decision problems about equilibria in two-player Boolean games
• Behavioural strategies in weighted Boolean games

This page was built for publication: Simulating cardinal preferences in Boolean games: a proof technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1641024)