In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Peer-to-peer communication is emerging as one of the most potentially disruptive technologies in the networking sector. If the interest in such technologies as Napster, Morpheus a...
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...