From model checking to equilibrium checking: Reactive modules for rational verification
暂无分享,去创建一个
Michael Wooldridge | Julian Gutierrez | Paul Harrenstein | M. Wooldridge | J. Gutierrez | Paul Harrenstein
[1] Ronen I. Brafman,et al. On the complexity of planning for agent teams and its implications for single agent planning , 2013, Artif. Intell..
[2] Leslie Lamport,et al. A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.
[3] A. Roth,et al. Two-sided matching , 1990 .
[4] Gary L. Peterson,et al. Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..
[5] Hans Peter Grüner. Rezension zu: Gardner, Roy: Games for Business and Economics. New York, NY, 1995 und zu Binmore, Ken: Fun and Games. Lexington, 1992 und zu Eichberger, Jürgen: Game Theory for Economists. San Diego, 1993 , 1996 .
[6] Barbara Messing,et al. An Introduction to MultiAgent Systems , 2002, Künstliche Intell..
[7] Paolo Traverso,et al. Automated planning - theory and practice , 2004 .
[8] Thomas A. Henzinger,et al. MOCHA: Modularity in Model Checking , 1998, CAV.
[9] David Manlove,et al. Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.
[10] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[11] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[12] Ken Binmore,et al. Does Game Theory Work? The Bargaining Challenge , 2007 .
[13] Dana Fisman,et al. Rational Synthesis , 2009, TACAS.
[14] Thomas A. Henzinger,et al. Alternating-time temporal logic , 1999 .
[15] Pierre Wolper,et al. An automata-theoretic approach to branching-time model checking , 2000, JACM.
[16] Marta Z. Kwiatkowska,et al. PRISM: probabilistic model checking for performance and reliability analysis , 2009, PERV.
[17] Amir Pnueli,et al. On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.
[18] Michael Wooldridge,et al. Reasoning about equilibria in game-like concurrent systems , 2014, Ann. Pure Appl. Log..
[19] Anand S. Rao,et al. Decision Procedures for BDI Logics , 1998, J. Log. Comput..
[20] Patricia Bouyer,et al. Pure Nash Equilibria in Concurrent Deterministic Games , 2015, Log. Methods Comput. Sci..
[21] Michael Wooldridge,et al. Rational Verification: From Model Checking to Equilibrium Checking , 2016, AAAI.
[22] Michael Wooldridge,et al. Expresiveness and Complexity Results for Strategic Reasoning , 2015, CONCUR.
[23] George Coulouris,et al. Distributed systems - concepts and design , 1988 .
[24] M. Wooldridge,et al. Imperfect Information in Reactive Modules Games , 2016, KR.
[25] Nicholas R. Jennings,et al. Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.
[26] Philippe Schnoebelen,et al. The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..
[27] Juliane Freud. Fun And Games A Text On Game Theory , 2016 .
[28] Valentin Goranko,et al. Temporal Logics in Computer Science: Finite-State Systems , 2016, Cambridge Tracts in Theoretical Computer Science.
[29] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[30] Wojciech Jamroga,et al. A logic for strategic reasoning , 2005, AAMAS '05.
[31] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.
[32] Michael Wooldridge,et al. Expressiveness and Nash Equilibrium in Iterated Boolean Games , 2016, AAMAS.
[33] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[34] Larry J. Stockmeyer,et al. Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..
[35] Sarit Kraus,et al. Incentive Engineering for Boolean Games , 2011, IJCAI.
[36] Jürgen Dix,et al. Reasoning about temporal properties of rational play , 2008, Annals of Mathematics and Artificial Intelligence.
[37] Krishnendu Chatterjee,et al. Strategy logic , 2007, Inf. Comput..
[38] Ashok K. Agrawala,et al. An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.
[39] Sarit Kraus,et al. Manipulating Games by Sharing Information , 2014, Stud Logica.
[40] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[41] Stephan Merz,et al. Model Checking , 2000 .
[42] Edmund M. Clarke,et al. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..
[43] Michael Wooldridge,et al. Iterated Boolean games , 2013, Inf. Comput..
[44] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[45] T. Schelling,et al. The Strategy of Conflict. , 1961 .
[46] Michael Wooldridge,et al. Towards a Logic of Rational Agency , 2003, Log. J. IGPL.
[47] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[48] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[49] Glynn Winskel,et al. Event Structures , 1986, Advances in Petri Nets.
[50] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[52] Koen V. Hindriks,et al. Specification and Verification of Multi-agent Systems , 2010 .
[53] Michael Wooldridge,et al. A Tool for the Automated Verification of Nash Equilibria in Concurrent Games , 2015, ICTAC.
[54] Aniello Murano,et al. Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.
[55] Krishnendu Chatterjee,et al. A survey of stochastic ω-regular games , 2012, J. Comput. Syst. Sci..
[56] Michael Wooldridge,et al. Bad equilibria (and what to do about them) , 2012, ECAI.
[57] Wolfgang Reisig,et al. Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.
[58] Leonard Kleinrock,et al. Analysis of A time‐shared processor , 1964 .
[59] L. S. Shapley,et al. College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..
[60] A. Prasad Sistla,et al. The complexity of propositional linear temporal logics , 1982, STOC '82.
[61] Thomas Wilke,et al. Automata: from logics to algorithms , 2008, Logic and Automata.
[62] Thomas A. Henzinger,et al. Reactive Modules , 1999, Formal Methods Syst. Des..
[63] Michael Wooldridge,et al. Equilibria of concurrent games on event structures , 2014, CSL-LICS.
[64] P. S. Thiagarajan,et al. Open Systems in Reactive Environments: Control and Synthesis , 2000, CONCUR.
[65] Cees Witteveen,et al. Boolean games , 2001 .
[66] Zohar Manna,et al. Temporal verification of reactive systems - safety , 1995 .
[67] Paolo Traverso,et al. Automated Planning: Theory & Practice , 2004 .
[68] Fabio Mogavero. Reasoning About Strategies , 2013, FSTTCS 2013.
[69] Orna Kupferman,et al. Repairing Multi-Player Games , 2015, CONCUR.
[70] Michael Wooldridge,et al. On the complexity of practical ATL model checking , 2006, AAMAS '06.
[71] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[72] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[73] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[74] Nick Bezhanishvili,et al. Tarski's theorem on intuitionistic logic, for polyhedra , 2017 .
[75] Rajeev Alur,et al. Playing Games with Boxes and Diamonds , 2003, CONCUR.