{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:36Z","timestamp":1759847616733},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T00:00:00Z","timestamp":1413331200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10957-014-0657-9","type":"journal-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T14:38:27Z","timestamp":1413297507000},"page":"1063-1070","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Testing Axioms of Revealed Preference"],"prefix":"10.1007","volume":"166","author":[{"given":"Fabrice","family":"Talla\u00a0Nobibon","sequence":"first","affiliation":[]},{"given":"Bart","family":"Smeulders","sequence":"additional","affiliation":[]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"key":"657_CR1","doi-asserted-by":"crossref","unstructured":"Samuelson, P.: The empirical implications of utility analysis. Economica 6(4), 344\u2013356 (1938)","DOI":"10.2307\/1905411"},{"key":"657_CR2","doi-asserted-by":"crossref","unstructured":"Varian, H.: Revealed preference. Samuelsonian Economics and the 21st Century (2006)","DOI":"10.1093\/acprof:oso\/9780199298839.003.0007"},{"key":"657_CR3","doi-asserted-by":"crossref","unstructured":"Smeulders, B., Spieksma, F., Cherchye, L., De Rock, B.: Goodness of fit measures for revealed preference tests: complexity results and algorithms. ACM Trans. Econ. Comput. 2(1), Article No. 3 (2014)","DOI":"10.1145\/2560793"},{"issue":"4","key":"657_CR4","doi-asserted-by":"crossref","first-page":"945","DOI":"10.2307\/1912771","volume":"50","author":"H Varian","year":"1982","unstructured":"Varian, H.: The nonparametric approach to demand analysis. Economica 50(4), 945\u2013976 (1982)","journal-title":"Economica"},{"issue":"1","key":"657_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. J. Am. Assoc. Comput. Mach. 9(1), 11\u201312 (1962)","journal-title":"J. Am. Assoc. Comput. Mach."},{"issue":"3","key":"657_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"657_CR7","doi-asserted-by":"crossref","unstructured":"Skiena, S.: The Algorithm Design Manual, 2nd edn. Springer, New York (2008)","DOI":"10.1007\/978-1-84800-070-4"},{"key":"657_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(98)00097-1","volume":"191","author":"G Gutin","year":"1998","unstructured":"Gutin, G., Sudakov, B., Yeo, A.: Note on alternating directed cycles. Discret. Math. 191, 101\u2013107 (1998)","journal-title":"Discret. Math."},{"key":"657_CR9","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: Complexity of paths, trails and circuits in arc-colored digraphs. Lecture Notes in Computer Science, vol. 6108, pp. 222\u2013233. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13562-0_21"},{"issue":"2","key":"657_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"657_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of 15th ACM Symposium on Theory of Computing, pp. 80\u201386. ACM (1983)","DOI":"10.1145\/800061.808735"},{"issue":"4","key":"657_CR12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0220041","volume":"20","author":"AC Yao","year":"1991","unstructured":"Yao, A.C.: Lower bounds for algebraic computation trees with integer inputs. SIAM J. Comput. 20(4), 655\u2013668 (1991)","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0657-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-014-0657-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-014-0657-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T05:26:16Z","timestamp":1565933176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-014-0657-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,15]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s10957-014-0657-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,15]]}}}