Results 1 -
6 of
6
Peer prediction with private beliefs
- in ‘ACM EC Workshop on Social Computing
, 2011
"... (Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
Ridesharing: The state-of-the-art and future directions
- Transportation Research Part B: Methodological
, 2013
"... Abstract Although ridesharing can provide a wealth of benefits, such as reduced travel costs, congestion, and consequently less pollution, there are a number of challenges that have restricted its widespread adoption. In fact, even at a time when improving communication systems provide real-time de ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract Although ridesharing can provide a wealth of benefits, such as reduced travel costs, congestion, and consequently less pollution, there are a number of challenges that have restricted its widespread adoption. In fact, even at a time when improving communication systems provide real-time detailed information that could be used to facilitate ridesharing, the share of work trips that use ridesharing has decreased by almost 10% in the past 30 years. In this paper we present a classification to understand the key aspects of existing ridesharing systems. The objective is to present a framework that can help identify key challenges in the widespread use of ridesharing and thus foster the development of effective formal ridesharing mechanisms that would overcome these challenges and promote massification.
Incentive-Compatible Trust Mechanisms (Extended Abstract)
"... Trading goods online has numerous advantages. One that is particularly compelling is that online merchants can offer their goods at lower prices compared to their offline counterparts. The physical distance between buyers and sellers, however, also leads to problems of trust. Consider the online auc ..."
Abstract
- Add to MetaCart
(Show Context)
Trading goods online has numerous advantages. One that is particularly compelling is that online merchants can offer their goods at lower prices compared to their offline counterparts. The physical distance between buyers and sellers, however, also leads to problems of trust. Consider the online auction site eBay as an example: its procedure is such that the winning bidder (henceforth the buyer) first pays for the good and that the seller is required to send the good only after receipt of this payment. Without any trust-enabling mechanisms in place, the seller is best off keeping the good for himself, even if he received the payment. Since a rational, self-interested buyer can anticipate this, she will not pay for the good in the first place and no trade takes place. This trust problem is usually addressed by a reputation mechanism that publishes buyer feedback about a seller’s past
Trust Mechanisms for Online Systems (Extended Abstract)
"... Almost every e-commerce site employs a so-called reputation mechanism that collects and publishes ratings from its users which then allow other market participants to make betterinformed choices. It is instructive to distinguish between two ..."
Abstract
- Add to MetaCart
Almost every e-commerce site employs a so-called reputation mechanism that collects and publishes ratings from its users which then allow other market participants to make betterinformed choices. It is instructive to distinguish between two
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Trust Mechanisms for Online Systems (Extended Abstract)
"... Almost every e-commerce site employs a so-called reputation mechanism that collects and publishes ratings from its users which then allow other market participants to make betterinformed choices. It is instructive to distinguish between two ..."
Abstract
- Add to MetaCart
Almost every e-commerce site employs a so-called reputation mechanism that collects and publishes ratings from its users which then allow other market participants to make betterinformed choices. It is instructive to distinguish between two
Reliable and Resilient Trust Management in Distributed Service Provision Networks
"... Abstract: Distributed service networks are popular platforms for service providers to offer services to consumers and for service consumers to acquire services from unknown parties. eBay and Amazon are two well-known examples of enabling and hosting such service networks to connect service providers ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: Distributed service networks are popular platforms for service providers to offer services to consumers and for service consumers to acquire services from unknown parties. eBay and Amazon are two well-known examples of enabling and hosting such service networks to connect service providers to service consumers. Trust management is a critical component for scaling such distributed service networks to a large and growing number of participants. In this paper, we present ServiceTrust++, a feedback quality sensitive and attack resilient trust management scheme for empowering distributed service networks with effective trust management capability. Comparing with existing trust models, ServiceTrust++ has several novel features. First, we present six attack models to capture both independent and colluding attacks with malicious cliques, malicious spies and malicious camouflages. Second, we aggregate the feedback ratings based on the variances of participants ’ feedback behaviors and incorporate feedback similarity as weight into the local trust algorithm. Third, we compute the global trust of a participant by employing conditional trust propagation based on feedback similarity threshold. This allows ServiceTrust++ to control and prevent malicious spies and malicious camouflage peers to boost their global trust scores by manipulating the feedback ratings of good peers and by taking advantage of the uniform trust propagation. Finally, we systematically combine trust decaying strategy with threshold-value based conditional trust propagation