25 search results - page 2 / 5 » Taking turns in general sum Markov games |
ENTCS
2006
13 years 11 months ago
2006
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
TIT
2008
13 years 10 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
UAI
2000
14 years 5 days ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
NETCOOP
2007
Springer
14 years 5 months ago
2007
Springer
We consider jamming in wireless networks with transmission cost for both transmitter and jammer. We use the framework of non-zerosum games. In particular, we prove the existence an...