电子商务评论最新文献

筛选
英文 中文
The Core and Shapley Value Analysis for Cooperative Formation of Procurement Networks 采购网络合作形成的核心与Shapley价值分析
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.95
T. S. Chandrashekar, Y. Narahari
{"title":"The Core and Shapley Value Analysis for Cooperative Formation of Procurement Networks","authors":"T. S. Chandrashekar, Y. Narahari","doi":"10.1109/CEC-EEE.2007.95","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.95","url":null,"abstract":"Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. We model the problem of procurement network formation (PNF)for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner. We first investigate the stability of such networks by examining the conditions under which the core of the game is nonempty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82350251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Bayesian Incentive Compatible Mechanism for Decentralized Supply Chain Formation 分散供应链形成的贝叶斯激励相容机制
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.109
Y. Narahari, N. K. Srivastava
{"title":"A Bayesian Incentive Compatible Mechanism for Decentralized Supply Chain Formation","authors":"Y. Narahari, N. K. Srivastava","doi":"10.1109/CEC-EEE.2007.109","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.109","url":null,"abstract":"In this paper, we consider a decentralized supply chain formation problem for linear, multi-echelon supply chains when the managers of the individual echelons are autonomous, rational, and intelligent. At each echelon, there is a choice of service providers and the specific problem we solve is that of determining a cost-optimal mix of service providers so as to achieve a desired level of end-to-end delivery performance. The problem can be broken up into two sub-problems following a mechanism design approach: (1) Design of an incentive compatible mechanism to elicit the true cost functions from the echelon managers; (2) Formulation and solution of an appropriate optimization problem using the true cost information. In this paper, we propose a novel Bayesian incentive compatible mechanism for eliciting the true cost functions. This improves upon existing solutions in the literature which are all based on the classical Vickrey-Clarke-Groves mechanisms, requiring significant incentives to be paid to the echelon managers for achieving dominant strategy incentive compatibility. The proposed solution, which we call SCF-BIC (supply chain formation with Bayesian incentive compatibility), significantly reduces the cost of supply chain formation. We illustrate the efficacy of the proposed methodology using the example of a three echelon manufacturing supply chain.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89415678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Secure e-Cheque Clearance between Financial Institutions 确保金融机构之间的电子支票结算安全
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.85
N. Sunitha, B. B. Amberker, P. Koulgi, P. Siddharth
{"title":"Secure e-Cheque Clearance between Financial Institutions","authors":"N. Sunitha, B. B. Amberker, P. Koulgi, P. Siddharth","doi":"10.1109/CEC-EEE.2007.85","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.85","url":null,"abstract":"There are many situations where there is lack of trust between transacting financial institutions (FIs include banks). In such situations confidential or financial information cannot be revealed. For such an untrusted environment a zero knowledge protocol is devised to perform secure inter FI e-cheque clearance operations. Also, there is no trusted centralised authority controlling the operations. The e-cheque system is designed with message integrity, authentication and non-repudiation features, strong enough to prevent fraud against the FIs and their customers. To verify digital signatures one needs to have the public key of the signer. However FI's cannot store public keys of all possible payer's of e-cheques and their corresponding servicing FIs. Therefore a method is formulated in which one can verify that two signatures received from a signer indeed belong to the same signer without the help of public key of the signer.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CEC-EEE.2007.85","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72449812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Decentralized Online Resource Allocation for DynamicWeb Service Applications 动态web服务应用程序的分散在线资源分配
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.37
Jochen Stößer, Christine Roessle, Dirk Neumann
{"title":"Decentralized Online Resource Allocation for DynamicWeb Service Applications","authors":"Jochen Stößer, Christine Roessle, Dirk Neumann","doi":"10.1109/CEC-EEE.2007.37","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.37","url":null,"abstract":"Economic scheduling mechanisms introduce economic principles to grids and thus promise to increase the systems' overall utility by explicitly taking into account strategic, inter-organizational settings. Current economic scheduling mechanisms, however, do not fully satisfy the requirements of interactive grid applications. In this paper, we present a mechanism from the general machine scheduling domain. However, the mechanism suffers from some limitations due to the distinct properties of grids. We point to these limitations and propose extensions to the basic mechanism which may alleviate these drawbacks.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72579307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
The Design of Incentives in a Combinatorial Exchange for Intra-Enterprise Logistics Services 企业内部物流服务组合交换的激励设计
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.96
Oleg Gujo, M. Schwind, J. Vykoukal
{"title":"The Design of Incentives in a Combinatorial Exchange for Intra-Enterprise Logistics Services","authors":"Oleg Gujo, M. Schwind, J. Vykoukal","doi":"10.1109/CEC-EEE.2007.96","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.96","url":null,"abstract":"The exchange of transportation capacities is an approach that is well established in the practice of logistics. Few of these mostly web-based market places, however, are able to take into consideration the synergies that can be generated by the appropriate combination of the transportation lanes of different carriers. One method of achieving this is to employ combinatorial auctions, which allow bidding on bundles of lanes. This article deals with a combinatorial auction for the intra- enterprise exchange of logistics services. In the real world case considered here, we implement and analyze such an exchange process in an enterprise that is related to the food sector and organized in a profit center structure. In the intra-enterprise exchange process, each profit center is able to release delivery contracts for outsourcing if the geographic location of a customer allows reduced-cost delivery by another profit center in the neighborhood. However, the success of such an exchange system depends on the incentive for the profit centers to release delivery contracts into the outsourcing process. This incentive is given by a distribution mechanism that enables the profit centers to share the cost savings achieved for the entire enterprise. The proposed mechanism is able to change the balance between the reward for the in or outsourcing of delivery contracts or to award either a higher share of the total cost savings to a profit center for in or outsourcing respectively.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79970671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids 具有批量折扣投标的多单位采购的最优拍卖
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.76
R. K. Gautam, N. Hemachandra, Y. Narahari, Hastagiri Prakash, Devadatta M. Kulkarni, J. Tew
{"title":"Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids","authors":"R. K. Gautam, N. Hemachandra, Y. Narahari, Hastagiri Prakash, Devadatta M. Kulkarni, J. Tew","doi":"10.1109/CEC-EEE.2007.76","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.76","url":null,"abstract":"Our attention is focused on designing an optimal procurement mechanism which a buyer can use for procuring multiple units of a homogeneous item based on bids submitted by autonomous, rational, and intelligent suppliers. We design elegant optimal procurement mechanisms for two different situations. In the first situation, each supplier specifies the maximum quantity that can be supplied together with a per unit price. For this situation, we design an optimal mechanism S-OPT (Optimal with Simple bids). In the more generalized case, each supplier specifies discounts based on the volume of supply. In this case, we design an optimal mechanism VD-OPT (Optimal with Volume Discount bids). The VD-OPT mechanism uses the S-OPT mechanism as a building block. The proposed mechanisms minimize the cost to the buyer, satisfying at the same time, (a) Bayesian incentive compatibility and (b) interim individual rationality.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74228763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Deployment of Accountability Monitoring Agents in Service-Oriented Architectures 面向服务体系结构中责任监视代理的部署
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.39
Yue Zhang, M. Panahi, Kwei-Jay Lin
{"title":"Deployment of Accountability Monitoring Agents in Service-Oriented Architectures","authors":"Yue Zhang, M. Panahi, Kwei-Jay Lin","doi":"10.1109/CEC-EEE.2007.39","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.39","url":null,"abstract":"Service-oriented architecture (SOA) provides a flexible paradigm to compose dynamic service processes using individual services. However, service processes can be vastly complex, involving many service partners, thereby giving rise to difficulties in terms of pinpointing the service(s) responsible for problematic outcomes. In this research, we study efficient and effective mechanisms to deploy agents to monitor and detect undesirable services in a service process. We model the agent deployment problem as the classic weighted set covering (WSC) problem and present agent selection solutions at different stages of service process deployment. We propose the MASS (merit based agent and service selection) algorithm that considers agent cost during QoS-based service composition by using a meritagent_cost heuristic metric. We also propose the IGA (incremental greedy algorithm) to achieve fast agent selection when a service process is reconfigured after service failures. The performance study shows that our proposed algorithms are effective on saving agent cost and efficient on execution time.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CEC-EEE.2007.39","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72528349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
IT Service Provider's Multi-Customer and Multi-Tenant Environments IT服务提供商的多客户和多租户环境
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.58
L. Shwartz, Naga Ayachitula, Melissa J. Buco, G. Grabarnik, M. Surendra, Christopher Ward, S. Weinberger
{"title":"IT Service Provider's Multi-Customer and Multi-Tenant Environments","authors":"L. Shwartz, Naga Ayachitula, Melissa J. Buco, G. Grabarnik, M. Surendra, Christopher Ward, S. Weinberger","doi":"10.1109/CEC-EEE.2007.58","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.58","url":null,"abstract":"The IT Infrastructure Library (ITIL) provides guidance for IT service management but does not specifically address the challenges that Service Providers face. A Service Provider is an enterprise whose business is to manage the IT business of other enterprises. To manage its cost the Service Provider must host multiple diverse customers in a shared environment. The customers have unique business requirements, such as customizations of the processes based on customer policies and role, which the Service Provider must address while supporting the services in such a way that they provide functionality that appropriately spans organizational units, satisfying the customers' goals to be ITIL compliant and meeting the economic pressures of constantly reducing cost. The paper considers the impact that hosting multiple customers in a shared environment has on data segregation, process definition, and security, explores different models of Service Provider operations and outlines future work needed in this area.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80585753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Semantic SOA to Promote Integration of Heterogeneous B2B Services 语义SOA促进异构B2B服务的集成
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.112
T. Vitvar, Matthew Moran, Maciej Zaremba, A. Haller, P. Kotinurmi
{"title":"Semantic SOA to Promote Integration of Heterogeneous B2B Services","authors":"T. Vitvar, Matthew Moran, Maciej Zaremba, A. Haller, P. Kotinurmi","doi":"10.1109/CEC-EEE.2007.112","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.112","url":null,"abstract":"Modeling the semantics of business services and their corresponding messages using ontologies enables flexible integration that is more adaptive to business-driven change. In this paper we demonstrate our approach building upon an established semantic Web service framework (WSMX) to facilitate a conversation between heterogeneous services that support both the RosettaNet standard and proprietary information models.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87989137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Semantic Web-Service Discovery and Composition Using Flexible Parameter Matching 使用灵活参数匹配的语义web服务发现和组合
电子商务评论 Pub Date : 2007-07-23 DOI: 10.1109/CEC-EEE.2007.86
Seog-Chan Oh, John Jung-Woon Yoo, Hyunyoung Kil, Dongwon Lee, S. Kumara
{"title":"Semantic Web-Service Discovery and Composition Using Flexible Parameter Matching","authors":"Seog-Chan Oh, John Jung-Woon Yoo, Hyunyoung Kil, Dongwon Lee, S. Kumara","doi":"10.1109/CEC-EEE.2007.86","DOIUrl":"https://doi.org/10.1109/CEC-EEE.2007.86","url":null,"abstract":"When there are a large number of web services available and no single service satisfies the given request, one has to compose multiple web services to fulfill the goal, considering syntactic and semantic aspects. To address the web service composition issue, in this paper, we present a new composition algorithm by extending our previous work, WSRP (web-service planner) so as to determine relations between different parameter types during the process of service composition.","PeriodicalId":58336,"journal":{"name":"电子商务评论","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82568871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信