• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFIP 177; IFIP(International Federation for Information Processing) TC-11 International Workshop on Certification and Security in Inter-Organizational E-Services(CSES), World Computer Congress; 20040822-27; Toulouse(FR) >TRUTHFUL MECHANISMS FOR BUILDING TRUST IN E-COMMERCE
【24h】

TRUTHFUL MECHANISMS FOR BUILDING TRUST IN E-COMMERCE

机译：建立电子商务信任的真实机制

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A fundamental issue for a real uptake of commercial transactions over the web regards trust among the transacting entities, frequently unknown to each other. One solution to increase confidence in transactions is to use a network of TSPs (Trust Service Providers), called a trust web, which are third parties known and trusted by both entities, and an algorithm that establishes a trust path before carrying-out any c-commercc transaction. In this paper we study the problem of building trust paths linking an entity initiating a transaction to a set of final merchants in a trust web from a "mechanism design" point of view. Namely, we consider TSPs as strategic agents which respond to incentives and may deviate from the protocol for a tangible gain. A truthful mechanism should define both the protocol and a suitable payment rule such that each agent maximizes her own utility when not deviating from the protocol, regardless of what other agents do. We first address the problem from a "protocol design" perspective and, assuming that TSPs are honest/obedient, we propose a distributed search algorithm based on a probabilistic trust degree model [Mau96, DIM02] which generalizes that based only on boolean trust relationships proposed in [Ati02], and reduces the search space complexity by pruning the alternatives that do not satisfy (besides cost constraints) trust degree constraints (e.g., the "transitive" degree of trust accumulated along the path has to be greater than a given threshold value). Then, when considering TSPs as strategic agents, we use this algorithm as a substrate to define truthful mechanisms for building suitable trust paths. Indeed, the main scope of this paper is to provide an answer to the following fundamental problem: docs a payment function exist for the described problem such that the the resulting mechanism is truthful? By applying recent results appeared in [MPPW~+04] we provide both positive and negative answers, depending on which constraint we add/drop and on which parameters are considered as a private information of agents.
机译：真正通过Web进行商业交易的一个基本问题是交易实体之间的信任，彼此之间常常是未知的。一种提高交易信心的解决方案是使用称为信任网的TSP网络（信任服务提供商），这是两个实体都知道并信任的第三方，并且使用一种在执行任何交易之前建立信任路径的算法。 -commercc交易。在本文中，我们从“机制设计”的角度研究了建立信任路径的问题，该路径将发起交易的实体链接到信任网络中的一组最终商人。也就是说，我们将TSP视为对激励措施做出反应的战略主体，并且可能会偏离协议以获取有形的收益。真实的机制应该定义协议和合适的付款规则，以使每个代理在不偏离协议的情况下都能最大化自己的效用，无论其他代理做什么。我们首先从“协议设计”的角度解决问题，并假设TSP诚实/服从，我们提出了一种基于概率信任度模型[Mau96，DIM02]的分布式搜索算法，该算法概括了仅基于提出的布尔信任关系并通过修剪不满足（除了成本约束）信任度约束（例如，沿路径累积的“传递”信任度必须大于给定阈值）的备选方案来减少搜索空间的复杂性）。然后，在将TSP视为战略代理时，我们以该算法为基础来定义用于建立适当信任路径的真实机制。确实，本文的主要范围是为以下基本问题提供答案：文档是否存在所描述问题的付款功能，以使所产生的机制真实？通过应用[MPPW〜+ 04]中出现的最新结果，我们可以提供肯定的答案也可以是否定的答案，具体取决于我们添加/删除的约束以及将哪些参数视为代理的私人信息。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号