1754 search results - page 69 / 351 » Games with Incomplete Information |
CN
2004
13 years 7 months ago
2004
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
AAAI
1998
13 years 9 months ago
1998
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message....
CG
2008
Springer
13 years 9 months ago
2008
Springer
Since Chase and Simon presented their influential paper on perception in chess in 1973, the use of chunks has become the subject of a number of studies into the cognitive behavior ...