---
_id: '149'
abstract:
- lang: eng
  text: 'In this paper we consider a strategic variant of the online facility location
    problem. Given is a graph in which each node serves two roles: it is a strategic
    client stating requests as well as a potential location for a facility. In each
    time step one client states a request which induces private costs equal to the
    distance to the closest facility. Before serving, the clients may collectively
    decide to open new facilities, sharing the corresponding price. Instead of optimizing
    the global costs, each client acts selfishly. The prices of new facilities vary
    between nodes and also change over time, but are always bounded by some fixed
    value α. Both the requests as well as the facility prices are given by an online
    sequence and are not known in advance.We characterize the optimal strategies of
    the clients and analyze their overall performance in comparison to a centralized
    offline solution. If all players optimize their own competitiveness, the global
    performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
    to a natural subclass of strategies improves this result to O(α). We also show
    that for fixed facility costs, we can find strategies such that this bound further
    improves to O(√α).'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>'
  apa: Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility
    Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i> (pp. 593--607). <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>
  bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
    Online Facility Location}, DOI={<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>},
    booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
    Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
    }'
  chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
    Facility Location.” In <i>Proceedings of the 10th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016.
    <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>.
  ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
    in <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.
  mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>.
  short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:55:43Z
  date_updated: 2018-03-21T12:55:43Z
  file_id: '1553'
  file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
  file_size: 236253
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '144'
abstract:
- lang: eng
  text: 'Following the direction pioneered by Fiat and Papadimitriou in their 2010
    paper [12], we study the complexity of deciding the existence of mixed equilibria
    for minimization games where players use valuations other than expectation to
    evaluate their costs. We consider risk-averse players seeking to minimize the
    sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative
    and vanishes exactly when the cost incurred to a player is constant over all choices
    of strategies by the other players. In a V-equilibrium, no player could unilaterally
    reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if
    all strategies supported in a player''s best-response mixed strategy incur the
    same conditional expectation of her cost. We introduce E-strict concavity and
    observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation
    property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation
    property, which we exploit to prove two main complexity results, the first of
    their kind, for the two simplest cases of the problem:• Two strategies: Deciding
    the existence of a V-equilibrium is strongly NP-hard for the restricted class
    of player-specific scheduling games on two ordered links [22], when choosing R
    as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum
    of even moments of small order.• Two players: Deciding the existence of a V-equilibrium
    is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the
    risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the
    concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence
    of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation
    property and a few additional properties for V; its proof involves a reduction
    with a single parameter, which can be chosen efficiently so that each valuation
    satisfies the additional properties.'
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
citation:
  ama: Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations.
    <i>Theoretical Computer Science</i>. 2016;634:67-96. doi:<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>
  apa: Monien, B., &#38; Mavronicolas, M. (2016). The complexity of equilibria for
    risk-modeling valuations. <i>Theoretical Computer Science</i>, <i>634</i>, 67–96.
    <a href="https://doi.org/10.1016/j.tcs.2016.04.013">https://doi.org/10.1016/j.tcs.2016.04.013</a>
  bibtex: '@article{Monien_Mavronicolas_2016, title={The complexity of equilibria
    for risk-modeling valuations}, volume={634}, DOI={<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien,
    Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }'
  chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria
    for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i> 634 (2016):
    67–96. <a href="https://doi.org/10.1016/j.tcs.2016.04.013">https://doi.org/10.1016/j.tcs.2016.04.013</a>.'
  ieee: B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling
    valuations,” <i>Theoretical Computer Science</i>, vol. 634, pp. 67–96, 2016.
  mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for
    Risk-Modeling Valuations.” <i>Theoretical Computer Science</i>, vol. 634, Elsevier,
    2016, pp. 67–96, doi:<a href="https://doi.org/10.1016/j.tcs.2016.04.013">10.1016/j.tcs.2016.04.013</a>.
  short: B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:51:59Z
ddc:
- '040'
doi: 10.1016/j.tcs.2016.04.013
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:58:42Z
  date_updated: 2018-03-21T12:58:42Z
  file_id: '1557'
  file_name: 144-Monien_Mavronicolas-TCS2016_01.pdf
  file_size: 633599
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:58:42Z
has_accepted_license: '1'
intvolume: '       634'
language:
- iso: eng
page: 67-96
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: The complexity of equilibria for risk-modeling valuations
type: journal_article
user_id: '42447'
volume: 634
year: '2016'
...
---
_id: '5934'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>.
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and
    Applications</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Renegotiable vs. Non-Renegotiable Agreements - Theory
    and Applications}, publisher={Universität Paderborn}, author={N, N}, year={2016}
    }'
  chicago: N, N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>.
    Universität Paderborn, 2016.
  ieee: N. N, <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>.
    Universität Paderborn, 2016.
  mla: N, N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>.
    Universität Paderborn, 2016.
  short: N. N, Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications,
    Universität Paderborn, 2016.
date_created: 2018-11-28T10:27:23Z
date_updated: 2022-11-30T14:17:14Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '5932'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der
    Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>.
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Wie wertvoll ist der Einzelne für das Team? - Performancemessung
    der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015</i>.
    Universität Paderborn.
  bibtex: '@book{N_2016, title={Wie wertvoll ist der Einzelne für das Team? - Performancemessung
    der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015},
    publisher={Universität Paderborn}, author={N, N}, year={2016} }'
  chicago: N, N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung
    Der Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>.
    Universität Paderborn, 2016.
  ieee: N. N, <i>Wie wertvoll ist der Einzelne für das Team? - Performancemessung
    der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015</i>.
    Universität Paderborn, 2016.
  mla: N, N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der
    Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>.
    Universität Paderborn, 2016.
  short: N. N, Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der
    Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015, Universität
    Paderborn, 2016.
date_created: 2018-11-28T10:23:06Z
date_updated: 2022-11-30T14:25:52Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler
  anhand der kooperativen Spieltheorie der Saison 2014/2015
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5940'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie
    Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn;
    2016.
  apa: N, N. (2016). <i>Automatisiertes Matching von Angebot und Nachfrage in der
    Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH</i>.
    Universität Paderborn.
  bibtex: '@book{N_2016, title={Automatisiertes Matching von Angebot und Nachfrage
    in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH},
    publisher={Universität Paderborn}, author={N, N}, year={2016} }'
  chicago: N, N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie
    Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn,
    2016.
  ieee: N. N, <i>Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie
    Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH</i>. Universität Paderborn,
    2016.
  mla: N, N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie
    Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn,
    2016.
  short: N. N, Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie
    Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH, Universität Paderborn,
    2016.
date_created: 2018-11-28T10:39:15Z
date_updated: 2022-11-30T14:26:34Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie
  Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5935'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische
    Analyse</i>. Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine
    spieltheoretische Analyse</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Der Einfluss von Netzwerken auf Gleichgewichtspreise
    - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N,
    N}, year={2016} }'
  chicago: N, N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische
    Analyse</i>. Universität Paderborn, 2016.
  ieee: N. N, <i>Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2016.
  mla: N, N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische
    Analyse</i>. Universität Paderborn, 2016.
  short: N. N, Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische
    Analyse, Universität Paderborn, 2016.
date_created: 2018-11-28T10:29:57Z
date_updated: 2022-11-30T14:25:23Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische
  Analyse
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5931'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i>
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Hat vertikale Integration einen Einfluss auf die allgemeine
    Wohlfahrt?</i> Universität Paderborn.
  bibtex: '@book{N_2016, title={Hat vertikale Integration einen Einfluss auf die allgemeine
    Wohlfahrt?}, publisher={Universität Paderborn}, author={N, N}, year={2016} }'
  chicago: N, N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i>
    Universität Paderborn, 2016.
  ieee: N. N, <i>Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?</i>
    Universität Paderborn, 2016.
  mla: N, N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i>
    Universität Paderborn, 2016.
  short: N. N, Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?,
    Universität Paderborn, 2016.
