Karpowicz, M; Malinowski, K
We study the problem of allocating a single divisible resource to strategic agents in communication networks. For the setting of inelastic supply we formulate conditions for the efficiency of Nash equilibria in a resulting resource allocation game. Then we answer the question how to design a mechanism which yields efficient allocations and analyze revenues generated by the proposed class of mechanisms. Finally, we propose a distributed resource allocation algorithm and prove its convergence.
Słowa kluczowe: control,
Strona www: http://dx.doi.org/10.1007/978-3-540-69507-3_54