{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:42:48Z","timestamp":1648510968367},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3669,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00289-5","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T15:58:54Z","timestamp":1053359934000},"page":"477-484","source":"Crossref","is-referenced-by-count":1,"title":["When does a random Robin Hood win?"],"prefix":"10.1016","volume":"304","author":[{"given":"William","family":"Gasarch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan","family":"Golub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00289-5_BIB1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0304-3975(03)00289-5_BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01946852","article-title":"A game of D. Gale in which one of the players has limited memory","volume":"22","author":"Ciesielski","year":"1990","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/S0304-3975(03)00289-5_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0304-3975(94)90035-3","article-title":"Variations of a game of Gale (ii)","volume":"129","author":"Scheepers","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(03)00289-5_BIB4","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.2307\/2275641","article-title":"Variations of a game of Gale (iii)","volume":"62","author":"Scheepers","year":"1997","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0304-3975(03)00289-5_BIB5","series-title":"Game Theory and Strategy","author":"Straffin","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T05:22:14Z","timestamp":1553145734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0304397503002895"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00289-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}