Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung
We consider the behaviour of a set of services in a stressed web environment where performance patterns may be difficult to predict. In stressed environments the performances of some providers may degrade while the performances of others, with elastic resources, may improve. The allocation of web-based providers to users (brokering) is modelled by a strategic non-cooperative angel-daemon game with risk profiles. A risk profile specifies a bound on the number of unreliable service providers within an environment without identifying the names of these providers. Risk profiles offer a means of analysing the behaviour of broker agents which allocate service providers to users. A Nash equilibrium is a fixed point of such a game in which no user can locally improve their choice of provider – thus, a Nash equilibrium is a viable solution to the provider/user allocation problem. Angel daemon games provide a means of reasoning about stressed environments and offer the possibility of designing brokers using risk profiles and Nash equilibria.
KeywordsNash Equilibrium Social Cost Allocation Problem Resource Allocation Problem Delay Function
Unable to display preview. Download preview PDF.
- 1.Babaioff, M., Kleinberg, K., Papadimitriou, C.: Congestion games with malicious players. In: ACM Conference on Electronic Commerce, pp. 103–112 (2007)Google Scholar
- 2.Baraglia, R., Laforenza, D., Ferrini, R., Adami, D., Giordano, S., Yahyapour, R.: A study on network resources management in grids. In: CoreGRID-IW, pp. 213–224 (2006)Google Scholar
- 3.Gabarro, J., García, A., Clint, M., Stewart, A., Kilpatrick, P.: Bounded Site Failures: an Approach to Unreliable Grid Environments. In: Danelutto, M., Fragopoulou, P., Getov, V. (eds.) Making Grid Works, pp. 175–187. Springer, Heidelberg (2007)Google Scholar
- 7.Oxford Dictionaries, http://www.askoxford.com/?view=uk
- 8.Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory, Cambridge (2007)Google Scholar
- 9.Penn, M., Maria Polukarov, M., Tennenholtz, M.: Congestion games with failures. In: ACM Conference on Electronic Commerce, pp. 259–268 (2005)Google Scholar
- 10.Penn, M., Maria Polukarov, M., Tennenholtz, M.: Congestion games with load-dependent failures: identical resources. In: ACM Conference on Electronic Commerce, pp. 210–217 (2007)Google Scholar