{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:01:47Z","timestamp":1726520507723},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0166-218x(99)00144-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:55Z","timestamp":1027608955000},"page":"339-348","source":"Crossref","is-referenced-by-count":13,"title":["Optimal paths in network games with p players"],"prefix":"10.1016","volume":"99","author":[{"given":"R.","family":"Boliac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Lozovanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Solomon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(99)00144-4_BIB1","first-page":"55","article-title":"An algorithm and a program for finding the minimax path tree in weighted digraphs","volume":"5","author":"Boliac","year":"1997","journal-title":"Comput. Sci. J. Moldova"},{"key":"10.1016\/S0166-218X(99)00144-4_BIB2","unstructured":"N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, London, 1975."},{"issue":"5","key":"10.1016\/S0166-218X(99)00144-4_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0041-5553(88)90012-2","article-title":"Cyclic games: finding minimax mean cycles in digraphs","volume":"28","author":"Gurvitch","year":"1988","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB4","unstructured":"D.D. Lozovanu, Algorithms for solving some network minimax problems and their applications, Cybernetics 1 (1991) 70\u201375 (in Russian)."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB5","unstructured":"D.D. Lozovanu, Extremal-Combinatorial Problems and Algorithms for their Solving, Stiinta, Kishinev, 1991 (in Russian)."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB6","unstructured":"D.D. Lozovanu, A strongly polynomial time algorithm for finding minimax paths in networks and solving cyclic games, Cybernet. System Anal. 5 (1993) 145\u2013151 (in Russian)."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB7","unstructured":"D.D. Lozovanu, V.A. Trubin, Minimax path problem in network and the algorithm for its solving, Discrete Math. 6 (1994) 138\u2013144 (in Russian)."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB8","unstructured":"H. Moulin, Prolongement des jeux \u00e0 deux jouers de somme nulle, Bull. Soc. Math. Mem. 45 (1976) 43\u201347."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB9","unstructured":"H. Moulin, Th\u00e9orie des Jeux Pour l\u2019\u00c9conomie et la Politique, Hermann, Paris, 1981."},{"key":"10.1016\/S0166-218X(99)00144-4_BIB10","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non cooperative games","volume":"2","author":"Nash","year":"1951","journal-title":"Ann. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:30:33Z","timestamp":1556397033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0166218X99001444"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00144-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}