%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/


%% Created for Phil Windley at 2007-04-02 09:47:46 -0600 


%% Saved with string encoding Western (ASCII) 



@inproceedings{Marti:2004uq,
	Address = {New York, NY, USA},
	Author = {Sergio Marti and Hector Garcia-Molina},
	Booktitle = {EC '04: Proceedings of the 5th ACM conference on Electronic commerce},
	Date-Added = {2007-03-19 07:25:43 -0600},
	Date-Modified = {2007-03-19 07:26:49 -0600},
	Doi = {http://doi.acm.org/10.1145/988772.988787},
	Isbn = {1-58113-711-0},
	Keywords = {reputation p2p},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/p91-marti.pdf},
	Location = {New York, NY, USA},
	Pages = {91--101},
	Publisher = {ACM Press},
	Title = {Limited reputation sharing in P2P systems},
	Year = {2004}}

@book{wasserman_faust94,
	Abstract = {Abstract
-----------
Social network analysis, which focuses on relationships among social entities, is used widely in the social and behavioral sciences, as well as in economics, marketing, and industrial engineering. Social Network Analysis: Methods and Applications reviews and discusses methods for the analysis of social networks with a focus on applications of these methods to many substantive examples. As the first book to provide a comprehensive coverage of the methodology and applications of the field, this study is both a reference book and a textbook.

Contents
-------------
Part I. Introduction: Networks, Relations, and Structure: 1. Relations and networks in the social and behavioral sciences; 2. Social network data: collection and application; Part II. Mathematical Representations of Social Networks: 3. Notation; 4. Graphs and matrixes; Part III. Structural and Locational Properties: 5. Centrality, prestige, and related actor and group measures; 6. Structural balance, clusterability, and transitivity; 7. Cohesive subgroups; 8. Affiliations, co-memberships, and overlapping subgroups; Part IV. Roles and Positions: 9. Structural equivalence; 10. Blockmodels; 11. Relational algebras; 12. Network positions and roles; Part V. Dyadic and Triadic Methods: 13. Dyads; 14. Triads; Part VI. Statistical Dyadic Interaction Models: 15. Statistical analysis of single relational networks; 16. Stochastic blockmodels and goodness-of-fit indices; Part VII. Epilogue: 17. Future directions.},
	Annote = {Currently, the most comprehensive reference book on social network analysis.  
    The book provides a thorough overview of the field and is a great reference. It is nearly 800 pages.},
	Author = {Wasserman, Stanley and Faust, Katherine},
	Date-Added = {2007-03-14 09:11:11 -0600},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Isbn = {9780521387071},
	Keywords = {social+networks},
	Publisher = {Cambridge University Press},
	Title = {Social Network Analysis: Methods and Applications},
	Url = {http://www3.cambridge.org/us/catalogue/catalogue.asp?isbn=0521387078},
	Year = 1994}

@inproceedings{Felleisen:2003qy,
	Abstract = {Abstract. Developing interactive Web programs poses unique problems. Due to the 
limitations of server protocols, interactive Web programs (conceptually) consists of 
numerous ``scripts'' that communicate with each other through Web forms and other 
external storage. For simplistic applications, one can think of such scripts as plain 
functions that consume a Web page (form) and produce a Web page in response. For 
complex applications, this view leads to subtle, and costly, mistakes. These lecture 
notes explain how to overcome many of these problems with a mostly functional 
programming style that composes scripts via (hidden) first-class continuations. },
	Author = {Matthias Felleisen},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {Advanced Functional Programming},
	Date-Added = {2007-03-14 08:48:53 -0600},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Editor = {Johan Jeuring and Simon L. Peyton Jones},
	Isbn = {3-540-40132-6},
	Keywords = {continuations, web+programming, orbitz},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/afp2002-f.pdf},
	Pages = {100-128},
	Publisher = {Springer},
	Rating = {5},
	Read = {Yes},
	Series = {Lecture Notes in Computer Science},
	Title = {Developing Interactive Web Programs},
	Volume = {2638},
	Year = {2003}}

@inproceedings{Bhargav-Spantzel:2006fk,
	Abstract = {Abstract. User centricity is a significant concept in federated identity management 
(FIM), as it provides for stronger user control and privacy. However, several notions 
of user-centricity in the FIM community render its semantics unclear and ham- 
per future research in this area. Therefore, we consider user-centricity abstractly 
and establish a comprehensive taxonomy encompassing user-control, architecture, 
and usability aspects of user-centric FIM. We highlight the various mechanisms to 
achieve the properties identified in the taxonomy. We show how these mechanisms 
may differ based on the underlying technologies which in turn result in different 
trust assumptions. We classify the technologies into two predominant variants of 
user-centric FIM systems with significant feature sets. We distinguish credential- 
focused systems, which advocate offline identity providers and long-term creden- 
tials at a user's client, and relationship-focused systems, which rely on the relation- 
ships between users and online identity providers that create short-term credentials 
during transactions. Note that these two notions of credentials are quite different. 
The former encompasses cryptographic credentials as defined by Lysyanskaya et 
al. [37], and the latter encompasses federation tokens as used in today's FIM pro- 
tocols like Liberty. 
We raise the question where user-centric FIM systems may go---within the lim- 
itations of the user-centricity paradigm as well as beyond them. Firstly, we inves- 
tigate the existence of a universal user-centric FIM system that can achieve a su- 
perset of security and privacy properties as well as the characteristic features of 
both predominant classes. Secondly, we explore the feasibility of reaching beyond 
user-centricity, that is, allowing a user of a user-centric FIM system to again give 
away user-control by means of an explicit act of delegation. We do neither claim a 
solution for universal user-centric systems nor for the extension beyond the bound- 
aries of user-centricity, however, we establish a starting point for both ventures by 
leveraging the properties of a credential-focused FIM system. 
},
	Address = {New York, NY, USA},
	Annote = {These notes actually refer to a longer pre-pub version.

Credential and relationship focused approaches

Relationship--like credit card (IdP contact each time it's used)

Credential--like passport (the credential is self-contained, issing authority not involved)

Presents idea of "universal" system that combines both of these AND allows delegation (difficult in two previous models)

Contribution:
1.) taxonomy
2.) technical menchanisms used to implement taxonomy
3.) discussion of prodominant paradigms and "universal" system

"unlinkability" - possibility of linking two transactions together difficult to achieve with the use of global identifiers.  Anyone doing it?  

I'm not sure Figure 2 adds much to the paper that a simple sentence wouldn't communicate just as well.  A better use of space would be a concept map that helps map out the difference between the two major phyla (relationship and credential)

Figure 3 is overly complex.  Just applying some layout conventions to avoi crossing lines would be a good first step.  Related concepts could be collaped in the interest of space ad udnerstading (non-repudiation, confidentiality, and integrity are all related concepts that could be part of a single bubble)

Figure 5, of course is even worse.  Consider some kind of stack diagram (like TCP/IP stack).  

There is some *very* good information here and spending a few hundred dollars to get someone who is an expert in "presentation" to work it over would be money well spent.  

Section 4.1 misses what I consider to be a major disadvantage of credential systems: users have to manage them.  With a relationship-based system, someone else is managing the system and so user workload is lessened.  

Intuitive, easy-to-use interface is nice to posit, but examples would be nice.  Is it possible that one system or the other (relationship vs. credential) will lead to better interfaces?  Managing credentials is hard and it's too easy to theorize the problems away.  PKI is a credential based system that has failed, in part, because of the difficulty in managing the certificates.  Relationship based system have an IdP to manage the system for the user and make it easy to use.  
  
   

},
	Author = {Abhilasha Bhargav-Spantzel and Jan Camenisch and Thomas Gross and Dieter Sommer},
	Booktitle = {DIM '06: Proceedings of the second ACM workshop on Digital identity management},
	Date-Added = {2007-02-16 08:39:43 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {http://doi.acm.org/10.1145/1179529.1179531},
	Isbn = {1-59593-547-9},
	Keywords = {identity, user-centric, taxonomy},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/jcs1-abhi1_v1.pdf},
	Location = {Alexandria, Virginia, USA},
	Pages = {1--10},
	Publisher = {ACM Press},
	Title = {User centricity: a taxonomy and open issues},
	Year = {2006}}

@inproceedings{Krukow:2005fk,
	Abstract = {Trust and reputation systems represent a significant trend in decision support for Internet 
mediated service provision. The basic idea is to let parties rate each other, for example 
after the completion of a transaction, and use the aggregated ratings about a given party 
to derive a trust or reputation score, which can assist other parties in deciding whether or 
not to transact with that party in the future. A natural side effect is that it also provides 
an incentive for good behaviour, and therefore tends to have a positive effect on market 
quality. Reputation systems can be called collaborative sanctioning systems to reflect their 
collaborative nature, and are related to collaborative filtering systems. Reputation systems 
are already being used in successful commercial online applications. There is also a rapidly 
growing literature around trust and reputation systems, but unfortunately this activity is not 
very coherent. The purpose of this article is to give an overview of existing and proposed 
systems that can be used to derive measures of trust and reputation for Internet transac- 
tions, to analyse the current trends and developments in this area, and to propose a research 
agenda for trust and reputation systems. 
},
	Address = {New York, NY, USA},
	Annote = {Definition 1 (Reliability Trust) Trust is the subjective probability by which an in- 
dividual, A, expects that another individual, B, performs a given action on which 
its welfare depends. 

Definition 2 (Decision Trust) Trust is the extent to which one party is willing to 
depend on something or somebody in a given situation with a feeling of relative 
security, even though negative consequences are possible. 

Definition 3 (Reputation) Reputation is what is generally said or believed about 
a person's or thing's character or standing. 

``Reputational elements'' or features as a generalization of ``claims'' -- facts that can be ascertained

``Collaborative sanctioning'' vs. ``Collaborative filtering'' Reputation systesm are the former. Recomendation systems are the latter. Collaborative filtering depends on the users recognizing that accuracy helps them. Reputation systems, on the other hand, may reward people for inaccurate data.

Trust class:
* Provision trust
* Access trust
* Delegation trust
* Identity trust
* Context trust

Trust purpose is an overarching concept that can be used to express any operational instantiation of the trust classes mentioned above.

},
	Author = {Karl Krukow and Mogens Nielsen and Vladimiro Sassone},
	Booktitle = {CCS '05: Proceedings of the 12th ACM conference on Computer and communications security},
	Date-Added = {2007-02-12 09:02:48 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {http://doi.acm.org/10.1145/1102120.1102155},
	Isbn = {1-59593-226-7},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/JIB2007-DSS.pdf},
	Location = {Alexandria, VA, USA},
	Pages = {260--269},
	Publisher = {ACM Press},
	Title = {A framework for concrete reputation-systems with applications to history-based access control},
	Year = {2005}}

@techreport{RePEc:wpa:wuwpio:0301011,
	Abstract = {This paper explores the trade-off between the short-term benefits of 
false quality advertisements against the longer term costs of reputation 
damage. A directed search model is constructed in which submarkets 
are created by the advertisements and reputations of sellers. A reputa- 
tion system links misleading advertisements in the present period to a 
lower reputation in the next period. We show that a reputation system 
always increases the prices of high quality products and directs search 
more accurately towards the sellers with such products. We also show 
that buyers are hurt by a reputation system if the market is thin --- has 
few sellers --- because the equilibrium increase in prices is greater than 
the equilibrium increase in the quality of trade. Finally, we show that 
a reputation system which screens for honesty increases social welfare 
by making sellers more truthful. However, we also show that a repu- 
tation for honesty is not always highly valued and that an alternative 
reputation system which screens for type can be more effective. 
},
	Annote = {
Assumptions:

Two product qualities: high low
Two seller types
bad sellers always sell low auality products
no communication between buyers
Buyers never purchase from the same seller twice
once you choose a seller, you can't buy from someone else
market operates for two periods
Reserve price at every auction is 0

Sophisticated mathematical model of markets which resemble online auctions (although the example in the book is "pick your own" orchards).  

Theorem 1 A partition of sel lers into two quality differentiated submarkets 
deceases the welfare of buyers if (i) the partition does not satisfy EC or (ii) 
the market is sufficiently `thin'. The welfare of buyers increases otherwise. 

EC says that all buyers end up in high quality market when it's satisfied.

},
	Author = {John Kennes and Aaron Schiff},
	Date-Added = {2007-02-09 08:32:45 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Institution = {The University of Auckland},
	Keywords = {reputation markets economics value},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/0301011.pdf},
	Month = Jan,
	Note = {available at http://ideas.repec.org/p/wpa/wuwpio/0301011.html},
	Number = {0301011},
	Title = {The Value of a Reputation System},
	Type = {Industrial Organization},
	Year = 2003}

@phdthesis{Fielding:2000fk,
	Abstract = {The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internet-scale distributed hypermedia system. The Web has been iteratively developed over the past ten years through a series of modifications to the standards that define its architecture. In order to identify those aspects of the Web that needed improvement and avoid undesirable modifications, a model for the modern Web architecture was needed to guide its design, definition, and deployment.

Software architecture research investigates methods for determining how best to partition a system, how components identify and communicate with each other, how information is communicated, how elements of a system can evolve independently, and how all of the above can be described using formal and informal notations. My work is motivated by the desire to understand and evaluate the architectural design of network-based application software through principled use of architectural constraints, thereby obtaining the functional, performance, and social properties desired of an architecture. An architectural style is a named, coordinated set of architectural constraints.

This dissertation defines a framework for understanding software architecture via architectural styles and demonstrates how styles can be used to guide the architectural design of network-based application software. A survey of architectural styles for network-based applications is used to classify styles according to the architectural properties they induce on an architecture for distributed hypermedia. I then introduce the Representational State Transfer (REST) architectural style and describe how REST has been used to guide the design and development of the architecture for the modern Web.

REST emphasizes scalability of component interactions, generality of interfaces, independent deployment of components, and intermediary components to reduce interaction latency, enforce security, and encapsulate legacy systems. I describe the software engineering principles guiding REST and the interaction constraints chosen to retain those principles, contrasting them to the constraints of other architectural styles. Finally, I describe the lessons learned from applying REST to the design of the Hypertext Transfer Protocol and Uniform Resource Identifier standards, and from their subsequent deployment in Web client and server software.},
	Address = {Irvine},
	Annote = {
Software Architecture - abstraction that hides details in order to better identify and sustain important properties of the software

Defined in terms of a configuration of architectural elements: components, connectors, and data

Component is an asbtract unit of software instructions and internal state that provides a transformation of data via its interface
- Most easily identified
- Observable behavior is what is part of the architecture

Connectors are abstract mechanisms that mediate communication, coordination, or cooperation among components.
- transfers data between compnents without transforming it
- e.g. shared representations, RPC, message-passing protocols, and data streams

Data is an element of information that is transfered from a component or received by a component via a connector

Configuration gives the structural relationships among components, connectors, and data


},
	Author = {Fielding, Roy T.},
	Citeulike-Article-Id = {445068},
	Comment = {online},
	Date-Added = {2007-01-31 08:36:35 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {architecture component+based rest web},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/fielding_dissertation.pdf},
	Priority = {4},
	School = {University of California},
	Title = {Architectural Styles and the Design of Network-based Software Architectures},
	Url = {http://www.ics.uci.edu/~fielding/pubs/dissertation/fielding_dissertation.pdf},
	Year = {2000}}

@article{Lamport:1982lr,
	Address = {New York, NY, USA},
	Author = {Leslie Lamport and Robert Shostak and Marshall Pease},
	Date-Added = {2007-01-29 10:41:35 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {http://doi.acm.org/10.1145/357172.357176},
	Issn = {0164-0925},
	Journal = {ACM Trans. Program. Lang. Syst.},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/byz.pdf},
	Number = {3},
	Pages = {382--401},
	Publisher = {ACM Press},
	Rating = {5},
	Read = {Yes},
	Title = {The Byzantine Generals Problem},
	Volume = {4},
	Year = {1982}}

@misc{akismet:url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://akismet.com/development/api/}},
	Key = {akismet:url},
	Keywords = {analysis, reputation},
	Title = {Akismet {API} Documentation Version 1.1},
	Url = {\url{http://akismet.com/development/api/}},
	Year = 2006}

@misc{amazonauctions:url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://auctions.amazon.com}},
	Key = {amazonauctions:url},
	Keywords = {website, auction},
	Title = {Amazon Auctions},
	Url = {\url{http://auctions.amazon.com}},
	Year = 2006}

@book{axelrod:cooperation,
	Address = {New York},
	Author = {Axelrod, Robert},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {evolution, cooperation, trust, altruism},
	Publisher = {Basic Books},
	Title = {The Evolution of Cooperation},
	Year = 1984}

@book{bromley93,
	Author = {Dennis B.~Bromley},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {reputation, social, trust},
	Publisher = {John Wiley \& Sons},
	Title = {Reputation, Image and Impression Management},
	Year = 1993}

@misc{cardspace_intro,
	Author = {David Chappel},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://msdn2.microsoft.com/en-gb/library/aa480189.aspx}},
	Key = {cardspace_intro},
	Keywords = {identity, cardspace, windows},
	Month = {April},
	Title = {Understanding {Windows} {CardSpace}},
	Url = {\url{http://msdn2.microsoft.com/en-gb/library/aa480189.aspx}},
	Year = 2006}

@article{carter02:reputation_formalization,
	Author = {Jonathan Carter and Elijah Bitting and Ali A. Ghorbani},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {Computational Intelligence},
	Keywords = {reputation, p2p},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/TR02_153.pdf},
	Number = 5,
	Pages = {45-64},
	Title = {Reputation Formalization Within Information Sharing Multiagent Architectures},
	Volume = 2,
	Year = 2002}

@inbook{dasgupta00:trust_as_commod,
	Author = {Partha Dasgupta},
	Chapter = {Trust As a Commodity},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\urlhttp://www.sociology.ox.ac.uk/papers/dasgupta49-72.pdf},
	Keywords = {trust, reputation},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/dasgupta49-72.pdf},
	Pages = {49-72},
	Publisher = {Department of Sociology, University of Oxford},
	Title = {Trust: Making and Breaking Cooperative Relations},
	Url = {\url{http://www.sociology.ox.ac.uk/papers/dasgupta49-72.pdf}},
	Year = 2000}

@inproceedings{dellarocas00:immunizing,
	Author = {Chrysanthos Dellarocas},
	Booktitle = {Proceedings of the $2^{nd}$ ACM Conference on Electronic Commerce},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {reputation, systems},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/ec00reputation.pdf},
	Organization = {ACM},
	Title = {Immunizing Online Reputation Reporting Systems Against Unfair Ratings and Discriminatory Behavior},
	Year = 2000}

@article{dellarocas03:digit_word_mouth,
	Abstract = {Online feedback mechanisms harness the bi-directional communication capabilities of the 
Internet in order to engineer large-scale word-of-mouth networks. Best known so far as a 
technology for building trust and fostering cooperation in online marketplaces, such as eBay, 
these mechanisms are poised to have a much wider impact on organizations. Their growing 
popularity has potentially important implications for a wide range of management activities, such 
as brand building, customer acquisition and retention, product development, and quality 
assurance. This paper surveys our progress in understanding the new possibilities and challenges 
that these mechanisms represent. It discusses some important dimensions in which Internet-based 
feedback mechanisms differ from traditional word-of-mouth networks and surveys the most 
important issues related to their design, evaluation, and use. It provides an overview of relevant 
work in game theory and economics on the topic of reputation. It discusses how this body of 
work is being extended and combined with insights from computer science, management 
science, sociology, and psychology in order to take into consideration the special properties of 
online environments. Finally, it identifies opportunities that this new area presents for OR/MS 
research. 
},
	Annote = {Word-of-mouth networks constitute an ancient solution to a timeless problem of social 
organization: the elicitation of good conduct in communities of self-interested individuals who 
have short-term incentives to cheat one another. The historical appeal of these networks has been 
their power to induce cooperation without the need for costly enforcement institutions. 

With respect to eBay: In the author's opinion, the two most concrete evaluation criteria of a feedback mechanism's  performance ought to be (a) the expected payoffs of the outcomes induced by the mechanism for the various classes of stakeholders over the entire time horizon that matters for each of them and  (b) the robustness of those outcomes against different assumptions about the participants' 
behavior.

5.6: The ambition of a discipline of online feedback mechanism design is the inducement of social 
outcomes with a degree of precision that approaches that of engineering design. This, in turn, 
requires precise modeling not only of the technological components of those systems but also of 
the human users.  
	},
	Author = {Dellarocas, Chrysanthos N.},
	Date-Modified = {2007-04-02 09:46:54 -0600},
	Doi = {10.2139/ssrn.393042},
	Journal = {SSRN eLibrary},
	Keywords = {online+feedback+mechanisms, reputation, systems, e-commerce, internet, game+theory, management+science, operations+research},
	Language = {English},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/SSRN-id393042.pdf},
	Location = {\url{http://ssrn.com/paper=393042}},
	Publisher = {SSRN},
	Rating = {4},
	Read = {Yes},
	Title = {The Digitization of Word-of-Mouth: Promise and Challenges of Online Feedback Mechanisms},
	Year = 2003}

@inproceedings{dingledine01,
	Address = {New York, NY, USA},
	Author = {Dingledine, Roger and Freedman, Michael J. and Molnar, David},
	Booktitle = {International workshop on Designing privacy enhancing technologies},
	Citeulike-Article-Id = 449394,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Isbn = 3540417249,
	Keywords = {anonymity, privacy, free-haven, p2p, security, systems},
	Pages = {67--95},
	Publisher = {Springer-Verlag New York, Inc.},
	Title = {The free haven project: distributed anonymous storage service},
	Url = {\url{http://portal.acm.org/citation.cfm?id=371978}},
	Year = 2001}

@misc{ebay:url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.ebay.com}},
	Key = {ebay:url},
	Keywords = {website, auction},
	Title = {{eBay}},
	Url = {\url{http://www.ebay.com}},
	Year = 2006}

@inproceedings{esfandiari01:agents_make_friends,
	Author = {B. Esfandiari and S. Chandrasekharan},
	Booktitle = {Proceedings of the Fourth Workshop on Deception, Fraud and Trust in Agent Societies 2001},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {trust, reputation, p2p},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/trustworkshop.pdf},
	Pages = {27--34},
	Title = {On how agents make friends: mechanisms for trust acquisition},
	Url = {\url{http://www.sce.carleton.ca/faculty/esfandiari/papers/trustworkshop.pdf}},
	Year = {2001}}

@article{friedman:cheap_pseudonyms,
	Abstract = {On the Internet it is easy for someone to obtain a new identity.  This
introduces opportunities to misbehave without paying reputational
consequences. A large degree of cooperation can still emerge, through
a convention in which newcomers ``pay their dues'' by accepting
poor treatment from players who have established positive
reputations. One might hope for an open society where newcomers are
treated well, but there is an inherent social cost in making the
spread of reputations optional. We prove that no equilibrium can
sustain significantly more cooperation than the dues-paying
equilibrium in a repeated random matching game in which players have
finite lives and the ability to change their identities, and there is
a small but nonvanishing probability of mistakes and a large number of
players.

Although one could remove this inefficiency by disallowing anonymity,
this is not practical or desirable in a wide variety of
transactions. We discuss the use of entry fees, which permit newcomers
to be trusted but exclude some players with low payoffs, thus
introducing a different inefficiency. We also discuss the use of
unchangeable pseudonyms, and describe a mechanism which implements
them using standard encryption techniques. },
	Author = {Friedman, Eric and Resnick, Paul},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {Journal of Economics and Management Strategy},
	Keywords = {reputation, economics, identity, privacy},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/The_Social_Cost_of_Cheap_Pseudonyms.pdf},
	Number = 2,
	Pages = {173-199},
	Pdf = {\url{http://www.si.umich.edu/~presnick/papers/identifiers/081199.pdf}},
	Title = {The Social Cost of Cheap Pseudonyms},
	Url = {\url{http://www.si.umich.edu/~presnick/papers/identifiers/index.html}},
	Volume = 10,
	Year = 2001}

@book{hume:human_nature,
	Author = {David Hume},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {philosophy, trust, reputation},
	Publisher = {Penguine Classics (1975)},
	Title = {A Treatise on Human Nature},
	Url = {\url{http://socserv2.socsci.mcmaster.ca/~econ/ugcm/3ll3/hume/treat.html}},
	Year = {1739-1740}}

@techreport{labalme01:_enhan_inter_reput,
	Author = {Labalme, Fen and Burton, Kevin},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Institution = {OpenPrivacy.org},
	Keywords = {reputation, trust},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/enhancing.pdf},
	Month = {March},
	Number = {0.7},
	Title = {Enhancing the Internet with Reputations},
	Url = {\url{http://www.openprivacy.org/papers/200103-white.html}},
	Year = 2001}

@misc{labalme:_openp,
	Author = {Labalme, Fen and Burton, Kevin},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.openprivacy.org/}},
	Keywords = {website, privacy, reputation, trust},
	Title = {{OpenPrivacy.org}},
	Url = {\url{http://www.openprivacy.org/}}}

@inproceedings{lin05:_reput_trust,
	Annote = {Defines trust in terms of identity, qualification, and reputation

Defines a trust hierarchy:  direct -> connected -> institutional -> no trust

Reputation record:

1.) user ID
2.) Rating (real number between 0 and 1)
3.) size (number of txns involved in calculation
4.) timestamp

Reputation request can be qualified on the basis of the number of txns involved

Reputation calculation includes a discount factor that takes the newness of the txns into account (favors new txns over old)

External brokers are queried for additional txns.   A trust value is initialized at 0.5 and moves up or down based on the consistency of the result from the broker and user feedback.  

Broker requests are recursive.  Depth parameter limits fan-out.  M brokers are contact.  Depth paramater and M aredetermined  based on how many txns there are in the local database.

Assumptions in evaluation of model

- consistency factor randomly (uniformly) defined
- feedback is completely honest

These are probably not realistic.  Use a powerlaw for the CF assignment and let feedback be wrong sometimes.  },
	Author = {Lin, Kwei-Jay and Lu, Haiyin and Yu, Ta and Tai, Chia-en},
	Booktitle = {International Conference on e-Technology, e-Commerce, and e-Services},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {reputation, trust},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/reput_trust_management.pdf},
	Month = {April},
	Pages = {262-269},
	Publisher = {IEEE},
	Rating = {4},
	Read = {Yes},
	Title = {A Reputation and Trust Management Broker Framework for Web Applications},
	Url = {\url{http://doi.ieeecomputersociety.org/10.1109/EEE.2005.14}},
	Year = 2005}

@article{livingston05:_how_valuable,
	Author = {Livingston, Jeffrey A.},
	Citeulike-Article-Id = 273352,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1162/0034653054638391},
	Issn = {0034-6535},
	Journal = {The Review of Economics and Statistics},
	Keywords = {reputation, identity, economics},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/livingston-ebay-reputation.pdf},
	Month = {August},
	Number = 3,
	Pages = {453--465},
	Publisher = {MIT Press},
	Rating = {4},
	Read = {Yes},
	Title = {How Valuable Is a Good Reputation? A Sample Selection Model of Internet Auctions},
	Url = {\url{http://dx.doi.org/10.1162/0034653054638391}},
	Volume = 87,
	Year = 2005}

@book{luna04,
	Author = {J.~Jack Luna},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {identity, privacy},
	Publisher = {Thomas Dunne Books},
	Rating = {3},
	Read = {Yes},
	Title = {How To Be Invisible},
	Year = 2004}

@phdthesis{marsh94:_formal_trust,
	Abstract = {Trust is a judgement of unquestionable utility ---
                  as humans we use it every day of our
                  lives. However, trust has suffered from an
                  imperfect understanding, a plethora of definitions,
                  and informal use in the literature and in everyday
                  life. It is common to say {"}I trust you,{"} but
                  what does that mean? This thesis provides a
                  clarification of trust. We present a formalism for
                  trust which provides us with a tool for precise
                  discussion. The formalism is implementable: it can
                  be embedded in an...},
	Author = {Marsh, S.},
	Citeulike-Article-Id = 373720,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {trust},
	School = {University of Sterling},
	Title = {Formalising Trust as a Computational Concept},
	Url = {\url{http://citeseer.ist.psu.edu/marsh94formalising.html}},
	Year = 1994}

@article{milgrom82,
	Author = {Paul~R.~Milgrom and John Roberts},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {Journal of Economic Theory},
	Keywords = {reputation, economics},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/milrob.pdf},
	Pages = {280-312},
	Pdf = {\url{http://scholar.google.com/url?sa=U&q=http://www.polisci.ucsd.edu/~bslantch/courses/pdf/milgrom-jet1982v27n2.pdf}},
	Title = {Predation, Reputation, and Entry Deterrence},
	Volume = 27,
	Year = 1982}

@misc{miller:_microid_canon,
	Author = {Miller, Jeremie},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://microid.org/}},
	Keywords = {website, identity, claims},
	Title = {{MicroID} - Small, Decentralized, and Verifiable Identity},
	Url = {http://microid.org/}}

@inproceedings{mui02:notion_reput_multi_agent_system,
	Address = {Bologna, Italy},
	Author = {Lik Mui and Mojdeh Mohtashemi and Ari Halberstadt},
	Booktitle = {Proceedings of the First International Conference on Auto\-no\-mous Agents and MAS},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Isbn = {1-58113-480-0/02/0007},
	Keywords = {reputation, p2p},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/p280-mui.pdf},
	Month = {July},
	Pages = {280--287},
	Publisher = {ACM},
	Title = {Notions of Reputation in Multi-Agent Systems: A Review},
	Url = {\utl{http://portal.acm.org/citation.cfm?id=544807&dl=ACM&coll=portal}},
	Value = {cb},
	Year = 2002}

@inproceedings{mui:computation_model_reputation,
	Author = {Lik Mui and Mojdeh Mohtashemi and Ari Halberstadt},
	Booktitle = {Proceedings of the 35th Hawaii International Conference on System Sciences},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {reputation},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/14350188-1.pdf},
	Organization = {IEEE},
	Publisher = {IEEE},
	Rating = {4},
	Read = {Yes},
	Title = {A Computational Model of Trust and Reputation},
	Year = 2002}

@misc{netcraft:url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.netcraft.com/}},
	Key = {netcraft:url},
	Keywords = {website, fraud, networks, trust, phishing},
	Title = {Netcraft},
	Url = {\url{http://www.netcraft.com/}},
	Year = 2006}

@misc{openid_spec,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://openid.net/specs.bml}},
	Key = {openid_spec},
	Keywords = {website, identity, openid, specification},
	Title = {{OpenID} Specification},
	Url = {\url{http://openid.net/specs.bml}},
	Year = 2006}

@misc{reputation:newsmonster_url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.newsmonster.org/}},
	Key = {NewsMonster},
	Keywords = {website, reputation},
	Title = {NewsMonster},
	Url = {\url{http://www.newsmonster.org/}}}

@misc{reputation:reptile_url,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://reptile.openprivacy.org}},
	Key = {Reptile},
	Keywords = {website, reputation},
	Title = {Reptile},
	Url = {\url{http://reptile.openprivacy.org}}}

@article{resnick00:_reput,
	Address = {New York, NY, USA},
	Author = {Resnick, Paul and Kuwabara, Ko and Zeckhauser, Richard and Friedman, Eric},
	Citeulike-Article-Id = 350511,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1145/355112.355122},
	Issn = {0001-0782},
	Journal = {Communications of the ACM},
	Keywords = {communities, community, moderation, networks, reputation, social+systems, trust, trust+network},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/reputations.pdf},
	Month = {December},
	Number = 12,
	Pages = {45--48},
	Publisher = {ACM Press},
	Title = {Reputation systems},
	Url = {\url{http://portal.acm.org/citation.cfm?id=355122}},
	Volume = 43,
	Year = 2000}

@article{resnick:value_reputation,
	Author = {Resnick, Paul and Zeckhauser, Richard and Swanson, John and Lockwood, Kate},
	Citeulike-Article-Id = 684668,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1007/s10683-006-4309-2},
	Issn = {1386-4157},
	Journal = {Experimental Economics},
	Keywords = {reputation, economics},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/PostcardsFinalPrePub.pdf},
	Month = {June},
	Number = 2,
	Pages = {79--101},
	Publisher = {Springer},
	Title = {The Value of Reputation on {eBay}: A Controlled Experiment},
	Url = {\url{http://dx.doi.org/10.1007/s10683-006-4309-2}},
	Volume = 9,
	Year = 2006}

@misc{rools,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://rools.rubyforge.com}},
	Key = {Rools},
	Keywords = {website, ruby, rules+engine},
	Title = {Rools, A Rules Engine for Ruby},
	Url = {\url{http://rools.rubyforge.com}}}

@article{sabater02:_social_regret,
	Address = {New York, NY, USA},
	Author = {Sabater, Jordi and Sierra, Carles},
	Citeulike-Article-Id = 350514,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1145/844331.844337},
	Journal = {SIGecom Exch.},
	Keywords = {networks, regret, reputation, sna, social},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/p44-sabater.pdf},
	Number = 1,
	Pages = {44--56},
	Publisher = {ACM Press},
	Title = {Social ReGreT, a reputation model based on social relations},
	Url = {\url{http://portal.acm.org/citation.cfm?id=844337}},
	Volume = 3,
	Year = 2002}

@article{sabater05:review_comput_trust_reput_model,
	Abstract = {
The scientific research in the area of computational mechanisms for trust and reputation in virtual societies is a recent discipline oriented to increase the reliability and performance of electronic communities. Computer science has moved from the paradigm of isolated machines to the paradigm of networks and distributed computing. Likewise, artificial intelligence is quickly moving from the paradigm of isolated and non-situated intelligence to the paradigm of situated, social and collective intelligence. The new paradigm of the so called intelligent or autonomous agents and multi-agent systems (MAS) together with the spectacular emergence of the information society technologies (specially reflected by the popularization of electronic commerce) are responsible for the increasing interest on trust and reputation mechanisms applied to electronic societies. This review wants to offer a panoramic view on current computational trust and reputation models.},
	Annote = {Cognative and game-theoretical models

Information sources
- Direct experience
- Witeness information/word of mouth
- Socialogical information
- Prejudice

Visability
- Global (publicly available)
- Subjective (personal)

Granularity
- single context (one reputation for every situation)
- multiple context 

Agent behavior assumptions
- Cheating is not considered
- Agents can hide information, but not lie
- Model has mechanisms to deal with liars

Information Types
- Boolean
- Continuous

Reliability of reputation value
- Number of interactions
- Reliability of witness
- Data age
- information relevance 

Marsh
- Takes importance of action into account
- Deals woth reciprocity

Online
- Global scope
- Level 0 honesty

Sporas
- Evolved version of online modesl
- Most recent rating is considered
- high reputation is slow to change
- low reputation is quick to change

Hispots
- Expands Sporos
- Graph of ratings (interactions)
- Drawback: good reputation as "seller" doesn't mean your a reliable witness
- Reputaiton is recursively calculated

Schillo
- Interactions are rated with bolean value
- Probability based
- Agents can be interviewed about interactions
- Can't lie, but can hide positive information

Abdul-Rahman
- Four degrees
- Keeps tuples of past exerpiences (tuples reflect 4 degrees)
- Adjusts witness info based on past interactions

Esfandiary
- Acquire inforamtion through observations and interaction
- build trust graph
- coloring edges of graph takes context into account
- does not take both sources of data into account in a single reputaiotn query

Yu and SIngh
- Agenst store QoS data about interactions
- Agents can be queried
- if they have information they return it
- it not, the return a list of agents they think might have it
- only used when direct interaction info not available

Sen and Sajja
- Liars always lie
- assumes noisy information

Afras
- Fuzzy sets
- weighted averages between old can current value

Carter
- Societal expectation
- Roles in society taken into account
- Measure how well agent fulfills it's role in society

ReGreT
- eCommerce environments
- modular design
- Three types of reputaiton: witness, neighborhood, system
- Agents choose what information to include
- Provides ontological structure to link relevant reputations


},
	Author = {Sabater, Jordi and Sierra, Carles},
	Citeulike-Article-Id = 156190,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1007/s10462-004-0041-5},
	Issn = {0269-2821},
	Journal = {Artificial Intelligence Review},
	Keywords = {computational+metrics, reputation, trust},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/out.pdf},
	Month = {September},
	Number = 1,
	Pages = {33--60},
	Publisher = {Kluwer Academic Publishers},
	Rating = {4},
	Read = {Yes},
	Title = {Review on Computational Trust and Reputation Models},
	Url = {\url{http://dx.doi.org/10.1007/s10462-004-0041-5}},
	Volume = 24,
	Year = 2005}

@article{schillo00:using_trust,
	Author = {Michael Schillo and Petra Funk and Michael Rovatsos},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {In Applied Artificial Intelligence, Special Issue on Trust, Deception and Fraud in Agent Societies},
	Keywords = {trust, reputation, agents, p2p},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/schillo00using.pdf},
	Month = {September},
	Number = 8,
	Pages = {825-848},
	Title = {Using Trust for Detecting Deceitful Agents in Artificial Societies},
	Volume = 14,
	Year = 2000}

@inproceedings{sen02:robust_reputation,
	Abstract = {We consider the problem of user agents selecting processor 
agents to processor tasks. We assume that processor agents 
are drawn from two populations: high and low-performing 
processors with different averages but similar variance in 
performance. For selecting a processor, a user agent queries 
other user agents for their high/low rating of different pro- 
cessors. We assume that a known percentage of ``liar'' users, 
who give inverse estimates of processors. We develop a trust 
mechanism that determines the number of users to query 
given a target guarantee threshold likelihood of choosing 
high-performance processors in the face of such ``noisy'' rep- 
utation mechanisms. We evaluate the robustness of this 
reputation-based trusting mechanism over varying environ- 
mental parameters like percentage of liars, performance dif- 
ference and variances for high and low-performing agents, 
learning rates, etc. },
	Address = {New York, NY, USA},
	Annote = {Motivation:
- User identifies one of several agents that provide a service it needs.  
- Performance of service providers varies
- User polls other users who have knowledge of service providers

Analyze the effect of decietful or lying user agents who provide false ratings

Goal is graceful degradation: as liar population increases, performance falls off "gently"

Problems:
- Users see differnent service levels from providers due to variability in many factors.  No single measure of a serice provider's serice level.
- Deceitful users. System models deceitful users as "consistent" --they are always deceitful. 

This is a reputation "updating" system where the new reputation score is calculated based on the old reputation score and new data received since the old value was calculated.  

- Ratings are boolean
- No model of the nature of user agents (een if you think one's lied to you before, you still include them in the pool of potential agents to query).

Key observation: performance drops off precipitously when the percentage of liars reaches 40% of the population.  

Not surprisingly, as the relative performance difference of service providers decreases, the ability of the algorithm to chose a good service provider decreases.  

Questions:

1.) How is this related to Byzantine Generals problem?
2.) Performance oscillates consistently, why?  Is this an artifact of the model?},
	Author = {Sandip Sen and Neelima Sajja},
	Booktitle = {AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {\url{http://doi.acm.org/10.1145/544741.544808}},
	Isbn = {1-58113-480-0},
	Keywords = {trust, reputation},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/p288-sen.pdf},
	Location = {Bologna, Italy},
	Pages = {288--293},
	Publisher = {ACM Press},
	Title = {Robustness of reputation-based trust: boolean case},
	Url = {\url{http://portal.acm.org/citation.cfm?id=544808}},
	Year = 2002}

@misc{sxip_specification,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://sxip.net/index.php/Specifications_and_Documents}},
	Key = {sxip_specification},
	Keywords = {identity, sxip, specification},
	Title = {{SXIP} 2.0 Protocol Specification},
	Url = {\url{http://sxip.net/index.php/Specifications_and_Documents}},
	Year = 2006}

@article{trivers71,
	Author = {Robert L.~Trivers},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {Quarterly Review of Biology},
	Keywords = {altruism, evolution, reputation, trust},
	Pages = 35,
	Title = {The Evolution of Reciprocal Altruism},
	Volume = 46,
	Year = 1971}

@book{wasserman94,
	Author = {Stanley Wasserman and Katherine Faust},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {trust, social+networks, reputation},
	Publisher = {Cambridge University Press},
	Title = {Social Network Analysis: Methods and Applications},
	Year = 1994}

@misc{windley06:_princ_reput,
	Author = {Windley, Phillip J.},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.windley.com/archives/2006/06/principles_of_r}},
	Keywords = {website, blog, windley, reputation},
	Month = {June},
	Title = {Principles of Reputation},
	Url = {\url{http://www.windley.com/archives/2006/06/principles_of_r}},
	Year = 2006}

@book{windley:digital_id,
	Author = {Phillip J.~Windley},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Keywords = {identity, reputation, trust, architecture},
	Publisher = {O'Reilly Media},
	Rating = {5},
	Read = {Yes},
	Title = {Digital Identity},
	Year = 2004}

@misc{xri_xdi_explained,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Howpublished = {\url{http://www.xdi.org/xri-and-xdi-explained.html}},
	Key = {xri_xdi_explained},
	Keywords = {xri, xdi, i-name, identity, tutorial},
	Title = {{XRI} and {XDI} Explained},
	Url = {\url{http://www.xdi.org/xri-and-xdi-explained.html}},
	Year = 2006}

@inproceedings{yu02,
	Address = {New York, NY, USA},
	Annote = {Uses Dempster-Shafer theory of evidence as the underlying computational framework.

Agents determine trustworthiness of another agents using evidence consisting of
1.) set of services offered by the other agent
2.) testimonies from other agents 

Defines notion of "local" (tau) and "total" (pi) beliefs.  Local beliefs are based on direct experience.  Total belief is based on testimonies of others.  Total belief isn't propgated by agents, but local belief is.  

Local belief takes precedence over total belief.  

Defines a "TrustNet" as a direct graph of agents giving referrals.  Referral chains pass referals from a testofying agent to a relying agent.  An algorithm for propogating testimony is given.

Agents determine who they trust, called "neighbors" from a set of acquaintances.   They can add or remove neighbors.  The system settles down rapidly into a set of stable "trusted" cliques.  

Question: what happens to newcomers?  Can they break in, or is the system so stable that it excludes newcomers?

"If several agents in the community are dishonest and agents don't trust each other, the community will collapse."

},
	Author = {Yu, Bin and Singh, Munindar P.},
	Booktitle = {AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems},
	Citeulike-Article-Id = 148934,
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Doi = {10.1145/544741.544809},
	Isbn = 1581134800,
	Keywords = {reputation, trust},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/aamas-02-trust.pdf},
	Pages = {294--301},
	Publisher = {ACM Press},
	Title = {An evidential model of distributed reputation management},
	Url = {\url{http://portal.acm.org/citation.cfm?id=544809}},
	Year = 2002}

@inproceedings{zacharia99:_collab,
	Abstract = {The members of electronic communities are often
                  unrelated to each other, they may have never met
                  and have no information on each other's
                  reputation. This kind of information is vital in
                  electronic commerce interactions, where the
                  potential counterpart's reputation can be a
                  significant factor in the negotiation
                  strategy. This paper proposes two complementary
                  reputation mechanisms that rely on collaborative
                  ratings and personalized evaluation of the various
                  ratings assigned to each user. While these
                  reputation mechanisms are developed in the context
                  of electronic commerce, we believe that they may
                  have applicability in other types of electronic
                  communities such as chatrooms, newsgroups, mailing
                  lists, etc},
	Author = {Giorgos Zacharia and Alexandros Moukas and Pattie Maes},
	Booktitle = {{HICSS}},
	Citeulike-Article-Id = 711647,
	Date-Added = {2007-01-04 14:04:42 -0700},
	Date-Modified = {2007-03-19 07:26:02 -0600},
	Journal = {System Sciences, 1999. HICSS-32. Proceedings of the 32nd Annual Hawaii International Conference on},
	Keywords = {collaborative, e-commerce, moderation, rating, reputation, sporas},
	Local-Url = {file://localhost/Users/pjw/Documents/bib/papers/00018026.PDF},
	Title = {Collaborative reputation mechanisms in electronic marketplaces},
	Url = {\url{http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=773057}},
	Year = 1999}