Show simple item record

dc.contributor.authorJohnson, Kristine Dianne
dc.contributor.authorSimchi-Levi, David
dc.contributor.authorSun, Peng
dc.date.accessioned2014-09-16T19:27:27Z
dc.date.available2014-09-16T19:27:27Z
dc.date.issued2014-06
dc.date.submitted2013-10
dc.identifier.issn0030-364X
dc.identifier.issn1526-5463
dc.identifier.urihttp://hdl.handle.net/1721.1/89651
dc.description.abstractScrip systems provide a nonmonetary trade economy for exchange of resources. We model a scrip system as a stochastic game and study system design issues on selection rules to match potential trade partners over time. We show the optimality of one particular rule in terms of maximizing social welfare for a given scrip system that guarantees players' incentives to participate. We also investigate the optimal number of scrips to issue under this rule. In particular, if the time discount factor is close enough to one, or trade benefits one partner much more than it costs the other, the maximum social welfare is always achieved no matter how many scrips are in the system. When the benefit of trade and time discount are not sufficiently large, on the other hand, injecting more scrips in the system hurts most participants; as a result, there is an upper bound on the number of scrips allowed in the system, above which some players may default. We show that this upper bound increases with the discount factor as well as the ratio between the benefit and cost of service. Finally, we demonstrate similar properties for a different service provider selection rule that has been analyzed in previous literature.en_US
dc.description.sponsorshipMasdar Institute of Science and Technologyen_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Contract CMMI-0758069)en_US
dc.language.isoen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/opre.2014.1260en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceOther univ. web domainen_US
dc.titleAnalyzing Scrip Systemsen_US
dc.typeArticleen_US
dc.identifier.citationJohnson, Kris, David Simchi-Levi, and Peng Sun. “Analyzing Scrip Systems.” Operations Research 62, no. 3 (June 2014): 524–534.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Engineering Systems Divisionen_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Centeren_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.mitauthorJohnson, Kristine Dianneen_US
dc.contributor.mitauthorSimchi-Levi, Daviden_US
dc.relation.journalOperations Researchen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsJohnson, Kris; Simchi-Levi, David; Sun, Pengen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-4650-1519
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record