A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
In this paper, we investigate a multi-agent non-cooperative game for resource allocations based on an M/D/1 queuing model. Specifically, agents with common goals to maximize individual utility are deployed to compete with each other to bid or bribe for quicker service provided by the server. Agents choose from one of three available strategies: random strategy, Nash equilibrium strategy and linear regression strategy, for their decision-makings. After each agent obtained service, itdoi:10.1145/544741.544782 dblp:conf/atal/WinotoT02 fatcat:js2eihxnrfaibeceucunoiecfi