ACM Home Page
Please provide us with feedback. Feedback
Minimum payments that reward honest reputation feedback
Full text PdfPdf (263 KB)
Source Electronic Commerce archive
Proceedings of the 7th ACM conference on Electronic commerce table of contents
Ann Arbor, Michigan, USA
Pages: 190 - 199  
Year of Publication: 2006
ISBN:1-59593-236-4
Authors
Radu Jurca  Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Boi Faltings  Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Sponsors
ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 91,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1134707.1134728
What is a DOI?

ABSTRACT

Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and the potential gains that can be obtained from lying. Side-payment schemes (monetary rewards for submitted feedback) can make truth-telling rational based on the correlation between the reports of different buyers.In this paper we use the idea of automated mechanism design to construct the payments that minimize the budget required by an incentive-compatible reputation mechanism. Such payment schemes are defined by a linear optimization problem that can be solved efficiently in realistic settings. Furthermore, we investigate two directions for further lowering the cost of incentive-compatibility: using several reference reports to construct the side-payments, and filtering out reports that are probably false.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Buchegger and J.-Y. Le Boudec. Self-Policing Mobile Ad-Hoc Networks by Reputation. IEEE Communication Magazine.
 
2
R. T. Clemen. Incentive contracts and strictly proper scoring rules. Test, 11:167--189, 2002.
 
3
V. Conitzer and T. Sandholm. Complexity of mechanism design. In Proceedings of the Uncertainty in Artificial Intelligence Conference (UAI), 2002.
 
4
J. Crémer and R. P. McLean. Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent. Econometrica, 53(2):345--61, 1985.
 
5
C. dáspremont and L.-A. Grard-Varet. Incentives and Incomplete Information. Journal of Public Economics, 11:25--45, 1979.
 
6
A. Harmon. Amazon Glitch Unmasks War of Reviewers. The New York Times, February 14, 2004.
 
7
R. Ismail and A. Jøsang. The Beta Reputation System. In Proceedings of the 15th Bled Conf. on E-Commerce, 2002.
 
8
S. Johnson, J. Pratt, and R. Zeckhauser. Efficiency Despite Mutually Payoff-Relevant Private Information: The Finite Case. Econometrica, 58:873--900, 1990.
 
9
R. Jurca and B. Faltings. Enforcing Truthful Strategies in Incentive Compatible Reputation Mechanisms. In Internet and Network Economics, volume 3828 of LNCS, pages 268--277. 2005.
 
10
R. Jurca and B. Faltings. Reputation-based Service Level Agreements for Web Services. In Service Oriented Computing (ICSOC - 2005), volume 3826 of LNCS, pages 396--409. 2005.
 
11
M. Kandori and H. Matsushima. Private observation, communication and collusion. Econometrica, 66(3):627--652, 1998.
 
12
N. Miller, P. Resnick, and R. Zeckhauser. Eliciting Informative Feedback: The Peer-Prediction Method. Forthcoming in Management Science, 2005.
 
13
A. Parasuraman, V. Zeithaml, and L. Berry. A Conceptual Model of Service Quality and Its Implications for Future Research. Journal of Marketing, 49:41--50, 1985.
 
14
T. Sandholm. Automated mechanism design: A New Application Area for Search Algorithms. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2003.
15
 
16
L.-H. Vu, M. Hauswirth, and K. Aberer. QoS-based Service Selection and Ranking with Trust and Reputation Management. In Proceedings of the International Conference on Cooperative Information Systems (CoopIS 2005), 2005.
17
 
18
A. Whitby, A. Jøsang, and J. Indulska. Filtering out Unfair Ratings in Bayesian Reputation Systems. In Proceedings of the 7th Intl. Workshop on Trust in Agent Societies, 2004.
 
19
E. White. Chatting a Singer Up the Pop Charts. The Wall Street Journal, October 15, 1999.
20

CITED BY  10

Collaborative Colleagues:
Radu Jurca: colleagues
Boi Faltings: colleagues