7 citations found. Retrieving documents...
D. Billings. The first international roshambo programming competition. International Computer Games Association Journal, 23(1):3--8, 42--50, 2000.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Language for Descriptive Decision and Game Theory - Pfeffer, Gal (2002)   (Correct)

....decision problems. Finally, agents may model other agents as boundedly rational, thereby becoming boundedly rational them selves. The work in this paper was inspired by the recent research on opponent modeling in games, and in par ticular by the RoShamBo (rock paper scissors) competition [2]. In the competition, programs com peted against each other in a series of 1000 games of Roshambo. Nash equilibrium players came in the middle of the pack. The winner of the competition was a program called Iocaine Powder [4] that did a beautiful job of modeling its opponents on multiple levels. ....

D. Billings. The first international RoShamBo programming competition. International Com- purer Games Association Journal, 23(1), March 2000.


Approximating Game-Theoretic Optimal Strategies for .. - Billings, Burch.. (2003)   (7 citations)  Self-citation (Billings)   (Correct)

No context found.

D. Billings. The first international roshambo programming competition. International Computer Games Association Journal, 23(1):3--8, 42--50, 2000.


Artificial Intelligence 134 (2002) 201--240 - The Challenge Of (2002)   (165 citations)  Self-citation (Billings)   (Correct)

No context found.

D. Billings, The first international RoShamBo programming competition, Internat. Comput. Games Assoc. J. 23 (1) (2000) 42--50.


Approximating Game-Theoretic Optimal Strategies for.. - Billings Burch Davidson (2003)   (7 citations)  Self-citation (Billings)   (Correct)

No context found.

D. Billings. The first international roshambo programming competition. International Computer Games Association Journal, 23(1):3--8, 42--50, 2000.


Approximating Game-Theoretic Optimal Strategies for.. - Billings Burch Davidson (2003)   (7 citations)  Self-citation (Billings)   (Correct)

....by observing the opponent for patterns or weaknesses. In a simple game like RoShamBo (also known as RockPaper Scissors) playing the optimal strategy ensures a breakeven result, regardless of what the opponent does, and is therefore insufficient to defeat weak opponents, or to win a tournament ([Billings, 2000]) Poker is more complex, and in theory an optimal player can win, but only if the opponent makes dominated errors. Any time a player makes any choice that is part of a randomized mixed strategy of some game theoretic optimal policy, that decision is not dominated. In other words, it is possible ....

D. Billings. The first international roshambo programming competition. International Computer Games Association Journal, 23(1):3--8, 42--50, 2000.


A Language for Modeling Agents' Decision Making Processes in.. - Gal, Pfeffer (2003)   (5 citations)  (Correct)

No context found.

D. Billings. The first international RoShamBo programming competition. International Computer Games Association Journal, 23(1), March 2000.


A Language for Opponent Modeling in Repeated Games - Gal, Pfeffer (2003)   (5 citations)  (Correct)

No context found.

D. Billings. The first international RoShamBo programming competition. International Computer Games Association Journal, 23(1), March 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC