Sciweavers

1167 search results - page 148 / 234
» Relational Markov Games
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 2 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
ATAL
2006
Springer
14 years 1 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
JELIA
2000
Springer
14 years 1 months ago
A Logic for Modeling Decision Making with Dynamic Preferences
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
Marina De Vos, Dirk Vermeir
NGC
2000
Springer
109views Communications» more  NGC 2000»
14 years 1 months ago
Router level filtering for receiver interest delivery
Delivering data to on-line game participants requires the game data to be "customized" in real-time to each participant's characteristics. Using multicast in such a...
Manuel M. Oliveira, Jon Crowcroft, Christophe Diot
IJCAI
2003
13 years 11 months ago
A Formalization of Equilibria for Multiagent Planning
Planning has traditionally focused on single agent systems. Although planning domain languages have been extended to multiagent domains, solution concepts have not. Previous solut...
Michael H. Bowling, Rune M. Jensen, Manuela M. Vel...