skip to main content
10.1145/1389908.1389936acmconferencesArticle/Chapter ViewAbstractPublication PagesduxConference Proceedingsconference-collections
research-article

Avoiding the prisoner's dilemma of the web

Published:05 November 2007Publication History

ABSTRACT

Everyone talks about increasing safety, security and privacy on the web. But in spite of decades of work to achieve these ends, people still find it hard to know which individuals they meet on the Internet they can trust.

Worse still, many sites, including classified ad giant Craigslist, only function when both parties act honestly, an outcome Game Theory has shown to be least likely in such a situation. If the web is to reach its maximum utility, this Prisoner's Dilemma of the Web must be resolved.

In this paper, we detail the causes - and existing remedies for - distrust between individuals on the web. By outlining seven strategies for fostering peer-to-peer trust, we set up a scenario that combines a few of these strategies with Craigslist to create a theoretical model for breaking the web's Prisoner's Dilemma.

References

  1. Kopytoff, Verne. Craigslist users hit by robbers. San Francisco Chronicle (San Francisco, July 2006)Google ScholarGoogle Scholar
  2. Poundstone, W. Prisoner's Dilemma. Doubleday (New York, 1992) Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Fogg, B. J. Stanford Guidelines for Web Credibility. A Research Summary from the Stanford Persuasive Tech Lab. Stanford University. (Palo Alto, May 2002) Webcredibility.org/guidelinesGoogle ScholarGoogle Scholar
  4. Surowiecki, James. The Wisdom of Crowds. Anchor Books (New York, 2005) Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    DUX '07: Proceedings of the 2007 conference on Designing for User eXperiences
    November 2007
    279 pages
    ISBN:9781605583082
    DOI:10.1145/1389908

    Copyright © 2007 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 5 November 2007

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    Overall Acceptance Rate59of59submissions,100%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader