---
_id: '8080'
abstract:
- lang: eng
  text: This thesis investigates approximate pure Nash equilibria in different game-theoretic
    models. In such an outcome, no player can improve her objective by more than a
    given factor through a deviation to another strategy. In the first part, we investigate
    two variants of Congestion Games in which the existence of pure Nash equilibria
    is guaranteed through a potential function argument. However, the computation
    of such equilibria might be hard. We construct and analyze approximation algorithms
    that enable the computation of states with low approximation factors in polynomial
    time. To show their guarantees we use sub games among players, bound the potential
    function values of arbitrary states and exploit a connection between Shapley and
    proportional cost shares. Furthermore, we apply and analyze sampling techniques
    for the computation of approximate Shapley values in different settings. In the
    second part, we concentrate on the existence of approximate pure Nash equilibria
    in games in which no pure Nash equilibria exist in general. In the model of Coevolving
    Opinion Formation Games, we bound the approximation guarantees for natural states
    nearly independent of the specific definition of the players' neighborhoods by
    applying a concept of virtual costs. For the special case of only one influential
    neighbor, we even show lower approximation factors for a natural strategy. Then,
    we investigate a two-sided Facility Location Game among facilities and clients
    on a line with an objective function consisting of distance and load. We show
    tight bounds on the approximation factor for settings with three facilities and
    infinitely many clients. For the general scenario with an arbitrary number of
    facilities, we bound the approximation factor for two promising candidates, namely
    facilities that are uniformly distributed and which are paired.
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
citation:
  ama: Feldotto M. <i>Approximate Pure Nash Equilibria in Congestion, Opinion Formation
    and Facility Location Games</i>. Universität Paderborn; 2019. doi:<a href="https://doi.org/10.17619/UNIPB/1-588">10.17619/UNIPB/1-588</a>
  apa: Feldotto, M. (2019). <i>Approximate Pure Nash Equilibria in Congestion, Opinion
    Formation and Facility Location Games</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-588">https://doi.org/10.17619/UNIPB/1-588</a>
  bibtex: '@book{Feldotto_2019, place={Universität Paderborn}, title={Approximate
    Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-588">10.17619/UNIPB/1-588</a>},
    author={Feldotto, Matthias}, year={2019} }'
  chicago: Feldotto, Matthias. <i>Approximate Pure Nash Equilibria in Congestion,
    Opinion Formation and Facility Location Games</i>. Universität Paderborn, 2019.
    <a href="https://doi.org/10.17619/UNIPB/1-588">https://doi.org/10.17619/UNIPB/1-588</a>.
  ieee: M. Feldotto, <i>Approximate Pure Nash Equilibria in Congestion, Opinion Formation
    and Facility Location Games</i>. Universität Paderborn, 2019.
  mla: Feldotto, Matthias. <i>Approximate Pure Nash Equilibria in Congestion, Opinion
    Formation and Facility Location Games</i>. 2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-588">10.17619/UNIPB/1-588</a>.
  short: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation
    and Facility Location Games, Universität Paderborn, 2019.
date_created: 2019-02-25T13:03:02Z
date_updated: 2022-01-06T07:03:50Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.17619/UNIPB/1-588
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-03-28T13:40:51Z
  date_updated: 2019-03-28T13:40:51Z
  file_id: '8715'
  file_name: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and
    Facility Location Games.pdf
  file_size: 3116177
  relation: main_file
  success: 1
file_date_updated: 2019-03-28T13:40:51Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility
  Location Games
type: dissertation
user_id: '15415'
year: '2019'
...
---
_id: '3851'
author:
- first_name: Samuel
  full_name: Koop, Samuel
  last_name: Koop
citation:
  ama: Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn;
    2018.
  apa: Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn.
  bibtex: '@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität
    Paderborn}, author={Koop, Samuel}, year={2018} }'
  chicago: Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn, 2018.
  ieee: S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn,
    2018.
  mla: Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn, 2018.
  short: S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn,
    2018.
date_created: 2018-08-08T11:56:37Z
date_updated: 2022-01-06T06:59:45Z
department:
- _id: '541'
- _id: '63'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Congestion Games mit gewichteten Strategien
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1186'
author:
- first_name: Arne
  full_name: Kemper, Arne
  last_name: Kemper
citation:
  ama: Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn; 2018.
  apa: Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn.
  bibtex: '@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games
    via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne},
    year={2018} }'
  chicago: Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  ieee: A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  mla: Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  short: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions, Universität Paderborn, 2018.
date_created: 2018-03-02T13:47:57Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Pure Nash Equilibria in Robust Congestion Games via Potential Functions
type: mastersthesis
user_id: '14052'
year: '2018'
...
---
_id: '1187'
author:
- first_name: Marcel
  full_name: Nachtigall, Marcel
  last_name: Nachtigall
