800 search results - page 86 / 160 » On the Complexity of Parity Games |
SIAMDM
2002
13 years 8 months ago
2002
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
ICS
2009
Tsinghua U.
14 years 3 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
ACMICEC
2003
ACM
14 years 2 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
NETGAMES
2006
ACM
14 years 3 months ago
2006
ACM
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...