Ontology Graph for this topic:
.
- A synthesis of game theory, decision theory, Bayesian learning in MAS scenario.
Jie Bao
since 2003-02-20
(Papers with code (like [KLS2001], with the initial letter of authors' surname and the year) have already been added into the ontology graph)
Related bibliography
Ontology Graph for this topic:
.
(2003-03-04)
Game Theory and Decision Theory in Multi-Agent Systems, Simon Parsons, Michael Wooldridge .
Autonomous Agents and Multi-Agent Systems, 5, 243–254, 2002
http://www.kluweronline.com/issn/1387-2532
People
Michael Wooldridge. Prof in the epartment of Computer Science, University of Liverpool, UK.- inspired by polytree. The agents find local optimal response first and then construct NE incrementally.
(2003-02-20)
[KLS2001] Graphical Models for Game Theory, by M. Kearns, M. Littman, and S. Singh, in the Proceeding of the UAI2001, 253-260
http://www.cis.upenn.edu/~mkearns/papers/graphgames.ps
(the key paper, partial NE(local mixed strategy) is exchanged between adjacent
nodes[downpass], and global NE is contructed incrementally. focused
on tree graph and proposed an approxmated alg and an exact alg.)
[KKLO2002] Correlated Equilibria in Graphical Games by Sham Kakade, M. Kearns, J. Langford, and L. Ortiz. Preprint, November 2002.
http://www.cis.upenn.edu/~mkearns/papers/cegg.pdf
[OK2002] Nash Propagation for Loopy Graphical Games. L. Ortiz. and Michael Kearns. To appear, Proceedings of NIPS 2002.
http://www.cis.upenn.edu/~mkearns/papers/nashprop.pdf
or L. Ortiz and M. Kearns.
Nash propagation for loopy graphical games. In
Neural Information Processing Systems, 2003. To appear.
(generalize the KLS2001 to general graphs)
[LKS2001] An Efficient Exact Algorithm for Singly Connected Graphical Games.M. Littman,
M. Kearns, S. Singh. 2001. To appear, NIPS 2001.
or M. Littman, M. Kearns, and S.
Singh. An efficient exact algorithm for singly connected graphical games. In
Neural Information Processing Systems, 2002. http://www.cis.upenn.edu/~mkearns/papers/gg-exact.pdf
(A detailed explain for the exact alg. in KLS2001)
[LK2001] An Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games Michael L. Littman, Michael Kearns
http://citeseer.nj.nec.com/543070.html ; http://www-2.cs.cmu.edu/Groups/NIPS/NIPS2001/papers/psgz/AA29.ps.gz
(same to LKS2001)
[VK2002] Multi-agent algorithms for solving graphical games.by D. Vickrey and D. Koller. In
Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002.
http://citeseer.nj.nec.com/vickrey02multiagent.html
(Two
new algs for general Graphical Game: hillclimbing and CSP)
People
Michael Kearns, Professor in Department of Computer and Information Science , University of Pennsylvania
http://www.cis.upenn.edu/~mkearns/
(2003-02-20)
[MUR2000] Game Networks by Pierfrancesco La Mura In
Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI), pages 335-342, 2000.
http://citeseer.nj.nec.com/438709.html
[ppt http://www.utia.cas.cz/user_data/vomlel/slides/game-networks.ppt by Mura]
[MS1999] Expected Utility Networks.by Pierfrancesco La Mura and Yoav Shoham. Proceedings of UAI'99.
http://citeseer.nj.nec.com/lamura99expected.html
(2003-02-25)
[BBB2001] UCP-Networks: A Directed Graphical Representation of Conditional Utilities, C. Boutilier, F. Bacchus and R. Brafman
Uncertainty in Artificial Intelligence (UAI-2001))pages 56--64 2001.
http://www.cs.toronto.edu/~fbacchus/Papers/ucpnets.ps
[BG1997] Independence and Qualitative Decision Theory, F. Bacchus and A. Grove
AAAI Spring Symposium on Qualitative preferences in deliberation and practical reasoning)1997.
http://www.cs.toronto.edu/~fbacchus/Papers/AAAISpringSym97.ps
[BG1996] Utility Independence in a Qualitative Decision Theory, F. Bacchus and A. Grove,
Principles of Knowledge Representation and Reasoning (KR-96), pages 542--552, 1996.
http://www.cs.toronto.edu/~fbacchus/Papers/BGKR96.ps
[BG1995] Graphical models for preference and utility, F. Bacchus and A. Grove,
Uncertainty in Artificial Intelligence (UAI-95), pages 3--10, 1995.
http://www.cs.toronto.edu/~fbacchus/Papers/BGUAI95.ps
(2003-03-01)
J Doyle and M P Wellman. Representing preferences
as ceteris paribus comparatives In AAAI Spring Symposium on decision
theoretic planning pages 69-75, 1994.
http://citeseer.nj.nec.com/doyle94representing.html
(2003-03-05) CP-net
[BBHP1999] Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, and David Poole. Reasoning
with conditional ceteris paribus preference statements. In Proceedings
of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pages
71–80, Stockholm, 1999.
http://citeseer.nj.nec.com/boutilier99reasoning.html
CP-nets -- Reasoning and Consistency Testing.
Carmel Domshlak and Ronen I. Brafman.
In Proceedings of KR'02, 2002
http://www.cs.bgu.ac.il/~brafman/kr02.ps
People
Pierfrancesco La Mura, Research on Game Network when he was in Stanford University,
Yoav Shoham, Associate Professor of Computer Science, Stanford University, Auction
http://robotics.stanford.edu/~shoham/
Fahiem Bacchus, (Professor). Dept. Computer Science University of Toronto
http://www.cs.toronto.edu/~fbacchus/
Craig Boutilier, Associate Professor
Department of Computer Science
University of Toronto
http://www.cs.toronto.edu/~cebly/
Ronen I. Brafman, Senior Lecturer, Department of Computer Science
Ben-Gurion University ,Israel
http://www.cs.bgu.ac.il/~brafman/
- Link the influence diagram directly as a Bayesian Network
(2003-02-20)
[KM2001] Multi-Agent Influence Diagrams for Representing and Solving Games by Daphne Koller, Brian Milch 2001
http://www.cs.berkeley.edu/~milch/papers/ijcai01maids.html ; http://citeseer.nj.nec.com/koller01multiagent.html
(the milestone paper for MAID)
[KM2003] Daphne Koller and Brian Milch. (2003) "
Multi-Agent Influence Diagrams for Representing and Solving Games". To appear in
Games and Economic Behavior special issue of selected papers from the First World Congress of the Game Theory Society.
http://www.cs.berkeley.edu/~milch/papers/geb03maids.html
(49 pages)
(a extended paper from KM 2003. Not new and more detailed)
[MTM2001] 2001 Maes, S., Tuyls, K., and Manderick, B.
Modeling a Multi-Agent Environment. Combining Influence Diagrams. Proceedings of IAWTIC'2001. Las Vegas, USA (2001)
http://como.vub.ac.be:8080/Publications/uploads/1/iawtic01.PDF
(Proposed combile ID to a golobal MAID, and two possible ways[direct link or
by junction tree] but without any practical illustration.)
C. Mudgal, J. Vassileva (2000)
An influence diagram model for multi-agent negotiation, in
Proceedings of the International Conference on Multi-Agent Systems ICMAS'2000. Boston, July 2000. http://julita.usask.ca/Texte/68_Vassileva.ps
(2 page application level paper)
(2003-02-25)
Dicky Suryadi and Piotr J. Gmytrasiewicz.
Learning models of other agents using influence diagrams.In Preceedings of the 1999 International Conference on User Modeling, pages 223--232, Banf, CA, July 1999
http://citeseer.nj.nec.com/95810.html
[POO1997] David Poole,
The Independent Choice Logic for modelling multiple agents under uncertainty,
Artificial Intelligence, 94(1-2), special issue on economic principles of multi-agent systems, pages 7-56, 1997.
http://www.cs.ubc.ca/spider/poole/abstracts/icl.html , http://citeseer.nj.nec.com/poole97independent.html
Slides: http://www.cs.ubc.ca/spider/poole/talks/icl.pdf
(Talking about how represent Game, MDP, ID in logic form(ICL), not very
related to this problem. )
A Comparison of Graphical Techniques for Asymmetric Decision Problems (1996) Concha Bielza, Prakash P. Shenoy
http://citeseer.nj.nec.com/221430.html
(2003-03-01)
R. D. Shachter. Evaluating influence diagrams.Operations Research,
34:871-882, 1986.
(it's the earliest one)
P. C. Brown. Influence diagrams to model and classify game theoretic problems.Mimeo, also presented at the 11th International Conference on Game Theory (2000),1999.
(2003-03-11)Brian Milch and Daphne Koller. (2000) Probabilistic
Models for Agents' Beliefs and Decisions. Proc. 16th Conference on
Uncertainty in Artificial Intelligence (UAI): 389-396. Runner-up for Best
Student Paper award.
http://robotics.stanford.edu/~koller/papers/uai00mk.ps
(Actually
are MAID but hadn't used that name)
People
Daphne Koller, Professor Computer Science Department, Stanford University,
http://robotics.stanford.edu/~koller/
Michael L. Littman , Associate Research Professor, Department of Computer Science , Rutgers University
http://www.cs.duke.edu/~mlittman/
David Poole, Professor in the Department of Computer Science, University of British Columbia
http://www.cs.ubc.ca/spider/poole/
Brian Milch
http://www.cs.berkeley.edu/~milch/
(2003-03-01)
Influence diagrams or Decision networks , a 2-page introduction
http://citeseer.nj.nec.com/95810.html
or http://www.cs.auc.dk/research/DSS/Primers/dn.ps
R. A. Howard and J. E. Matheson.Influence diagrams. In Readings on the Principles and Applications of Decision Analysis, pages 721–762. Strategic Decisions Group, 1984.(dated 1981)
N. L. Zhang and D. Poole. Stepwise-decomposable inuence diagrams. In Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92), pages 141{152, 1992.
N. L. Zhang, R. Qi, and D. Poole. A computational theory of
decision networks. International Journal of Approximate Reasoning, 11(2):83--
158, 1994.
http://citeseer.nj.nec.com/zhang94computational.html
Zhang, N. L. (1998). Probabilistic inference in influence
diagrams. In Proc. of the 14th Conference on UAI, pages 514--522.
http://citeseer.nj.nec.com/zhang98probabilistic.html
(2003-03-01)
[JJD1994] F.Jensen, F. V.
Jensen & S.L. Dittmer, From Influence Diagrams
to Junction Trees, Proceedings of the Tenth Conference on Uncertainty
in Arti?cial Intelligence, R.Lopez de Mantaras & D. Poole (Eds), Morgan
Kaufmann, San Francisico, 367-373, 1994.
http://citeseer.nj.nec.com/jensen94from.html
(as
inference for VK2002 and MTM2001)
(2003-02-25)
Learning an Agent's Utility Function by Observing Behavior , Urszula Chajewska, Daphne Koller, Dirk Ormoneit
http://citeseer.nj.nec.com/448041.html
Utilities as Random Variables: Density Estimation and Structure Discovery (2000) Urszula Chajewska, Daphne Koller
http://citeseer.nj.nec.com/chajewska00utilities.html
Learning the Structure of Utility Functions (1999) Urszula Chajewska, Daphne Koller
http://citeseer.nj.nec.com/chajewska99learning.html
Chajevska's Thesis abstract: http://robotics.stanford.edu/~urszula/papers/thesis_abstract.html
People
Urzula Chajevska PhD student in the Department of Computer Science at Stanford University
http://robotics.stanford.edu/~urszula/
as a special version of decision network
(2003-03-01)
Distributed Planning
in Hierarchical Factored MDPs; Carlos Guestrin and Geoffrey
Gordon; In the Eighteenth
Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada,
August 2002.
http://robotics.stanford.edu/~guestrin/Publications/UAI2002/uai2002.ps
Multiagent Planning
with Factored MDPs; Carlos Guestrin, Daphne Koller and Ronald
Parr; In Advances
in Neural Information Processing Systems (NIPS-14), Vancouver, Canada,
December 2001.
http://robotics.stanford.edu/~guestrin/Publications/NIPS2001MultiAgents/nips01-multiagents.ps.gz
(some more avaiable @ http://robotics.stanford.edu/~guestrin/publications.html
, I will add some if they are also related to graphical game)
(Hierarchical Reinforcement
Learning: http://www-anw.cs.umass.edu/rlr/hm.html
)
People
Carlos Guestrin, Ph.D. Candidate in Computer Science at Stanford University,
http://robotics.stanford.edu/~guestrin/
Craig Boutilier, Associate Professor
Department of Computer Science
University of Toronto
http://www.cs.toronto.edu/~cebly/
for MAS & Game
(2003-03-01)
(2003-03-05)
for influence diagram
(2003-03-01)
(2003-03-04)
See Murphy's list: http://www.ai.mit.edu/~murphyk/Software/BNT/bnsoft.html (with "Utility"=Y )
(2003-02-20)
Balanced Nontransferable Utility Games in Graph Structure by Jean-Jacques Herings, Gerard van der Laan, Dolf Talman 2001
http://citeseer.nj.nec.com/herings01balanced.html
[KAR1990] From game trees to game graphs by W.T.M. Kars 1990
http://citeseer.nj.nec.com/kars90from.html
[Return to Jie Bao's Homepage]