{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:13Z","timestamp":1750306753682,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p>\n            First, a quick recap of the problem: the payout is a random variable\n            <jats:italic>X<\/jats:italic>\n            ; we assume we know its distribution\n            <jats:italic>F<\/jats:italic>\n            , and in particular that we know\n            <jats:italic>E<\/jats:italic>\n            <jats:sub>\n              <jats:italic>F<\/jats:italic>\n            <\/jats:sub>\n            [\n            <jats:italic>X<\/jats:italic>\n            ]. We are looking for a function\n            <jats:italic>\u03c9<\/jats:italic>\n            (\u00b7,\u00b7) such that\n            <jats:italic>E<\/jats:italic>\n            <jats:sub>\n              <jats:italic>F<\/jats:italic>\n            <\/jats:sub>\n            [\n            <jats:italic>\u03c9<\/jats:italic>\n            (\n            <jats:italic>t<\/jats:italic>\n            ,\n            <jats:italic>X<\/jats:italic>\n            )] =\n            <jats:italic>r<\/jats:italic>\n            \u00b7\n            <jats:italic>t<\/jats:italic>\n            , where\n            <jats:italic>r<\/jats:italic>\n            is the non-contingency hourly rate. Initially, we impose that \u2200\n            <jats:italic>t<\/jats:italic>\n            ,\n            <jats:italic>\u03c9<\/jats:italic>\n            (\n            <jats:italic>t<\/jats:italic>\n            , 0) = 0 and that\n            <jats:italic>\u03c9<\/jats:italic>\n            is linear in\n            <jats:italic>t<\/jats:italic>\n            .\n          <\/jats:p>","DOI":"10.1145\/2509002.2509012","type":"journal-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T15:14:00Z","timestamp":1375370040000},"page":"41-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Solution to exchanges 10.3 puzzle"],"prefix":"10.1145","volume":"11","author":[{"given":"Robin J.","family":"Ryder","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Dauphine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,12]]},"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509002.2509012","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509002.2509012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:34Z","timestamp":1750231714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509002.2509012"}},"subtitle":["contingency exigency"],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1145\/2509002.2509012"],"URL":"https:\/\/doi.org\/10.1145\/2509002.2509012","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2012,12]]},"assertion":[{"value":"2012-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}