{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:09Z","timestamp":1750308789601,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>A seller in an online marketplace with an effective reputation mechanism should expect that dishonest behavior results in higher payments now, while honest behavior results in higher reputation---and thus higher payments---in the future. We briefly survey recent results on the Window Aggregation Mechanism, a widely used class of mechanisms that shows the average value of the seller's ratings within some fixed window of past transactions. We suggest approaches for choosing the window size that maximizes the range of parameters for which it is optimal for the seller to be truthful. We show that mechanisms that use information from a larger number of past transactions tend to provide incentives for patient sellers to be more truthful, but for higher quality sellers to be less truthful. We then discuss a broader class of aggregation mechanisms that weight recent ratings more heavily and show that the same insight applies.<\/jats:p>","DOI":"10.1145\/1980534.1980537","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:03Z","timestamp":1305637143000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Designing aggregation mechanisms for reputation systems in online marketplaces"],"prefix":"10.1145","volume":"9","author":[{"given":"Christina","family":"Aperjis","sequence":"first","affiliation":[{"name":"Hewlett Packard Labs"}]},{"given":"Ramesh","family":"Johari","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2010,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Adlakha S. Johari R. Weintraub G. and Goldsmith A. 2010. Mean field equilibrium in concave stochastic games. Working paper.  Adlakha S. Johari R. Weintraub G. and Goldsmith A. 2010. Mean field equilibrium in concave stochastic games. Working paper."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1879431"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Aperjis C. and Johari R. 2010a. Designing reputation mechanisms for efficient trade. Tech. rep. Stanford University.  Aperjis C. and Johari R. 2010a. Designing reputation mechanisms for efficient trade. Tech. rep. Stanford University.","DOI":"10.2139\/ssrn.1596839"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1090.1145"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10683-006-4309-2"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.185.4157.1124"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980534.1980537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1980534.1980537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:52Z","timestamp":1750278172000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980534.1980537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1980534.1980537"],"URL":"https:\/\/doi.org\/10.1145\/1980534.1980537","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2010,6]]},"assertion":[{"value":"2010-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}