Scrip Economies Are Fair and (Approximately) Efficient

21 Pages Posted: 30 Jun 2019

See all articles by Artur Gorokh

Artur Gorokh

Cornell University - Center for Applied Mathematics

Siddhartha Banerjee

Cornell University - School of Operations Research and Information Engineering

Krishnamurthy Iyer

University of Minnesota - Twin Cities - Department of Industrial and Systems Engineering

Date Written: June 28, 2019

Abstract

In many settings, resources are allocated among agents repeatedly over time without the use of monetary transfers: consider, for example, allocating server-time to company employees, rooms to students, or food among food banks. Here, the central challenge is to allocate resources efficiently despite the absence of payments. In this work we investigate scrip mechanisms, which endow agents with a budget of artificial credits (scrip), and allocate resources via an auction with payments in scrip. Owing to their simplicity, such mechanisms have been gaining in popularity, with several recent successful implementations, most notably, by Feeding America for US food banks. Our goal in this paper is to understand the incentive and efficiency properties of these mechanisms.

Our main contribution in this work is to show that such simple mechanisms enjoy strong performance guarantees under minimal rationality assumptions. Formally, we consider a dynamic allocation setting, where multiple items are available in each period, and each agent’s preference is a fractionally subadditive (XOS) valuation function, drawn independently from some underlying distributions. Agents start with some initial endowment of scrips, and in each round, participate in simultaneous first-price auctions for each item. We benchmark the performance this mechanism against widely-adopted solution concepts from the literature on bargaining. In particular, we show that irrespective of the strategies of other agents, each agent can obtain a 1/2 − o(1) approximation of their ideal utility, i.e., the utility they derive from their favorite allocation subject to giving other agents their share (proportional to initial endowments) of the items. We do this by providing a lower-bound on the maximum value of each agent in the mechanism.

Our results provide strong argument for a wider adoption of artificial currency mechanisms in several ways. First, our guarantees have frugal strategic and informational requirements – agents do not need to know the preferences or strategies of other participants in order to secure a half of their ideal utility. Second, the performance guarantees are independent of the cardinality of the type-space, and agnostic of the underlying type distributions. Finally, our results also yield operational insights into how the principal can choose the appropriate scrip endowments as to target a particular ideal utility profile.

Keywords: mechanism design, combinatorial auctions, scrip, artificial currencies, allocation without money

Suggested Citation

Gorokh, Artur and Banerjee, Siddhartha and Iyer, Krishnamurthy, Scrip Economies Are Fair and (Approximately) Efficient (June 28, 2019). Available at SSRN: https://ssrn.com/abstract=3411444 or http://dx.doi.org/10.2139/ssrn.3411444

Artur Gorokh (Contact Author)

Cornell University - Center for Applied Mathematics ( email )

657 Rhodes Hall
Ithaca, NY 14853-3801
United States

Siddhartha Banerjee

Cornell University - School of Operations Research and Information Engineering ( email )

237 Rhodes Hall
Ithaca, NY 14853
United States

Krishnamurthy Iyer

University of Minnesota - Twin Cities - Department of Industrial and Systems Engineering ( email )

111 Church St SE
Minneapolis, MN 55455
United States

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
23
Abstract Views
199
PlumX Metrics