Weighted Boolean Formula Games (Q3464467)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Weighted Boolean Formula Games	scientific article

Statements

scholarly article

0 references

Weighted Boolean Formula Games (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-24024-4_6

0 references

Marios Mavronicolas

0 references

Burkhard Monien

0 references

Klaus W. Wagner

0 references

Algorithms, Probability, Networks, and Games

0 references

publication date

27 January 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-24024-4_6

0 references

0 references

Equilibria problems on games: complexity versus succinctness

0 references

Cooperation and bounded recall

0 references

The variable frame theory of focal points: An experimental study

0 references

On Satisfiability Games and the Power of Congestion Games

0 references

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games

0 references

Characterization of pure strategy equilibria infinite anonymous games

0 references

Dependencies between players in Boolean games

0 references

Effectivity functions and efficient coalitions in Boolean games

0 references

Symmetries and the complexity of pure Nash equilibrium

0 references

A class of games having Pareto optimal Nash equilibria

0 references

Settling the complexity of computing two-player Nash equilibria

0 references

Payoff dominance and the Stackelberg heuristic

0 references

New complexity results about Nash equilibria

0 references

The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games

0 references

The Complexity of Computing a Nash Equilibrium

0 references

Algorithms – ESA 2005

0 references

On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games

0 references

Logics in Artificial Intelligence

0 references

The complexity of pure Nash equilibria

0 references

The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

0 references

On the complexity of succinct zero-sum games

0 references

Selfish unsplittable flows

0 references

The complexity of game isomorphism

0 references

Routing (un-) splittable flow in games with player-specific affine latency functions

0 references

0 references

0 references

0 references

Exact analysis of Dodgson elections

0 references

Equilibria of Polymatrix Games

0 references

How easy is local search?

0 references

Unanimity games and Pareto optimality

0 references

The complexity of optimization problems

0 references

Congestion Games with Player-Specific Constants

0 references

Congestion games with player-specific payoff functions

0 references

Potential games

0 references

Non-cooperative games

0 references

0 references

Computing correlated equilibria in multi-player games

0 references

Circuit size is nonlinear in depth

0 references

A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions

0 references

A class of games possessing pure-strategy Nash equilibria

0 references

Computationally Related Problems

0 references

The Computational Complexity of Nash Equilibria in Concisely Represented Games

0 references

The polynomial-time hierarchy

0 references

Complexity classes of optimization functions

0 references

CONGESTION GAMES AND POTENTIALS RECONSIDERED

0 references

More complicated questions about maxima and minima, and some closures of NP

0 references

Bounded Query Classes

0 references

The conjunctive complexity of quadratic Boolean functions

0 references

Complete sets and the polynomial-time hierarchy

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3464467

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3464467&oldid=36225889"