Sciweavers

973 search results - page 8 / 195
» Arguing Using Opponent Models
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
14 years 23 days ago
Game-Theoretic Learning Using the Imprecise Dirichlet Model
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...
Erik Quaeghebeur, Gert de Cooman
ATAL
2004
Springer
14 years 27 days ago
A Bayes Net Approach to Argumentation
Argumentation-based negotiation approaches have been proposed to present realistic negotiation contexts. This paper presents a novel Bayesian network based argumentation and decis...
Sabyasachi Saha, Sandip Sen
ICML
2005
IEEE
14 years 8 months ago
Hedged learning: regret-minimization with learning experts
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
Yu-Han Chang, Leslie Pack Kaelbling
MLMTA
2003
13 years 8 months ago
Using a Two-Layered Case-Based Reasoning for Prediction in Soccer Coach
Abstract— The prediction of the future states in MultiAgent Systems has been a challenging problem since the begining of MAS. Robotic soccer is a MAS environment in which the pre...
Mazda Ahmadi, Abolfazl Keighobadi Lamjiri, Mayssam...