Weighted Boolean Formula Games
From MaRDI portal
Publication:3464467
DOI10.1007/978-3-319-24024-4_6zbMath1331.68112OpenAlexW2095964688MaRDI QIDQ3464467
Burkhard Monien, Marios Mavronicolas, Klaus 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
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Applications of game theory (91A80)
Related Items (3)
Behavioural strategies in weighted Boolean games ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction ⋮ Incentive-based search for equilibria in Boolean games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effectivity functions and efficient coalitions in Boolean games
- The complexity of game isomorphism
- Equilibria problems on games: complexity versus succinctness
- Unanimity games and Pareto optimality
- Cooperation and bounded recall
- The conjunctive complexity of quadratic Boolean functions
- The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
- New complexity results about Nash equilibria
- Dependencies between players in Boolean games
- Symmetries and the complexity of pure Nash equilibrium
- On the complexity of succinct zero-sum games
- The complexity of optimization problems
- More complicated questions about maxima and minima, and some closures of NP
- How easy is local search?
- Circuit size is nonlinear in depth
- The polynomial-time hierarchy
- Complete sets and the polynomial-time hierarchy
- The variable frame theory of focal points: An experimental study
- Payoff dominance and the Stackelberg heuristic
- Characterization of pure strategy equilibria infinite anonymous games
- Potential games
- Complexity classes of optimization functions
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- A class of games having Pareto optimal Nash equilibria
- Selfish unsplittable flows
- Non-cooperative games
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
- Routing (un-) splittable flow in games with player-specific affine latency functions
- Settling the complexity of computing two-player Nash equilibria
- Bounded Query Classes
- Congestion Games with Player-Specific Constants
- The complexity of pure Nash equilibria
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
- Exact analysis of Dodgson elections
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games
- Computationally Related Problems
- The Complexity of Computing a Nash Equilibrium
- Logics in Artificial Intelligence
- On Satisfiability Games and the Power of Congestion Games
- Algorithms – ESA 2005
- Equilibria of Polymatrix Games
- Computing correlated equilibria in multi-player games
This page was built for publication: Weighted Boolean Formula Games