131 search results - page 23 / 27 » Opponent Modeling in Scrabble |
ANOR
2007
13 years 8 months ago
2007
This paper examines the investment behaviour of an incumbent and a potential entrant that are competing for a patent with a stochastic payo . We incorporate asymmetric information...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
TSMC
2010
13 years 2 months ago
2010
In mobile ad hoc networks, nodes have the inherent ability to move. Aside from conducting attacks to maximize their utility and cooperating with regular nodes to deceive them, mali...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...