Shared Resource Management via Reward Schemes

  • Shahar Dobzinski
  • Amir Ronen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8768)

Abstract

We study scenarios in which consumers have several alternatives for using a shared resource. We investigate whether rewards can be used to motivate effective usage of the resource. Our goal is to design reward schemes that, in equilibrium, minimize the cost to society and the total sum of rewards. We introduce a generic scheme which does not use any knowledge about the valuations of the consumers, yet its cost in equilibrium is always close to the cost of the optimal scheme that has complete knowledge of the consumers’ valuations. We show that our scheme is essentially optimal in some settings while in others no good schemes exist.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Archer, A., Tardos, É.: Frugal path mechanisms. In: SODA 2002 (2002)Google Scholar
  2. 2.
    Ben-Elia, E., Ettema, D.: Carrots versus sticks: Rewarding commuters for avoiding the rush-houra study of willingness to participate. Transport Policy 16(2), 68–76 (2009)CrossRefGoogle Scholar
  3. 3.
    Bonsall, P., Shires, J., Maule, J., Matthews, B., Beale, J.: Responses to complex pricing signals: Theory, evidence and implications for road pricing. Transportation Research Part A: Policy and Practice 41(7), 672–683 (2007)Google Scholar
  4. 4.
    Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 345–357. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Christodoulou, G., Mehlhorn, K., Pyrga, E.: Improving the price of anarchy for selfish routing via coordination mechanisms. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 119–130. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC, pp. 521–530. ACM (2003)Google Scholar
  7. 7.
    Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: SODA 2004 (2004)Google Scholar
  8. 8.
    Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS, pp. 277–285. IEEE (2004)Google Scholar
  9. 9.
    Fotakis, D., Karakostas, G., Kolliopoulos, S.G.: On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 162–173. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Kahneman, D., Tversky, A.: Prospect theory: An analysis of decision under risk. Econometrica: Journal of the Econometric Society, 263–291 (1979)Google Scholar
  11. 11.
    Knockaert, J., Bliemer, M., Ettema, D., Joksimovic, D., Mulder, A., Rouwendal, J., van Amelsfort, D.: Experimental design and modelling Spitsmijden. Bureau Spitsmijden. The Hague (2007)Google Scholar
  12. 12.
    Markoff, J.: Incentives for drivers who avoid traffic jams. New York Times (2012)Google Scholar
  13. 13.
    Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111–124 (1996)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Rescorla, R.A.: A pavlovian analysis of goal-directed behavior. American Psychologist 42(2), 119 (1987)CrossRefGoogle Scholar
  15. 15.
    Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica: Journal of the Econometric Society, 520–534 (1965)Google Scholar
  16. 16.
    Nofar Sinai. Haaretz TheMarker (2012)Google Scholar
  17. 17.
    Wikiepdia. London congestion charge (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Shahar Dobzinski
    • 1
  • Amir Ronen
    • 2
  1. 1.Weizmann Institute of ScienceIsrael
  2. 2.IBM ResarchHaifaIsrael

Personalised recommendations