{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T21:17:23Z","timestamp":1722028643232},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1007\/bf02592075","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:55:37Z","timestamp":1175183737000},"page":"241-252","source":"Crossref","is-referenced-by-count":10,"title":["The (2 n+1\u22122)-ray algorithm: A new simplicial algorithm to compute economic equilibria"],"prefix":"10.1007","volume":"39","author":[{"given":"T. M.","family":"Doup","sequence":"first","affiliation":[]},{"given":"G.","family":"van der Laan","sequence":"additional","affiliation":[]},{"given":"A. J. J.","family":"Talman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592075_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02591741","volume":"37","author":"T.M. Doup","year":"1987","unstructured":"T.M. Doup and A.J.J. Talman, \u201cA new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices,\u201dMathematical Programming 37 (1987) 319\u2013355.","journal-title":"Mathematical Programming"},{"key":"BF02592075_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01585103","volume":"24","author":"M. Kojima","year":"1982","unstructured":"M. Kojima and Y. Yamamoto, \u201cVariable dimension algorithms: Basic theory, interpretations and extension of some existing methods,\u201dMathematical Programming 24 (1982) 177\u2013215.","journal-title":"Mathematical Programming"},{"key":"BF02592075_CR3","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1073\/pnas.61.4.1238","volume":"61","author":"H.W. Kuhn","year":"1968","unstructured":"H.W. Kuhn, \u201cSimplicial approximation of fixed points,\u201dProceedings of the National Academy of Science 61 (1968) 1238\u20131242.","journal-title":"Proceedings of the National Academy of Science"},{"key":"BF02592075_CR4","first-page":"199","volume":"2","author":"H.W. Kuhn","year":"1969","unstructured":"H.W. Kuhn, \u201cApproximate search for fixed points,\u201dComputing Methods in Optimization Problems 2 (1969) 199\u2013211.","journal-title":"Computing Methods in Optimization Problems"},{"key":"BF02592075_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00933874","volume":"17","author":"H.W. Kuhn","year":"1975","unstructured":"H.W. Kuhn and J.G. MacKinnon, \u201cThe Sandwich method for finding fixed points,\u201dJournal of Optimization Theory and Applications 17 (1975) 189\u2013204.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02592075_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01588226","volume":"17","author":"G. Laan van der","year":"1979","unstructured":"G. van der Laan and A.J.J. Talman, \u201cA restart algorithm for computing fixed points without an extra dimension,\u201dMathematical Programming 17 (1979) 74\u201384.","journal-title":"Mathematical Programming"},{"key":"BF02592075_CR7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01588323","volume":"18","author":"G. Laan van der","year":"1980","unstructured":"G. van der Laan and A.J.J. Talman, \u201cAn improvement of fixed point algorithms by using a good triangulation,\u201dMathematical Programming 18 (1980) 274\u2013285.","journal-title":"Mathematical Programming"},{"key":"BF02592075_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF02594787","volume":"25","author":"G. Laan van der","year":"1983","unstructured":"G. van der Laan and A.J.J. Talman, \u201cNote on the path following approach of equilibrium programming,\u201dMathematical Programming 25 (1983) 363\u2013367.","journal-title":"Mathematical Programming"},{"key":"BF02592075_CR9","series-title":"Onderzoeksverslag","volume-title":"Adjustment processes for finding economic equilibria","author":"G. Laan van der","year":"1985","unstructured":"G. van der Laan and A.J.J. Talman, \u201cAdjustment processes for finding economic equilibria,\u201d Onderzoeksverslag 141, Free University, Amsterdam, 1985."},{"key":"BF02592075_CR10","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.2307\/1911014","volume":"53","author":"D.G. Saari","year":"1985","unstructured":"D.G. Saari, \u201cIterative price mechanisms,\u201dEconometrica 53 (1985) 1117\u20131131.","journal-title":"Econometrica"},{"key":"BF02592075_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2307\/2556215","volume":"1","author":"H. Scarf","year":"1960","unstructured":"H. Scarf, \u201cSome examples of global instability of the competitive equilibrium,\u201dInternational Economic Review 1 (1960), 157\u2013172.","journal-title":"International Economic Review"},{"key":"BF02592075_CR12","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H. Scarf","year":"1967","unstructured":"H. Scarf, \u201cThe approximation of fixed points of a continuous mapping,\u201dSIAM Journal of Applied Mathematics 15 (1967) 1328\u20131343.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"BF02592075_CR13","volume-title":"The Computation of Economic Equilibria","author":"H. Scarf","year":"1973","unstructured":"H. Scarf,The Computation of Economic Equilibria (Yale University Press, New Haven, CT, 1973)."},{"key":"BF02592075_CR14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/BF01584249","volume":"21","author":"W.I. Zangwill","year":"1981","unstructured":"W.I. Zangwill and C.B. Garcia, \u201cEquilibrium programming: the path following approach and dynamics,\u201dMathematical Programming 21 (1981) 262\u2013289.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["BF02592075"],"URL":"https:\/\/doi.org\/10.1007\/bf02592075","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}