Shirking and Squandering in Sharing Games
In a sharing game the players' choices yield a revenue, each player's choice carries a cost, and a player's payoff is a portion of the revenue minus the player's cost. Such games are appealingly simple devices for partially aligning individual incentives with organizational goals, but their equilibria may be inefficient, i.e., at an equilibrium the surplus (revenue minus the sum of the costs) may not be maximal. Sharing games as a general class have not been well studied. We start a general theory of sharing games by going beyond the common economic setting, where strategy sets are continua and cost and revenue functions are smooth. We include games in which some of a player's strategies are equally costly, and revenue changes when he switches from one of them to another. We consider several large classes of reward functions, including nondecreasing residual (NDR) functions, in which residual (revenue minus rewards) does not drop when revenue increases. That class includes budget-balancing functions, where residual is always zero. To focus the discussion, we examine a “Folk Claim", which asserts that at every inefficient equilibrium shirking, in some sense, occurs. We show that in NDR games a complementarity condition indeed insures that no one squanders at equilibrium (spends more than at an efficient profile). But when we drop complementarity, the situation changes sharply, and there are games with compelling equilibria, at which some players squander. The shirking/squandering distinction is particularly important in tracing the effect of technical improvement on the surplus shortfall at a sharing game's equilibrium. The paper also obtains conditions for existence of (pure-strategy) equilibria and finds, in particular, that every finite game in which rewards are linearly related has an equilibrium.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 6 (2006)
Issue (Month): 1 (December)
|Contact details of provider:|| Web page: http://www.degruyter.com|
|Order Information:||Web: http://www.degruyter.com/view/j/bejte|
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:topics.6:y:2006:i:1:n:21. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Peter Golla)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.