date_created: 2018-11-28T10:14:40Z
date_updated: 2022-11-30T14:26:07Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5941'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>.
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte</i>.
    Universität Paderborn.
  bibtex: '@book{N_2016, title={Stabile Supply-Chains - Basierend auf der Theorie
    der Matching-Märkte}, publisher={Universität Paderborn}, author={N, N}, year={2016}
    }'
  chicago: N, N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>.
    Universität Paderborn, 2016.
  ieee: N. N, <i>Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte</i>.
    Universität Paderborn, 2016.
  mla: N, N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>.
    Universität Paderborn, 2016.
  short: N. N, Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte,
    Universität Paderborn, 2016.
date_created: 2018-11-28T10:42:02Z
date_updated: 2022-11-30T14:26:22Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5933'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren</i>.
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Die Berechnung von Machtindizes - ein Vergleich verschiedener
    Verfahren</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Die Berechnung von Machtindizes - ein Vergleich verschiedener
    Verfahren}, publisher={Universität Paderborn}, author={N, N}, year={2016} }'
  chicago: N, N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener
    Verfahren</i>. Universität Paderborn, 2016.
  ieee: N. N, <i>Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren</i>.
    Universität Paderborn, 2016.
  mla: N, N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren</i>.
    Universität Paderborn, 2016.
  short: N. N, Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren,
    Universität Paderborn, 2016.
date_created: 2018-11-28T10:25:05Z
date_updated: 2022-11-30T14:25:37Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5939'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn;
    2016.
  apa: N, N. (2016). <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Intermediaries in Buyer Seller Networks}, publisher={Universität
    Paderborn}, author={N, N}, year={2016} }'
  chicago: N, N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn,
    2016.
  ieee: N. N, <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn,
    2016.
  mla: N, N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn,
    2016.
  short: N. N, Intermediaries in Buyer Seller Networks, Universität Paderborn, 2016.
date_created: 2018-11-28T10:36:09Z
date_updated: 2022-11-30T14:26:49Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Intermediaries in Buyer Seller Networks
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5937'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische
    Analyse</i>. Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Staatliche Regulierung in vertikal verbundenen Industrien
    - eine spieltheoretische Analyse</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Staatliche Regulierung in vertikal verbundenen Industrien
    - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N,
    N}, year={2016} }'
  chicago: N, N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine
    Spieltheoretische Analyse</i>. Universität Paderborn, 2016.
  ieee: N. N, <i>Staatliche Regulierung in vertikal verbundenen Industrien - eine
    spieltheoretische Analyse</i>. Universität Paderborn, 2016.
  mla: N, N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische
    Analyse</i>. Universität Paderborn, 2016.
  short: N. N, Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische
    Analyse, Universität Paderborn, 2016.
date_created: 2018-11-28T10:32:44Z
date_updated: 2022-11-30T14:27:16Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische
  Analyse
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '5938'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>.
    Universität Paderborn; 2016.
  apa: N, N. (2016). <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical
    Concepts</i>. Universität Paderborn.
  bibtex: '@book{N_2016, title={Pricing and Revenue Sharing of Bundles Using Game
    Theoretical Concepts}, publisher={Universität Paderborn}, author={N, N}, year={2016}
    }'
  chicago: N, N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical
    Concepts</i>. Universität Paderborn, 2016.
  ieee: N. N, <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>.
    Universität Paderborn, 2016.
  mla: N, N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>.
    Universität Paderborn, 2016.
  short: N. N, Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts,
    Universität Paderborn, 2016.
date_created: 2018-11-28T10:34:03Z
date_updated: 2022-11-30T14:27:02Z
department:
- _id: '205'
language:
- iso: eng
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '249'
abstract:
- lang: eng
  text: 'We analyze the stability of networks when two intermediaries strategically
    form costly links to customers. We interpret these links as customer relationships
    that enable trade to sell a product. Equilibrium prices and equilibrium quantities
    on the output as well as on the input market are determined endogenously for a
    given network of customer relationships. We investigate in how far the substitutability
    of the intermediaries'' products and the costs of link formation influence the
    intermediaries'' equilibrium profits and thus have an impact on the incentives
    to strategically form relationships to customers. For networks with three customers
    we characterize locally stable networks, in particular existence is guaranteed
    for any degree of substitutability. Moreover for the special cases of perfect
    complements, independent products and perfect substitutes, local stability coincides
    with the stronger concept of Nash stability. Additionally, for networks with n
    customers we analyze stability regions for selected networks and determine their
    limits when n goes to infinity. It turns out that the shape of the stability regions
    for those networks does not significantly change compared to a setting with a
    small number of customers. '
