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 )...
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...
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...
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
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...