Sciweavers

60 search results - page 12 / 12
» DFA Learning of Opponent Strategies
Sort
View
ATAL
2003
Springer
13 years 10 months ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
CEC
2010
IEEE
13 years 6 months ago
Coordinate System Archive for coevolution
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
Wojciech Jaskowski, Krzysztof Krawiec
ATAL
2006
Springer
13 years 9 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
JAIR
2008
135views more  JAIR 2008»
13 years 5 months ago
On Similarities between Inference in Game Theory and Machine Learning
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
Iead Rezek, David S. Leslie, Steven Reece, Stephen...
GLOBECOM
2009
IEEE
13 years 8 months ago
Conjectural Equilibrium in Water-Filling Games
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
Yi Su, Mihaela van der Schaar