---
_id: '669'
abstract:
- lang: eng
  text: We study a new class of games which generalizes congestion games andits bottleneck
    variant. We introduce congestion games with mixed objectives to modelnetwork scenarios
    in which players seek to optimize for latency and bandwidths alike.We characterize
    the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement
    dynamics, the quality of equilibria and show the complexity of thedecision problem.
    For games that do not possess PNE we give bounds on the approx-imation ratio of
    approximate pure Nash equilibria.
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Lennart
  full_name: Leder, Lennart
  last_name: Leder
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal
    of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href="https://doi.org/10.1007/s10878-017-0189-y">10.1007/s10878-017-0189-y</a>
  apa: Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed
    objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167.
    <a href="https://doi.org/10.1007/s10878-017-0189-y">https://doi.org/10.1007/s10878-017-0189-y</a>
  bibtex: '@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed
    objectives}, volume={36}, DOI={<a href="https://doi.org/10.1007/s10878-017-0189-y">10.1007/s10878-017-0189-y</a>},
    number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer
    Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
    year={2018}, pages={1145–1167} }'
  chicago: 'Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
    Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36,
    no. 4 (2018): 1145–67. <a href="https://doi.org/10.1007/s10878-017-0189-y">https://doi.org/10.1007/s10878-017-0189-y</a>.'
  ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,”
    <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.
  mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal
    of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp.
    1145–67, doi:<a href="https://doi.org/10.1007/s10878-017-0189-y">10.1007/s10878-017-0189-y</a>.
  short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization
    36 (2018) 1145–1167.
date_created: 2017-10-26T14:11:04Z
date_updated: 2022-01-06T07:03:15Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-017-0189-y
external_id:
  arxiv:
  - '1607.05143'
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:57:32Z
  date_updated: 2018-10-31T16:57:32Z
  file_id: '5226'
  file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf
  file_size: 605207
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T16:57:32Z
has_accepted_license: '1'
intvolume: '        36'
issue: '4'
language:
- iso: eng
page: 1145-1167
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Journal of Combinatorial Optimization
publication_identifier:
  issn:
  - 1382-6905
  - 1573-2886
publication_status: published
publisher: Springer Nature
status: public
title: Congestion games with mixed objectives
type: journal_article
user_id: '14052'
volume: 36
year: '2018'
...
---
_id: '1369'
abstract:
- lang: eng
  text: In budget games, players compete over resources with finite budgets. For every
    resource, a player has a specific demand and as a strategy, he chooses a subset
    of resources. If the total demand on a resource does not exceed its budget, the
    utility of each player who chose that resource equals his demand. Otherwise, the
    budget is shared proportionally. In the general case, pure Nash equilibria (NE)
    do not exist for such games. In this paper, we consider the natural classes of
    singleton and matroid budget games with additional constraints and show that for
    each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
    function to prove that every matroid budget game has an approximate pure NE which
    depends on the largest ratio between the different demands of each individual
    player.
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted
    budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash
    equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>.
    <a href="https://doi.org/10.1007/s10878-018-0269-7">https://doi.org/10.1007/s10878-018-0269-7</a>
  bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria
    in restricted budget games}, DOI={<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>},
    journal={Journal of Combinatorial Optimization}, publisher={Springer Nature},
    author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik,
    Alexander}, year={2018} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial
    Optimization</i>, 2018. <a href="https://doi.org/10.1007/s10878-018-0269-7">https://doi.org/10.1007/s10878-018-0269-7</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria
    in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.
  mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
    <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>.
  short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial
    Optimization (2018).
date_created: 2018-03-18T11:12:49Z
date_updated: 2022-01-06T06:51:42Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-018-0269-7
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:56:13Z
  date_updated: 2018-10-31T16:56:13Z
  file_id: '5225'
  file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf
  file_size: 561187
  relation: main_file
file_date_updated: 2018-10-31T16:56:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: Journal of Combinatorial Optimization
publication_identifier:
  issn:
  - 1382-6905
  - 1573-2886
publication_status: epub_ahead
publisher: Springer Nature
status: public
title: Pure Nash equilibria in restricted budget games
type: journal_article
user_id: '14052'
year: '2018'
...