1599 search results - page 101 / 320 » Algorithms for Parity Games |
172
click to vote
FLAIRS
2011
14 years 10 months ago
2011
In a competitive game it is important to identify the opponent’s strategy as quickly and accurately as possible so that an effective response can be staged. In this vain, this p...
188
click to vote
SBP
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Firms’ conjectures about demand are consequential in oligopoly games. Through agent-based modeling of consumers’ search for products, we can study the rationing of de...
168
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
174
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
190
click to vote
MSS
2000
IEEE
15 years 10 months ago
2000
IEEE
Phoenix is a fault-tolerantreal-time network-attachedstorage device (NASD). Like other NASD architectures, Phoenix provides an object-based interface to data stored on network-att...