60 search results - page 10 / 12 » DFA Learning of Opponent Strategies |
ML
2006
ACM
13 years 9 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...
ICML
2003
IEEE
14 years 10 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
AI
2007
Springer
14 years 4 months ago
2007
Springer
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
MLG
2007
Springer
14 years 3 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-ter...