Skip to main content

Secure Relative Performance Scheme

  • Conference paper
Internet and Network Economics (WINE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4858))

Included in the following conference series:

Abstract

We suggest a relative performance scheme that provides incentives for e.g. a manager to strive for the firm’s strategy. A number of comparable firms submit private performance data to a trusted third party and receive a single number reflecting the firm’s relative catch up with the frontier evaluated with the shadow prices associated with a tailored benchmark. The distributed information avoid signaling among the firms by revealing no recognizable information about the other firms performances. To enhance the applicability the computation of the required linear programming problems is based on distributed cryptography. Preliminary results on the computation time is provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bogetoft, P.: Incentive efficient production frontiers: An agency perspective in DEA. Management Science 40, 959–968 (1994)

    Article  MATH  Google Scholar 

  2. Chvátal, V.: Linear Programming. W. H. FREEMAN, New York (1983)

    MATH  Google Scholar 

  3. Cooper, W.W., Seiford, L.M., Tone, K.: Data Envelopment Analysis. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  4. Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: PODC 1998: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp. 101–111. ACM Press, New York (1998)

    Chapter  Google Scholar 

  5. Holmstrom, B.: Moral hazard in teams. Bell Journal of Economics 13, 324–340 (1982)

    Article  Google Scholar 

  6. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Toft, T.: Primitives and Applications for Multi-party Computation. PhD thesis, University of Aarhus (2007), Available at http://www.daimi.au.dk/~tomas/publications/dissertation.pdf

  8. Toft, T.: An implementation of an MPC LP-solver. Work in progress (n.d.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Xiaotie Deng Fan Chung Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, K., Toft, T. (2007). Secure Relative Performance Scheme. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77105-0_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77104-3

  • Online ISBN: 978-3-540-77105-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics