Utilitarian resource assignment
The paper deals with the optimal resource allocation. Ther is a finite number of tasks and finite number of resources. To every task there should be assigned a resource. The authors investigate this problem from a game-theoretic point of view. Tasks are considered as agents, choice of a resource as a strategy. Instead of payoffs there are costs of assignments. The individual cost due to a task (agent) depends on the type of the resource, the size of a task and the sizes of all other tasks assigned to the same resource. The authors study the Nash equilibria for the individual costs. Their main goal is to estimate the ratio of the global cost (i.e. the sum of all individual costs) of such a Nash equilibrium and the minimal global cost.
- How bad is selfish routing?
- scientific article; zbMATH DE number 2038735 (Why is no real title available?)
- scientific article; zbMATH DE number 2086616 (Why is no real title available?)
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- Selfish traffic allocation for server farms
- STACS 2004
- The price of selfish routing
- Theoretical Computer Science
- Worst-case equilibria
- Efficiency analysis with respect to the unit cost objectives in scheduling games
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- Dynamic resource allocation games
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Efficiency analysis of load balancing games with and without activation costs
- Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning
- Selfish routing with incomplete information
- Dynamic resource allocation games
- Resource allocation games with multiple resource classes
- A game-theoretic model for repeated assignment problem between two selfish agents
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Distributed welfare games
- Complexity and approximability of optimal resource allocation and Nash equilibrium over networks
- Game-theoretical approach for task allocation problems with constraints
- Entrepreneurship facility-activation games
- Inefficiency of equilibria for scheduling game with machine activation costs
This page was built for publication: Utilitarian resource assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866544)