author:
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Philipp
  full_name: Möhlmeier, Philipp
  last_name: Möhlmeier
citation:
  ama: Brangewitz S, Haake C-J, Möhlmeier P. <i>Strategic Formation of Customer Relationship
    Networks</i>. Vol 91. Universität Paderborn; 2015.
  apa: Brangewitz, S., Haake, C.-J., &#38; Möhlmeier, P. (2015). <i>Strategic Formation
    of Customer Relationship Networks</i> (Vol. 91). Universität Paderborn.
  bibtex: '@book{Brangewitz_Haake_Möhlmeier_2015, series={Working Papers CIE}, title={Strategic
    Formation of Customer Relationship Networks}, volume={91}, publisher={Universität
    Paderborn}, author={Brangewitz, Sonja and Haake, Claus-Jochen and Möhlmeier, Philipp},
    year={2015}, collection={Working Papers CIE} }'
  chicago: Brangewitz, Sonja, Claus-Jochen Haake, and Philipp Möhlmeier. <i>Strategic
    Formation of Customer Relationship Networks</i>. Vol. 91. Working Papers CIE.
    Universität Paderborn, 2015.
  ieee: S. Brangewitz, C.-J. Haake, and P. Möhlmeier, <i>Strategic Formation of Customer
    Relationship Networks</i>, vol. 91. Universität Paderborn, 2015.
  mla: Brangewitz, Sonja, et al. <i>Strategic Formation of Customer Relationship Networks</i>.
    Vol. 91, Universität Paderborn, 2015.
  short: S. Brangewitz, C.-J. Haake, P. Möhlmeier, Strategic Formation of Customer
    Relationship Networks, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:40Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T09:10:34Z
  date_updated: 2018-08-09T09:13:36Z
  file_id: '3865'
  file_name: WP - Strategic Formation of Customer Relationship Networks.pdf
  file_size: 908865
  relation: main_file
  title: Strategic Formation of Customer Relationship Networks
file_date_updated: 2018-08-09T09:13:36Z
has_accepted_license: '1'
intvolume: '        91'
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
series_title: Working Papers CIE
status: public
title: Strategic Formation of Customer Relationship Networks
type: working_paper
urn: '2499'
user_id: '65453'
volume: 91
year: '2015'
...
---
_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: '256'
author:
- first_name: Finn
  full_name: Zindler, Finn
  last_name: Zindler
citation:
  ama: Zindler F. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine
    wettbewerbspolitische Beurteilung</i>. Universität Paderborn; 2015.
  apa: Zindler, F. (2015). <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas
    AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn.
  bibtex: '@book{Zindler_2015, title={Selektive Vertriebssysteme am Fallbeispiel der
    Adidas AG - eine wettbewerbspolitische Beurteilung}, publisher={Universität Paderborn},
    author={Zindler, Finn}, year={2015} }'
  chicago: Zindler, Finn. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas
    AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.
  ieee: F. Zindler, <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG -
    eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.
  mla: Zindler, Finn. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG
    - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.
  short: F. Zindler, Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine
    wettbewerbspolitische Beurteilung, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:07Z
department:
- _id: '280'
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: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische
  Beurteilung
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '282'
author:
- first_name: Michelle
  full_name: Kirsch, Michelle
  last_name: Kirsch
citation:
  ama: Kirsch M. <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
    und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>.
    Universität Paderborn; 2015.
  apa: Kirsch, M. (2015). <i>Koordinierter Patentschutz in einer globalisierten Welt
    - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>.
    Universität Paderborn.
  bibtex: '@book{Kirsch_2015, title={Koordinierter Patentschutz in einer globalisierten
    Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern},
    publisher={Universität Paderborn}, author={Kirsch, Michelle}, year={2015} }'
  chicago: Kirsch, Michelle. <i>Koordinierter Patentschutz in einer globalisierten
    Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>.
    Universität Paderborn, 2015.
  ieee: M. Kirsch, <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
    und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>.
    Universität Paderborn, 2015.
  mla: Kirsch, Michelle. <i>Koordinierter Patentschutz in einer globalisierten Welt
    - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>.
    Universität Paderborn, 2015.
  short: M. Kirsch, Koordinierter Patentschutz in einer globalisierten Welt - Effizienz-
    und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:57:53Z
department:
- _id: '280'
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: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen
  auf die Arzneimittelversorgung in Entwicklungsländern
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '244'
abstract:
- lang: eng
  text: We revisit the simple class of weighted congestion games on parallel links
    [10], where each player has a non-negative weight and her cost on the link she
    chooses is the sum of the weights of all players choosing the link. We extend
    this class to mix-weighted congestion games on parallel links, where weights may
    as well be negative. For the resulting simple class, we study the complexity of
    deciding the existence of a pure equilibrium, where no player could unilaterally
    improve her cost by switching to another link.We show that even for a singlenegative
    weight, this decision problem is strongly NP-complete when the number of links
    is part of the input; the problem is NP-complete already for two links. When the
    number of links is a fixed constant, we show, through a pseudopolynomial, dynamic
    programming algorithm, that the problem is not strongly NP-complete unless P =
    NP; the algorithm works for any number of negative weights.
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
citation:
  ama: Monien B, Mavronicolas M. The complexity of pure equilibria in mix-weighted
    congestion games on parallel links. <i>Information Processing Letters</i>. 2015;115(12):927-931.
    doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>
  apa: Monien, B., &#38; Mavronicolas, M. (2015). The complexity of pure equilibria
    in mix-weighted congestion games on parallel links. <i>Information Processing
    Letters</i>, <i>115</i>(12), 927–931. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>
  bibtex: '@article{Monien_Mavronicolas_2015, title={The complexity of pure equilibria
    in mix-weighted congestion games on parallel links}, volume={115}, DOI={<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>},
    number={12}, journal={Information Processing Letters}, publisher={Elsevier}, author={Monien,
    Burkhard and Mavronicolas, Marios}, year={2015}, pages={927–931} }'
  chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i> 115, no. 12 (2015): 927–31. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>.'
  ieee: B. Monien and M. Mavronicolas, “The complexity of pure equilibria in mix-weighted
    congestion games on parallel links,” <i>Information Processing Letters</i>, vol.
    115, no. 12, pp. 927–931, 2015.
  mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i>, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>.
  short: B. Monien, M. Mavronicolas, Information Processing Letters 115 (2015) 927–931.
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:20Z
ddc:
- '040'
doi: 10.1016/j.ipl.2015.07.012
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:48:16Z
  date_updated: 2018-03-21T09:48:16Z
  file_id: '1494'
  file_name: 244-Mavronic_Monien2015_01.pdf
  file_size: 239984
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:48:16Z
has_accepted_license: '1'
intvolume: '       115'
issue: '12'
language:
- iso: eng
main_file_link:
- url: http://www.sciencedirect.com/journal/information-processing-letters/vol/115/issue/12
page: 927-931
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Information Processing Letters
publisher: Elsevier
status: public
title: The complexity of pure equilibria in mix-weighted congestion games on parallel
  links
