INCENTIVES IN SERVICE VALUE NETWORKS – ON TRUTHFULNESS, SUSTAINABILITY, AND INTEROPERABILITY

The concurrence of technical and behavioral trends – such as lightweight approaches for service composition and a rising demand for customized services – fosters the emergence of a novel organizational paradigm: Service Value Networks (SVN). Distributed and highly-specialized service providers contribute to an overall value proposition. SVNs provide means for the ad-hoc composition of services that satisfies individual customers\u27 needs. However, the distributed nature of these environments and the opportunistic behavior of participants require a purposeful design of incentives. Our contribution is threefold: We (i) provide an auction mechanism – the Complex Service Auction – to coordination value creation in SVNs which is incentive compatible in dominant strategies (truthful). To restore budget balance – the prerequisite for a mechanism\u27s sustainability – and to implement incentives that increase a network\u27s degree of interoperability, we (ii) present the Interoperability Transfer Function (ITF). Applying an agent-based simulation method, we (iii) numerically show that this payment scheme limits strategic behavior of service providers and strengthens interoperability endeavors compared to a benchmark transfer function

Auctions and bidding: A guide for computer scientists

There is a veritable menagerie of auctions-single-dimensional, multi-dimensional, single-sided, double-sided, first-price, second-price, English, Dutch, Japanese, sealed-bid-and these have been extensively discussed and analyzed in the economics literature. The main purpose of this article is to survey this literature from a computer science perspective, primarily from the viewpoint of computer scientists who are interested in learning about auction theory, and to provide pointers into the economics literature for those who want a deeper technical understanding. In addition, since auctions are an increasingly important topic in computer science, we also look at work on auctions from the computer science literature. Overall, our aim is to identifying what both these bodies of work these tell us about creating electronic auctions. © 2011 ACM.This work was funded in part by HP under the “Always on” grant, by NSF IIS-0329037 “Tools and Techniques for Automated Mechanism Design”, and by IEA (TIN2006-15662-C02-01), OK (IST-4-027253-STP), eREP(EC-FP6-CIT5-28575) and Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010).Peer Reviewe

Balanced Trade Reduction for Dual-Role Exchange Markets

Abstract We consider dual-role exchange markets, where traders can offer to both buy and sell the same commodity in the exchange but, if they transact, they can only be either a buyer or a seller, which is determined by the market mechanism. To design desirable mechanisms for such exchanges, we show that existing solutions may not be incentive compatible, and more importantly, cause the market maker to suffer a significant deficit. Hence, to combat this problem, following McAfee's trade reduction approach, we propose a new trade reduction mechanism, called balanced trade reduction, that is incentive compatible and also provides flexible trade-offs between efficiency and deficit