A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior
Proceedings of the 2nd ACM conference on Electronic commerce
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Choosing reputable servents in a P2P network
Proceedings of the 11th international conference on World Wide Web
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Bayesian Network-Based Trust Model
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
WWW '05 Proceedings of the 14th international conference on World Wide Web
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Trusted intermediating agents in electronic trade networks
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
SoRec: social recommendation using probabilistic matrix factorization
Proceedings of the 17th ACM conference on Information and knowledge management
An Analytic Approach to Reputation Ranking of Participants in Online Transactions
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
TrustWalker: a random walk model for combining trust-based and item-based recommendation
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Design of a mechanism for promoting honesty in E-marketplaces
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Relating Reputation and Money in On-line Markets
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
| Hi-index | 0.00 |
Reputation in online economic systems is typically quantified using counters that specify positive and negative feedback from past transactions and/or some form of transaction network analysis that aims to quantify the likelihood that a network user will commit a fraudulent transaction. These approaches can be deceiving to honest users from numerous perspectives. We take a radically different approach with the goal of guaranteeing to a buyer that a fraudulent seller cannot disappear from the system with profit following a set of fabricated transactions that total a certain monetary limit. Even in the case of stolen identity, such an adversary cannot produce illegal profit unless a buyer decides to pay over the suggested limit.