{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:03Z","timestamp":1760202603999},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033582"},{"type":"electronic","value":"9783642033599"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03359-9_21","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T01:46:12Z","timestamp":1250732772000},"page":"293-309","source":"Crossref","is-referenced-by-count":12,"title":["Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Le Roux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Anonymous. Program evaluation research task. Summary report Phase 1 and 2, U.S. Government Printing Office, Washington, D.C. (1958)"},{"key":"21_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Berthot","year":"2004","unstructured":"Berthot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","volume":"6","author":"D. Blackwell","year":"1956","unstructured":"Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics\u00a06, 1\u20138 (1956)","journal-title":"Pacific Journal of Mathematics"},{"key":"21_CR4","unstructured":"Blanqui, F., Coupet-Grimal, S., Delobel, W., Hinderer, S., Koprowski, A.: CoLoR, a Coq Library on rewriting and termination. In: Workshop on Termination (2006)"},{"issue":"11","key":"21_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"A.B. Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM\u00a05(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"key":"21_CR6","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol.\u00a01. Addison Wesley, Reading (1973)","edition":"2"},{"key":"21_CR7","volume-title":"Notes on the Theory of Choice","author":"D.M. Kreps","year":"1988","unstructured":"Kreps, D.M.: Notes on the Theory of Choice. Westview Press, Inc., Boulder (1988)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s001860300305","volume":"58","author":"T. Krieger","year":"2003","unstructured":"Krieger, T.: On pareto equilibria in vector-valued extensive form games. Mathematical Methods of Operations Research\u00a058, 449\u2013458 (2003)","journal-title":"Mathematical Methods of Operations Research"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. Contributions to the Theory of Games II (1953)","DOI":"10.1515\/9781400881970"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/355578.366314","volume":"4","author":"D.J. Lasser","year":"1961","unstructured":"Lasser, D.J.: Topological ordering of a list of randomly-numbered elements of a network. Commun. ACM\u00a04(4), 167\u2013168 (1961)","journal-title":"Commun. ACM"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Le Roux, S.: Non-determinism and Nash equilibria for sequential game over partial order. In: Computational Logic and Applications, CLA 2005. Discrete Mathematics & Theoretical Computer Science (2006)","DOI":"10.46298\/dmtcs.3468"},{"key":"21_CR12","unstructured":"Le Roux, S.: Acyclicity and finite linear extendability: a formal and constructive equivalence. In: Schneider, K., Brandt, J. (eds.) Theorem Proving in Higher Order Logics: Emerging Trends Proceedings, September 2007, pp. 154\u2013169. Department of Computer Science, University of Kaiserslautern (2007)"},{"key":"21_CR13","unstructured":"Le Roux, S.: Generalisation and formalisation in game theory. Ph.d. thesis, Ecole Normale Sup\u00e9rieure de Lyon (January 2008)"},{"key":"21_CR14","unstructured":"Le Roux, S., Lescanne, P., Vestergaard, R.: A discrete Nash theorem with quadratic complexity and dynamic equilibria. Research report IS-RR-2006-006, JAIST (2006)"},{"key":"21_CR15","unstructured":"Jarnagin, M.P.: Automatic machine methods of testing pert networks for consistency. Technical Memorandum K-24\/60, U. S. Naval Weapons Laboratory, Dahlgren, Va (1960)"},{"key":"21_CR16","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Origins of the calculus of binary relations. In: Logic in Computer Science (1992)","DOI":"10.1109\/LICS.1992.185537"},{"key":"21_CR18","unstructured":"Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfragetr\u00e4gheit. Zeitschrift f\u00fcr die desamte Staatswissenschaft\u00a0121 (1965)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1884852","volume":"69","author":"H.A. Simon","year":"1955","unstructured":"Simon, H.A.: A behavioral model of rational choice. The Quarterly Journal of Economics\u00a069(1), 99\u2013118 (1955)","journal-title":"The Quarterly Journal of Economics"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Szpilrajn, E.: Sur l\u2019extension de l\u2019ordre partiel. Fund. Math.\u00a016 (1930)","DOI":"10.4064\/fm-16-1-386-389"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2005.09.010","volume":"97","author":"R. Vestergaard","year":"2006","unstructured":"Vestergaard, R.: A constructive approach to sequential Nash equilibria. Information Processing Letter\u00a097, 46\u201351 (2006)","journal-title":"Information Processing Letter"},{"key":"21_CR22","unstructured":"Zermelo, E.: \u00dcber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In: Proceedings of the Fifth International Congress of Mathematicians, vol.\u00a02 (1912)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03359-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T21:10:55Z","timestamp":1633813855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03359-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033582","9783642033599"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03359-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}