An efficient algorithm for strategy-proof service composition

Proceedings - IEEE 10th International Conference on Services Computing, SCC 2013

Volumn , Issue , 2013, Pages 105-112

  Tanaka, Masahiro ^a   Murakami, Yohei ^a  

^a NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

Author keywords

dynamic programming; service selection; VCG mechanism

Indexed keywords

APPROXIMATE SOLUTION; COMPUTATIONAL COSTS; DOMINANT STRATEGY; FIRST PRICE AUCTION; QUASI-POLYNOMIAL TIME; SERVICE COMPOSITIONS; SERVICE SELECTION; VCG MECHANISM;

APPROXIMATION ALGORITHMS; COSTS; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE;

ITERATIVE METHODS;

EID: 84891952629     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCC.2013.100     Document Type: Conference Paper

References (18)

1. W. Vickrey, "Counterspeculation, Auction, and Competitive Sealed Tenders," The Journal of Finance, vol. 16, no. 1, pp. 8-37, 1961.
2. E. H. Clarke, "Multipart Pricing of Public Goods," Public Choice, vol. 11, no. 1, pp. 17-33, 1971.
3. Theodore Groves, "Incentives in Teams," Econometrica, vol. 41, no. 4, pp. 617-631, 1973.
4. M. Mihailescu and Y. Teo, "Strategy-Proof Dynamic Resource Pricing of Multiple Resource Types on Federated Clouds," in Algorithms and Architectures for Parallel Processing, 2010, pp. 337-350.
5. L. Zeng, B. Benatallah, A. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, "QoS-aware middleware for web services composition," IEEE Transactions on Software Engineering, vol. 30, pp. 311-327, 2004.
6. A. B. Hassine, S. Matsubara, and T. Ishida, "A constraint-based approach to horizontal web service composition," in the 5th International Semantic Web Conference (ISWC 2006), vol. 4273, 2006, pp. 130-143.
7. G. Canfora, M. Di Penta, R. Esposito, and M. L. Villani, "An Approach for QoS-aware Service Composition based on Genetic Algorithms," Genetic and evolutionary computation (GECCO '05), p. 1069, 2005.
8. T. Ishida, The Language Grid: Service-Oriented Collective Intelligence for Language Resource Interoperability. Springer, 2011.
9. E. Zurel and N. Nisan, "An efficient approximate allocation algorithm for combinatorial auctions," the 3rd ACM conference on Electronic Commerce (EC '01), pp. 125-136, 2001.
10. D. Lehmann, L. I. Oćallaghan, and Y. Shoham, "Truth Revelation in Aapproximately Efficient Combinatorial Auctions," Journal of the ACM, vol. 49, no. 5, pp. 577-602, 2002.
11. N. E. Kfir-Dahav, "Mechanism Design for Resource Bounded Agents," the 4th International Conference on MultiAgent Systems, pp. 309-315, 2000.
12. P. Upadhyaya, M. Balazinska, and D. Suciu, "How to Price Shared Optimizations in the Cloud," the VLDB Endowment, vol. 5, no. 6, pp. 562-573, 2012.
13. D. Dash, V. Kantere, and A. Ailamaki, "An Economic Model for Self-Tuned Cloud Caching," in 2009 IEEE 25th International Conference on Data Engineering, 2009, pp. 1687- 1693.
14. G. Loomes and R. Sugden, "Regret Theory: An Alternative Theory of Rational Choice under Uncertainty," Economic Journal, vol. 92, no. 4, pp. 805-824, 1982.
15. L. S. Shapley, "A Value for n-person Games," in Contributions to the Theory of Games, H. Kuhn and A. Tucker, Eds. Princeton University Press, 1953, pp. 307-317.
16. S. Matsubara, "Profit Sharing in Service Composition," in the 9th international conference on Service-Oriented Computing (ICSOC 2011), 2011, pp. 645-652.
17. H. Wang, Q. Jing, R. Chen, B. He, Z. Qian, and L. Zhou, "Distributed systems meet economics: pricing in the cloud," in the 2nd USENIX conference on Hot topics in cloud computing (HotCloud'10), 2010, pp. 6-12.
18. A. Li, X. Yang, S. Kandula, and M. Zhang, "CloudCmp: shopping for a cloud made easy," in the 2nd USENIX conference on Hot topics in cloud computing (HotCloud'10), 2010, p. 5.