Scrip systems with minimal availability <\/p>\n
S\u00fcleyman Kerimov
\nDepartment of Management Science and Engineering
\nStanford University <\/p>\n
December 14, Friday, 13:40
\nPlace: EA 409 <\/p>\n
We consider an infinite horizon model with finitely many agents in which at each time period, one agent requests service, one agent provides service, and the service requester pays one scrip to the service provider. We analyze the scrip distribution when only few agents are available to provide service where among the available agents, the one with the lowest number of scrips provides service. Using ideas from the literature on the power of two choices, we identify conditions under which the scrip distribution is balanced in the sense that agents will not deviate by much from their initial endowment, with high probability. This implies that in a strategic environment, efficiency can be obtained with minimal service availability as agents will have no incentive to defect from providing service. Our results suggest that scrip systems are likely to lead to efficient outcomes in kidney exchange platforms that currently experience free riding. (joint work with Itai Ashlagi). <\/p>\n","protected":false},"excerpt":{"rendered":"
Scrip systems with minimal availability S\u00fcleyman Kerimov Department of Management Science and Engineering Stanford University December 14, Friday, 13:40 Place: EA 409 We consider an infinite horizon model with finitely many agents in which at each time period, one agent requests service, one agent provides service, and the service requester [\u2026] <\/p>\n