On the Impact of Strategy and Utility Structures on Congestion-Averse Games

On the Impact of Strategy and Utility Structures on Congestion-Averse Games

Recent results regarding games with congestion-averse utilities (or, congestion-averse games---CAGs) have shown they possess some very desirable properties. Specifically, they have pure strategy Nash equilibria, which may be found by a polynomial time algorithm. However, these results were accompanied by a very limiting assumption that each player is capable of using any subset of its available set of resources. This is often unrealistic---for example, resources may have complementarities between them such that a minimal number of resources is required for any to be useful. To remove this restriction, in this paper we prove the existence and tractability of a pure strategy equilibrium for a much more general setting where each player is given a matroid over the set of resources, along with the (upper and lower) bounds on the size of a subset of resources to be selected, and its strategy space consists of all elements of this matroid that fit in the given size range. (This, in particular, includes the possibility of having a full matroid, or having a set of bases of a matroid.) Moreover, we show that if a player strategy space in a given CAG does not satisfy these matroid properties, then a pure strategy equilibrium need not exist, and in fact the determination of whether or not a game has a pure strategy Nash equilibrium is NP-complete. We further prove analogous results for each of the congestion-averse conditions on utility functions, thus showing that current assumptions on strategy and utility structures in this model cannot be relaxed anymore.

600-607

Voice, Thomas

a6e9ffeb-0bda-4bf4-9ce0-566ecd533aed

Polukarov, Maria

bd2f0623-9e8a-465f-8b29-851387a64740

Byde, Andrew

cdfddb83-7ad2-4274-a048-343b1c0783d8

Jennings, Nicholas R.

ab3d94cc-247c-4545-9d1e-65873d6cdb30

December 2009

Voice, Thomas

a6e9ffeb-0bda-4bf4-9ce0-566ecd533aed

Polukarov, Maria

bd2f0623-9e8a-465f-8b29-851387a64740

Byde, Andrew

cdfddb83-7ad2-4274-a048-343b1c0783d8

Jennings, Nicholas R.

ab3d94cc-247c-4545-9d1e-65873d6cdb30

Voice, Thomas, Polukarov, Maria, Byde, Andrew and Jennings, Nicholas R.
(2009)
On the Impact of Strategy and Utility Structures on Congestion-Averse Games.
*
Proc. 5th Int Workshop on Internet and Network Economics (WINE-09), Rome, Italy.
*
.

Record type:
Conference or Workshop Item
(Paper)

## Abstract

Recent results regarding games with congestion-averse utilities (or, congestion-averse games---CAGs) have shown they possess some very desirable properties. Specifically, they have pure strategy Nash equilibria, which may be found by a polynomial time algorithm. However, these results were accompanied by a very limiting assumption that each player is capable of using any subset of its available set of resources. This is often unrealistic---for example, resources may have complementarities between them such that a minimal number of resources is required for any to be useful. To remove this restriction, in this paper we prove the existence and tractability of a pure strategy equilibrium for a much more general setting where each player is given a matroid over the set of resources, along with the (upper and lower) bounds on the size of a subset of resources to be selected, and its strategy space consists of all elements of this matroid that fit in the given size range. (This, in particular, includes the possibility of having a full matroid, or having a set of bases of a matroid.) Moreover, we show that if a player strategy space in a given CAG does not satisfy these matroid properties, then a pure strategy equilibrium need not exist, and in fact the determination of whether or not a game has a pure strategy Nash equilibrium is NP-complete. We further prove analogous results for each of the congestion-averse conditions on utility functions, thus showing that current assumptions on strategy and utility structures in this model cannot be relaxed anymore.

Text

** MCAGsWINE2009final.pdf
- Accepted Manuscript**
## More information

Published date: December 2009

Venue - Dates:
Proc. 5th Int Workshop on Internet and Network Economics (WINE-09), Rome, Italy, 2009-12-01

Organisations:
Agents, Interactions & Complexity

## Identifiers

Local EPrints ID: 267875

URI: http://eprints.soton.ac.uk/id/eprint/267875

PURE UUID: 970126f2-18fb-4499-a5c5-890335f0895f

## Catalogue record

Date deposited: 16 Sep 2009 18:48

Last modified: 14 Mar 2024 09:01

## Export record

## Contributors

Author:
Thomas Voice

Author:
Maria Polukarov

Author:
Andrew Byde

Author:
Nicholas R. Jennings

## Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics