Abstract
We present in this paper a distributed game theoretical model for tasks allocation. During the game, each agent submits a cost for achieving a specific task. Each agent, that is offering a specific task, computes the so-called reputation-based cost, which is the product between the submitted cost and the inverse of the reputation value of the bidding agent. The game winner is the agent which has the minimal reputation-based cost. We show how the use of reputation allows a better allocation of tasks with respect to a conventional allocation where there is no consideration of the reputation as a criteria for allocating tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archer, A., Tardos, E.: Truthful Mechanisms for One-Parameter Agents. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), Washington, USA, pp. 482–491 (2001)
Carroll, T., Grosu, D.: Selfish Multi-User Task Scheduling. In: Proceedings of The Fifth International Symposium on Parallel and Distributed Computing, pp. 99–106 (2006)
Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., Padget, J., Phelps, S., RodrÃguez-Aguilar, J.A., Sousa, P.: Issues in Multiagent Resource Allocation. Informatica 30(1), 3–31 (2006)
Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: Automata, Languages and Programming: 31st International Colloquium, Turku, Finland, pp. 345–357 (July 2004)
Conitzer, V., Sandholm, T.: Complexity of Mechanism Design. In: Proceedings of the Uncertainty in Artificial Intelligence Conference (UAI), Edmonton, Canada, pp. 103–110 (2002)
Conitzer, V., Sandholm, T.: Automated Mechanism Design for a Self-interested Designer. In: Proceedings of the 5th ACM conference on Electronic Commerce, New York, USA, pp. 132–141 (2004)
Dash, R., Ramchurn, S., Jennings, N.: Trust-Based Mechanism Design. In: Third International Joint Conference on Autonomous Agents and Multiagent Systems, New York, USA, pp. 748–755 (2004)
Feigenbaum, J., Papadimitriou, C., Sami, R., Shenkar, S.: A BGP-based Mechanism for Lowest-Cost Routing. Distributed Computing 18(1), 61–72 (2005)
Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the Cost of Multicast Transmissions. JCSS: Journal of Computer and System Sciences 63(1), 21–41 (2001)
Feigenbaum, J., Shenker, S.: Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. Bulletin of the European Association for Theoretical Computer Science 79, 101–121 (2003)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Mas-Colell, A., Whinston, M., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)
Maximilien, E., Singh, M.: Reputation and Endorsement for Web Services. SIGecom Exchanges 3(1), 24–31 (2002)
Nisan, N.: Algorithms for Selfish Agents. In: Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, pp. 1–15 (1999)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proceedings of ACM Symposium on Theory of Computing, Atlanta, USA, pp. 129–140 (1999)
Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. Journal of Artificial Intelligence Research (JAIR) 29, 19–47 (2007)
Osborne, M.J., Rubenstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Parkes, D.C.: Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (2001)
Sandholm, T.: Automated Mechanism Design: A New Application Area for Search Algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 19–36. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yahyaoui, H. (2009). A Reputation-Based Game for Tasks Allocation. In: Filipe, J., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2009. Lecture Notes in Business Information Processing, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01347-8_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-01347-8_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01346-1
Online ISBN: 978-3-642-01347-8
eBook Packages: Computer ScienceComputer Science (R0)