type: journal_article
user_id: '42447'
volume: 115
year: '2015'
...
---
_id: '320'
abstract:
- lang: eng
  text: 'We consider structural and algorithmic questions related to the Nash dynamics
    of weighted congestion games. In weighted congestion games with linear latency
    functions, the existence of pure Nash equilibria is guaranteed by a potential
    function argument. Unfortunately, this proof of existence is inefficient and computing
    pure Nash equilibria in such games is a PLS-hard problem even when all players
    have unit weights. The situation gets worse when superlinear (e.g., quadratic)
    latency functions come into play; in this case, the Nash dynamics of the game
    may contain cycles and pure Nash equilibria may not even exist. Given these obstacles,
    we consider approximate pure Nash equilibria as alternative solution concepts.
    A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game
    from which no player has any incentive to deviate in order to improve her cost
    by a multiplicative factor higher than ρ. Do such equilibria exist for small values
    of ρ? And if so, can we compute them efficiently?We provide positive answers to
    both questions for weighted congestion games with polynomial latency functions
    by exploiting an “approximation” of such games by a new class of potential games
    that we call Ψ-games. This allows us to show that these games have d!-approximate
    pure Nash equilibria, where d is the maximum degree of the latency functions.
    Our main technical contribution is an efficient algorithm for computing O(1)-approximate
    pure Nash equilibria when d is a constant. For games with linear latency functions,
    the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency
    functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial
    in the number of bits in the representation of the game and 1/γ. As a byproduct
    of our techniques, we also show the following interesting structural statement
    for weighted congestion games with polynomial latency functions of maximum degree
    d ≥ 2: polynomially-long sequences of best-response moves from any initial state
    to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified
    in such games as long as d is a constant.To the best of our knowledge, these are
    the first positive algorithmic results for approximate pure Nash equilibria in
    weighted congestion games. Our techniques significantly extend our recent work
    on unweighted congestion games through the use of Ψ-games. The concept of approximating
    nonpotential games by potential ones is interesting in itself and might have further
    applications.'
article_number: '2'
author:
- first_name: Ioannis
  full_name: Caragiannis, Ioannis
  last_name: Caragiannis
- first_name: Angelo
  full_name: Fanelli, Angelo
  last_name: Fanelli
- first_name: Nick
  full_name: Gravin, Nick
  last_name: Gravin
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria
    in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
    <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>'
  apa: 'Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate
    Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1).
    <a href="https://doi.org/10.1145/2614687">https://doi.org/10.1145/2614687</a>'
  bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure
    Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure}, volume={3}, DOI={<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>},
    number={12}, journal={Transactions on Economics and Computation}, publisher={ACM},
    author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik,
    Alexander}, year={2015} }'
  chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
    “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient
    Computation, and Structure.” <i>Transactions on Economics and Computation</i>
    3, no. 1 (2015). <a href="https://doi.org/10.1145/2614687">https://doi.org/10.1145/2614687</a>.'
  ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure
    Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no.
    1, 2015.'
  mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted
    Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions
    on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>.'
  short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics
    and Computation 3 (2015).
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2614687
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:40:55Z
  date_updated: 2018-03-20T07:40:55Z
  file_id: '1433'
  file_name: 320-a2-caragiannis.pdf
  file_size: 260503
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:40:55Z
has_accepted_license: '1'
intvolume: '         3'
issue: '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
publication: Transactions on Economics and Computation
publisher: ACM
status: public
title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence,
  Efficient Computation, and Structure'
type: journal_article
user_id: '477'
volume: 3
year: '2015'
...
---
_id: '292'
author:
- first_name: Christina
  full_name: Osburg, Christina
  last_name: Osburg
citation:
  ama: Osburg C. <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen</i>. Universität Paderborn; 2015.
  apa: Osburg, C. (2015). <i>Fusionen von gesetzlichen Krankenversicherungen zu den
    Effizienz- und Wechselwirkungen</i>. Universität Paderborn.
  bibtex: '@book{Osburg_2015, title={Fusionen von gesetzlichen Krankenversicherungen
    zu den Effizienz- und Wechselwirkungen}, publisher={Universität Paderborn}, author={Osburg,
    Christina}, year={2015} }'
  chicago: Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu
    den Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.
  ieee: C. Osburg, <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen</i>. Universität Paderborn, 2015.
  mla: Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu den
    Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.
  short: C. Osburg, Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '280'
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: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '294'
author:
- first_name: GinaJoanna
  full_name: Materna, GinaJoanna
  last_name: Materna
citation:
  ama: Materna G. <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>.
    Universität Paderborn; 2015.
  apa: Materna, G. (2015). <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn.
  bibtex: '@book{Materna_2015, title={Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik}, publisher={Universität Paderborn}, author={Materna, GinaJoanna},
    year={2015} }'
  chicago: Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn, 2015.
  ieee: G. Materna, <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>.
    Universität Paderborn, 2015.
  mla: Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn, 2015.
  short: G. Materna, Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:48Z
department:
- _id: '280'
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: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik
type: bachelorsthesis
user_id: '42447'
year: '2015'
...