{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:19Z","timestamp":1720624939945},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81019-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"293-302","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market (Extended Abstract)"],"prefix":"10.1016","volume":"78","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"no. 4","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1111\/j.1475-6803.1995.tb00576.x","article-title":"Long-run Relations in Exchange Markets: A test of covered interest parity","volume":"18","author":"Abeysekera","year":"1995","journal-title":"J. Financial Research"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB2","series-title":"\u201cComplexity and Approximation: Combinatorial Optomization Problems and Their Approximability Properties\u201d","author":"Ausiello","year":"1999"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB3","series-title":"Transactions costs and covered interest arbitrage: Theory and evidence","first-page":"350","author":"Clinton","year":"1988"},{"issue":"no. 5","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1142\/S0129054102001382","article-title":"Computational Complexity of Arbitrage in Frictional Security Market","volume":"13","author":"Deng","year":"2002","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"no. 2","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","article-title":"On the Complexity of Cooperative Game Solution Concepts","volume":"19","author":"Deng","year":"1994","journal-title":"Mathematics of Operations Research"},{"issue":"no. 2, Ser. A","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s101070050096","article-title":"Decision-making by hierarchies of discordant agents","volume":"86","author":"Deng","year":"1999","journal-title":"Mathematical programming"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Deng X., C. Papadimitriou and S. Safra, On the Complexity of Equilibria. In \u201cProceedings of the Thirty Fourth Annual ACM Symposium on the Theory of Computing\u201d, 67\u201371, 2002.","DOI":"10.1145\/509919.509920"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB8","series-title":"\u201cComputers and Intractability: A guide of the Theory of NP-Completeness\u201d","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB9","series-title":"\u201cApproximation Algorithms for NP-hard Problems\u201d","year":"1997"},{"issue":"no. 6","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB10","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1142\/S0219024901001279","article-title":"A Network Model for Foreign Exchange Arbitrage, Hedging and Speculation","volume":"4","author":"Jones","year":"2001","journal-title":"International Journal of Theoretical and Applied Finance"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB11","series-title":"\u201cComplexity of Computer Computations\u201d","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"no. 4","key":"10.1016\/S1571-0661(04)81019-3_NEWBIB12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB13","series-title":"\u201cTringular Arbitrage in the Foreign Exchange Market - Inefficiencies, technology and investment opportunities\u201d","author":"Mavrides","year":"1992"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB14","series-title":"\u201cDecision and Organization\u201d","article-title":"Theories of Bounded Rationality","author":"Simon","year":"1972"},{"key":"10.1016\/S1571-0661(04)81019-3_NEWBIB15","series-title":"\u201c8th structure in Complelexity Theory Conf.\u201d","first-page":"305","article-title":"NP-complete problems have a version that's hard to approximate","author":"Zuckerman","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810193?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810193?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:52Z","timestamp":1549191232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":15,"alternative-id":["S1571066104810193"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81019-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}