Weighted Boolean formula games

DOI10.1007/978-3-319-24024-4_6MaRDI QIDQ3464467zbMATH OpenOpenAlexFDO

Authors Marios Mavronicolas, Burkhard Monien, K. W. Wagner

Publication date 27 January 2016

Published in Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24024-4_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Applications of game theory (91A80)

Recommendations

• Behavioural strategies in weighted Boolean games
• Logics in Artificial Intelligence
• The complexity of decision problems about equilibria in two-player Boolean games
• From Boolean game to potential game
• scientific article; zbMATH DE number 2243403

Cites work

• A 2.5n-Lower Bound on the Combinational Complexity of Boolean Functions
• A class of games having Pareto optimal Nash equilibria
• A class of games possessing pure-strategy Nash equilibria
• Algorithms – ESA 2005
• Bounded Query Classes
• Characterization of pure strategy equilibria infinite anonymous games
• Circuit size is nonlinear in depth
• Complete sets and the polynomial-time hierarchy
• Complexity classes of optimization functions
• Computationally Related Problems
• Computing correlated equilibria in multi-player games
• CONGESTION GAMES AND POTENTIALS RECONSIDERED
• Congestion Games with Player-Specific Constants
• Congestion games with player-specific payoff functions
• Cooperation and bounded recall
• Dependencies between players in Boolean games
• Effectivity functions and efficient coalitions in Boolean games
• Equilibria of Polymatrix Games
• Equilibria problems on games: complexity versus succinctness
• Exact analysis of Dodgson elections
• How easy is local search?
• scientific article; zbMATH DE number 47120 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2243403 (Why is no real title available?)
• scientific article; zbMATH DE number 3062453 (Why is no real title available?)
• Logics in Artificial Intelligence
• More complicated questions about maxima and minima, and some closures of NP
• New complexity results about Nash equilibria
• Non-cooperative games
• On Satisfiability Games and the Power of Congestion Games
• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• On the complexity of succinct zero-sum games
• Payoff dominance and the Stackelberg heuristic
• Potential games
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Selfish unsplittable flows
• Settling the complexity of computing two-player Nash equilibria
• Symmetries and the complexity of pure Nash equilibrium
• The complexity of computing a Nash equilibrium
• The complexity of decision problems about Nash equilibria in win-lose games
• The complexity of game isomorphism
• The complexity of optimization problems
• The complexity of pure Nash equilibria
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• The conjunctive complexity of quadratic Boolean functions
• The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
• The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
• The polynomial-time hierarchy
• The variable frame theory of focal points: An experimental study
• Unanimity games and Pareto optimality

Cited in

(5)

• From Boolean game to potential game
• Incentive-based search for equilibria in Boolean games
• Behavioural strategies in weighted Boolean games
• Boolean games with currency
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction

This page was built for publication: Weighted Boolean formula games

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