The University of Southampton
University of Southampton Institutional Repository

Taxed Congestion Games with Failures

Record type: Article

In this paper, we introduce and study Taxed Congestion Games with Failures [TCGFs], extending congestion games with failures [CGFs] to consider costly task submission. We define TCGFs, and prove that TCGFs possess a pure strategy equilibrium. Moreover, we provide an efficient algorithm for the computation of such equilibrium. We also provide a specialized, simpler, algorithm for the case in which all resources are identical.

PDF TCGF_revised_6Dec2008.pdf - Accepted Manuscript
Download (225kB)

Citation

Penn, Michal, Polukarov, Maria and Tennenholtz, Moshe (2009) Taxed Congestion Games with Failures Annals of Mathematics and Artificial Intelligence, (10.1)

More information

Published date: 2009
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 267885
URI: http://eprints.soton.ac.uk/id/eprint/267885
PURE UUID: db80fc2b-6f09-4cb2-b296-a6ed13bfbf17

Catalogue record

Date deposited: 16 Sep 2009 20:30
Last modified: 18 Jul 2017 06:58

Export record

Contributors

Author: Michal Penn
Author: Maria Polukarov
Author: Moshe Tennenholtz

University divisions


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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×