citation:
  ama: Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model</i>. Universität Paderborn; 2018.
  apa: Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition
    Game Model</i>. Universität Paderborn.
  bibtex: '@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player
    Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall,
    Marcel}, year={2018} }'
  chicago: Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player
    Composition Game Model</i>. Universität Paderborn, 2018.
  ieee: M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition
    Game Model</i>. Universität Paderborn, 2018.
  mla: Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model</i>. Universität Paderborn, 2018.
  short: M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model, Universität Paderborn, 2018.
date_created: 2018-03-02T13:49:39Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Scenario-driven Strategy Analysis in a n-player Composition Game Model
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1188'
author:
- first_name: Jérôme
  full_name: Kempf, Jérôme
  last_name: Kempf
citation:
  ama: Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn; 2018.
  apa: Kempf, J. (2018). <i>Learning deterministic bandit behaviour form compositions</i>.
    Universität Paderborn.
  bibtex: '@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions},
    publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }'
  chicago: Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn, 2018.
  ieee: J. Kempf, <i>Learning deterministic bandit behaviour form compositions</i>.
    Universität Paderborn, 2018.
  mla: Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn, 2018.
  short: J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität
    Paderborn, 2018.
date_created: 2018-03-02T13:51:14Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Learning deterministic bandit behaviour form compositions
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1073'
author:
- first_name: Simon
  full_name: Nachtigall, Simon
  last_name: Nachtigall
citation:
  ama: Nachtigall S. <i>Sortieren dynamischer Daten</i>. Universität Paderborn; 2017.
  apa: Nachtigall, S. (2017). <i>Sortieren dynamischer Daten</i>. Universität Paderborn.
  bibtex: '@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität
    Paderborn}, author={Nachtigall, Simon}, year={2017} }'
  chicago: Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn,
    2017.
  ieee: S. Nachtigall, <i>Sortieren dynamischer Daten</i>. Universität Paderborn,
    2017.
  mla: Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn,
    2017.
  short: S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.
date_created: 2017-12-19T09:59:32Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Sortieren dynamischer Daten
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '1074'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  last_name: Pukrop
citation:
  ama: Pukrop S. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn;
    2017.
  apa: Pukrop, S. (2017). <i>Robuste Optimierung in Congestion Games</i>. Universität
    Paderborn.
  bibtex: '@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität
    Paderborn}, author={Pukrop, Simon}, year={2017} }'
  chicago: Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität
    Paderborn, 2017.
  ieee: S. Pukrop, <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn,
    2017.
  mla: Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität
    Paderborn, 2017.
  short: S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn,
    2017.
date_created: 2017-12-19T10:00:25Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Robuste Optimierung in Congestion Games
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '1080'
author:
- first_name: Jan
  full_name: Bürmann, Jan
  last_name: Bürmann
citation:
  ama: Bürmann J. <i>Complexity of Signalling in Routing Games under Uncertainty</i>.
    Universität Paderborn; 2017.
  apa: Bürmann, J. (2017). <i>Complexity of Signalling in Routing Games under Uncertainty</i>.
    Universität Paderborn.
  bibtex: '@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under
    Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017}
    }'
  chicago: Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>.
    Universität Paderborn, 2017.
  ieee: J. Bürmann, <i>Complexity of Signalling in Routing Games under Uncertainty</i>.
    Universität Paderborn, 2017.
  mla: Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>.
    Universität Paderborn, 2017.
  short: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty,
    Universität Paderborn, 2017.
date_created: 2017-12-19T10:07:35Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Complexity of Signalling in Routing Games under Uncertainty
type: mastersthesis
user_id: '14052'
year: '2017'
...
---
_id: '1081'
author:
- first_name: Vipin Ravindran
  full_name: Vijayalakshmi, Vipin Ravindran
  last_name: Vijayalakshmi
citation:
  ama: Vijayalakshmi VR. <i>Bounding the Inefficiency of Equilibria in Congestion
    Games under Taxation</i>. Universität Paderborn; 2017.
  apa: Vijayalakshmi, V. R. (2017). <i>Bounding the Inefficiency of Equilibria in
    Congestion Games under Taxation</i>. Universität Paderborn.
  bibtex: '@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria
    in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi,
    Vipin Ravindran}, year={2017} }'
  chicago: Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria
    in Congestion Games under Taxation</i>. Universität Paderborn, 2017.
  ieee: V. R. Vijayalakshmi, <i>Bounding the Inefficiency of Equilibria in Congestion
    Games under Taxation</i>. Universität Paderborn, 2017.
  mla: Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria
    in Congestion Games under Taxation</i>. Universität Paderborn, 2017.
  short: V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion
    Games under Taxation, Universität Paderborn, 2017.
