نتایج جستجو برای: markov games

تعداد نتایج: 126585  

2017
J. van der Wal J. Wessels

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

Journal: :Web Intelligence and Agent Systems 2003
Ville Könönen

A novel model for asymmetric multiagent reinforcement learning is introduced in this paper. The model addresses the problem where the information states of the agents involved in the learning task are not equal; some agents (leaders) have information how their opponents (followers) will select their actions and based on this information leaders encourage followers to select actions that lead to...

2015
Attila Ambrus Yuhta Ishii

This paper shows that asynchronicity of moves can lead to a unique prediction in coordination games, in an infinite-horizon setting, under certain conditions on off-equilibrium payoffs. In two-player games we derive necessary and sufficient conditions for play ultimately being absorbed in the Pareto dominant Nash equilibrium of the stage game, for every Markov perfect equilibrium. For players p...

2017
Julien Pérolat Florian Strub Bilal Piot Olivier Pietquin

This paper addresses the problem of learning a Nash equilibrium in γ-discounted multiplayer general-sum Markov Games (MGs) in a batch setting. As the number of players increases in MG, the agents may either collaborate or team apart to increase their final rewards. One solution to address this problem is to look for a Nash equilibrium. Although, several techniques were found for the subcase of ...

Journal: :CoRR 2011
Truong-Huy Dinh Nguyen David Hsu Wee Sun Lee Tze-Yun Leong Leslie Pack Kaelbling Tomás Lozano-Pérez Andrew Haydn Grant

We apply decision theoretic techniques to construct nonplayer characters that are able to assist a human player in collaborative games. The method is based on solving Markov decision processes, which can be difficult when the game state is described by many variables. To scale to more complex games, the method allows decomposition of a game task into subtasks, each of which can be modelled by a...

2016
Laëtitia Matignon Guillaume J. Laurent Nadine Le Fort-Piat

In the framework of fully cooperative multi-agent systems, independent agents learning by reinforcement must overcome several difficulties as the coordination or the impact of exploration. The study of these issues allows first to synthesize the characteristics of existing reinforcement learning decentralized methods for independent learners in cooperative Markov games. Then, given the difficul...

2013
Eitan Altman Ilaria Brunetti

In this paper we study one of the most well known examples of evolutionary games, the Hawk and Dove problem, in the dynamic framework of Markov Decision Evolutionary Games. We associate with each player an extra individual state depending on the age and on the strength of the individual. This state may change as a function of the actions taken by those it encounters. The goal of a player is to ...

Journal: :CoRR 2011
Frans A. Oliehoek Shimon Whiteson Matthijs T. J. Spaan

Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such problems can be modeled as collaborative Bayesian games in which each agent receives private information in the form of its type. However, representing and solving...

2011
Taolue Chen Marta Z. Kwiatkowska David Parker Aistis Simaitis

Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of efficient collaboration protocols, a typical example of which is team formation. In this paper, we illustrate how probabilistic model checking, a technique for formal verification of probabilistic systems, can be applied t...

2016
MARCIN PĘSKI JUUSO TOIKKA

We develop a theory of how the value of an agent’s information advantage depends on the persistence of information. We focus on strategic situations with strict conflict of interest, formalized as stochastic zero-sum games where only one of the players observes the state that evolves according to a Markov operator. Operator Q is said to be better for the informed player than operator P if the v...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید