Sciweavers

128 search results - page 1 / 26
» Representation and Complexity in Boolean Games
Sort
View
JELIA
2004
Springer
14 years 4 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
ATAL
2009
Springer
14 years 5 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
DLOG
2009
13 years 8 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
DAGSTUHL
2006
14 years 7 days ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
ERSHOV
2003
Springer
14 years 4 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...