date_created: 2017-12-19T10:08:44Z
date_updated: 2022-01-06T06:50:51Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Bounding the Inefficiency of Equilibria in Congestion Games under Taxation
type: mastersthesis
user_id: '14052'
year: '2017'
...
---
_id: '200'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
citation:
  ama: Drees M. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>.
    Universität Paderborn; 2016.
  apa: Drees, M. (2016). <i>Existence and Properties of Pure Nash Equilibria in Budget
    Games</i>. Universität Paderborn.
  bibtex: '@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria
    in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian},
    year={2016} }'
  chicago: Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria
    in Budget Games</i>. Universität Paderborn, 2016.
  ieee: M. Drees, <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>.
    Universität Paderborn, 2016.
  mla: Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria in Budget
    Games</i>. Universität Paderborn, 2016.
  short: M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games,
    Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:45:57Z
  date_updated: 2018-03-21T10:45:57Z
  file_id: '1525'
  file_name: 200-thesis.pdf
  file_size: 880390
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:45:57Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Existence and Properties of Pure Nash Equilibria in Budget Games
type: dissertation
user_id: '15415'
year: '2016'
...
---
_id: '210'
author:
- first_name: Lennart
  full_name: Leder, Lennart
  last_name: Leder
citation:
  ama: Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn;
    2016.
  apa: Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität
    Paderborn.
  bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität
    Paderborn}, author={Leder, Lennart}, year={2016} }'
  chicago: Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität
    Paderborn, 2016.
  ieee: L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn,
    2016.
  mla: Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität
    Paderborn, 2016.
  short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn,
    2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Congestion Games with Mixed Objectives
type: mastersthesis
user_id: '14052'
year: '2016'
...
---
_id: '1082'
author:
- first_name: Tobias
  full_name: Handirk, Tobias
  last_name: Handirk
citation:
  ama: Handirk T. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität
    Paderborn; 2016.
  apa: Handirk, T. (2016). <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>.
    Universität Paderborn.
  bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken},
    publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }'
  chicago: Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>.
    Universität Paderborn, 2016.
  ieee: T. Handirk, <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>.
    Universität Paderborn, 2016.
  mla: Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>.
    Universität Paderborn, 2016.
  short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität
    Paderborn, 2016.
date_created: 2017-12-19T10:10:17Z
date_updated: 2022-01-06T06:50:51Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Über die Rolle von Informationen in Verkehrsnetzwerken
type: bachelorsthesis
user_id: '14052'
year: '2016'
...
---
_id: '251'
author:
- first_name: Karlson
  full_name: Pfannschmidt, Karlson
  last_name: Pfannschmidt
citation:
  ama: Pfannschmidt K. <i>Solving the Aggregated Bandits Problem</i>. Universität
    Paderborn; 2015.
  apa: Pfannschmidt, K. (2015). <i>Solving the aggregated bandits problem</i>. Universität
    Paderborn.
  bibtex: '@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem},
    publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015}
    }'
  chicago: Pfannschmidt, Karlson. <i>Solving the Aggregated Bandits Problem</i>. Universität
    Paderborn, 2015.
  ieee: K. Pfannschmidt, <i>Solving the aggregated bandits problem</i>. Universität
    Paderborn, 2015.
  mla: Pfannschmidt, Karlson. <i>Solving the Aggregated Bandits Problem</i>. Universität
    Paderborn, 2015.
  short: K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn,
    2015.
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:56:50Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Solving the aggregated bandits problem
type: mastersthesis
user_id: '14052'
year: '2015'
...
---
_id: '316'
author:
- first_name: Jannis
  full_name: Pautz, Jannis
  last_name: Pautz
citation:
  ama: Pautz J. <i>Budget Games with Priced Strategies</i>. Universität Paderborn;
    2015.
  apa: Pautz, J. (2015). <i>Budget Games with priced strategies</i>. Universität Paderborn.
  bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität
    Paderborn}, author={Pautz, Jannis}, year={2015} }'
  chicago: Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität
    Paderborn, 2015.
  ieee: J. Pautz, <i>Budget Games with priced strategies</i>. Universität Paderborn,
    2015.
  mla: Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn,
    2015.
  short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Budget Games with priced strategies
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
  full_name: Kothe, Nils
  last_name: Kothe
citation:
  ama: Kothe N. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn; 2015.
  apa: Kothe, N. (2015). <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk</i>. Universität Paderborn.
  bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
    year={2015} }'
  chicago: Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.
  ieee: N. Kothe, <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn, 2015.
  mla: Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn, 2015.
  short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '373'
author:
- first_name: David
  full_name: Pahl, David
  last_name: Pahl
citation:
  ama: Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität
    Paderborn; 2014.
  apa: Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn.
  bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
    publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
  chicago: Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  ieee: D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  mla: Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...