---
_id: '3936'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Philipp
  full_name: Herrmann, Philipp
  last_name: Herrmann
- first_name: Mohammad
  full_name: Rahman, Mohammad
  last_name: Rahman
citation:
  ama: 'Gutt D, Herrmann P, Rahman M. Crowd-Driven Competitive Intelligence: Understanding
    the Relationship between Local Market Competition and Online Rating Distributions.
    <i>Information Systems Research</i>. 2019;30(3):980-994.'
  apa: 'Gutt, D., Herrmann, P., &#38; Rahman, M. (2019). Crowd-Driven Competitive
    Intelligence: Understanding the Relationship between Local Market Competition
    and Online Rating Distributions. <i>Information Systems Research</i>, <i>30</i>(3),
    980–994.'
  bibtex: '@article{Gutt_Herrmann_Rahman_2019, title={Crowd-Driven Competitive Intelligence:
    Understanding the Relationship between Local Market Competition and Online Rating
    Distributions}, volume={30}, number={3}, journal={Information Systems Research},
    author={Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}, year={2019},
    pages={980–994} }'
  chicago: 'Gutt, Dominik, Philipp Herrmann, and Mohammad Rahman. “Crowd-Driven Competitive
    Intelligence: Understanding the Relationship between Local Market Competition
    and Online Rating Distributions.” <i>Information Systems Research</i> 30, no.
    3 (2019): 980–94.'
  ieee: 'D. Gutt, P. Herrmann, and M. Rahman, “Crowd-Driven Competitive Intelligence:
    Understanding the Relationship between Local Market Competition and Online Rating
    Distributions,” <i>Information Systems Research</i>, vol. 30, no. 3, pp. 980–994,
    2019.'
  mla: 'Gutt, Dominik, et al. “Crowd-Driven Competitive Intelligence: Understanding
    the Relationship between Local Market Competition and Online Rating Distributions.”
    <i>Information Systems Research</i>, vol. 30, no. 3, 2019, pp. 980–94.'
  short: D. Gutt, P. Herrmann, M. Rahman, Information Systems Research 30 (2019) 980–994.
date_created: 2018-08-20T09:45:31Z
date_updated: 2022-01-06T06:59:57Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T09:55:20Z
  date_updated: 2018-11-12T09:55:20Z
  file_id: '5473'
  file_name: Crowd-Driven_Competitive_Intelligence_accept.pdf
  file_size: 640218
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T09:55:20Z
has_accepted_license: '1'
intvolume: '        30'
issue: '3'
language:
- iso: eng
page: 980-994
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Information Systems Research
publication_status: epub_ahead
status: public
title: 'Crowd-Driven Competitive Intelligence: Understanding the Relationship between
  Local Market Competition and Online Rating Distributions'
type: journal_article
user_id: '16205'
volume: 30
year: '2019'
...
---
_id: '5471'
abstract:
- lang: eng
  text: "We characterise the set of dominant strategy incentive compatible (DSIC),
    strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms
    for the multi-unit bilateral trade setting. In such a setting there is a single
    buyer and a single seller who holds a finite number k of identical items. The
    mechanism has to decide how many units of the item are transferred from the seller
    to the buyer and how much money is transferred from the buyer to the seller. We
    consider two classes of valuation functions for the buyer and seller: Valuations
    that are increasing in the number of units in possession, and the more specific
    class of valuations that are increasing and submodular. \r\nFurthermore, we present
    some approximation results about the performance of certain such mechanisms, in
    terms of social welfare: For increasing submodular valuation functions, we show
    the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e)
    approximation mechanism, matching the best known bounds for the single-item setting."
author:
- first_name: Philip
  full_name: Lazos, Philip
  last_name: Lazos
- first_name: Paul
  full_name: Goldberg, Paul
  last_name: Goldberg
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
- first_name: Matthias
  full_name: Gerstgrasser, Matthias
  last_name: Gerstgrasser
- first_name: Bart
  full_name: de Keijzer, Bart
  last_name: de Keijzer
citation:
  ama: 'Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B.  Multi-unit
    Bilateral Trade. In: <i>Proceedings of the Thirty-Third AAAI Conference on Artificial
    Intelligence (AAAI)</i>. ; 2019. doi:<a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>'
  apa: Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &#38; de Keijzer,
    B. (2019).  Multi-unit Bilateral Trade. <i>Proceedings of the Thirty-Third AAAI
    Conference on Artificial Intelligence (AAAI)</i>. Thirty-Third AAAI Conference
    on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. <a href="https://doi.org/10.1609/aaai.v33i01.33011973">https://doi.org/10.1609/aaai.v33i01.33011973</a>
  bibtex: '@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={
    Multi-unit Bilateral Trade}, DOI={<a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>},
    booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
    (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and
    Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }'
  chicago: Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser,
    and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In <i>Proceedings of the Thirty-Third
    AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019. <a href="https://doi.org/10.1609/aaai.v33i01.33011973">https://doi.org/10.1609/aaai.v33i01.33011973</a>.
  ieee: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “
    Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on
    Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: <a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>.'
  mla: Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” <i>Proceedings of the
    Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019, doi:<a
    href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>.
  short: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in:
    Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI),
    2019.'
conference:
  end_date: 2019-02-01
  location: Honolulu, Hawaii, USA
  name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)
  start_date: 2019-01-27
date_created: 2018-11-12T09:38:16Z
date_updated: 2022-01-06T07:01:55Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1609/aaai.v33i01.33011973
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-12-06T13:57:51Z
  date_updated: 2018-12-06T13:57:51Z
  file_id: '6018'
  file_name: 1811.05130.pdf
  file_size: 315877
  relation: main_file
  success: 1
file_date_updated: 2018-12-06T13:57:51Z
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
publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
  (AAAI)
publication_status: published
status: public
title: ' Multi-unit Bilateral Trade'
type: conference
user_id: '15415'
year: '2019'
...
---
_id: '6856'
author:
- first_name: Michelle
  full_name: Müller, Michelle
  last_name: Müller
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: 'Müller M, Gutt D. Heart over Heels? An Empirical Analysis of the Relationship
    between Emotions and Review Helpfulness for Experience and Credence Goods. In:
    <i>Wirtschaftsinformatik Proceedings 2019</i>. ; 2019.'
  apa: Müller, M., &#38; Gutt, D. (2019). Heart over Heels? An Empirical Analysis
    of the Relationship between Emotions and Review Helpfulness for Experience and
    Credence Goods. In <i>Wirtschaftsinformatik Proceedings 2019</i>. Siegen, Germany.
  bibtex: '@inproceedings{Müller_Gutt_2019, title={Heart over Heels? An Empirical
    Analysis of the Relationship between Emotions and Review Helpfulness for Experience
    and Credence Goods}, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Müller,
    Michelle and Gutt, Dominik}, year={2019} }'
  chicago: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis
    of the Relationship between Emotions and Review Helpfulness for Experience and
    Credence Goods.” In <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.
  ieee: M. Müller and D. Gutt, “Heart over Heels? An Empirical Analysis of the Relationship
    between Emotions and Review Helpfulness for Experience and Credence Goods,” in
    <i>Wirtschaftsinformatik Proceedings 2019</i>, Siegen, Germany, 2019.
  mla: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis
    of the Relationship between Emotions and Review Helpfulness for Experience and
    Credence Goods.” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.
  short: 'M. Müller, D. Gutt, in: Wirtschaftsinformatik Proceedings 2019, 2019.'
conference:
  location: Siegen, Germany
  name: Wirtschaftsinformatik
date_created: 2019-01-17T14:39:49Z
date_updated: 2022-01-06T07:03:22Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Wirtschaftsinformatik Proceedings 2019
status: public
title: Heart over Heels? An Empirical Analysis of the Relationship between Emotions
  and Review Helpfulness for Experience and Credence Goods
type: conference
user_id: '16205'
year: '2019'
...
---
_id: '6857'
author:
- first_name: Martin
  full_name: Poniatowski, Martin
  id: '32441'
  last_name: Poniatowski
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: Thomas
  full_name: Görzen, Thomas
  id: '47700'
  last_name: Görzen
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Poniatowski M, Neumann J, Görzen T, Kundisch D. A Semi-Automated Approach
    for Generating Online Review Templates, . In: <i>Wirtschaftsinformatik Proceedings
    2019</i>. ; 2019.'
  apa: Poniatowski, M., Neumann, J., Görzen, T., &#38; Kundisch, D. (2019). A Semi-Automated
    Approach for Generating Online Review Templates, . In <i>Wirtschaftsinformatik
    Proceedings 2019</i>. Siegen, Germany.
  bibtex: '@inproceedings{Poniatowski_Neumann_Görzen_Kundisch_2019, title={A Semi-Automated
    Approach for Generating Online Review Templates, }, booktitle={Wirtschaftsinformatik
    Proceedings 2019}, author={Poniatowski, Martin and Neumann, Jürgen and Görzen,
    Thomas and Kundisch, Dennis}, year={2019} }'
  chicago: Poniatowski, Martin, Jürgen Neumann, Thomas Görzen, and Dennis Kundisch.
    “A Semi-Automated Approach for Generating Online Review Templates, .” In <i>Wirtschaftsinformatik
    Proceedings 2019</i>, 2019.
  ieee: M. Poniatowski, J. Neumann, T. Görzen, and D. Kundisch, “A Semi-Automated
    Approach for Generating Online Review Templates, ,” in <i>Wirtschaftsinformatik
    Proceedings 2019</i>, Siegen, Germany, 2019.
  mla: Poniatowski, Martin, et al. “A Semi-Automated Approach for Generating Online
    Review Templates, .” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.
  short: 'M. Poniatowski, J. Neumann, T. Görzen, D. Kundisch, in: Wirtschaftsinformatik
    Proceedings 2019, 2019.'
conference:
  location: Siegen, Germany
  name: Wirtschaftsinformatik
date_created: 2019-01-17T14:46:50Z
date_updated: 2022-01-06T07:03:22Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Wirtschaftsinformatik Proceedings 2019
status: public
title: 'A Semi-Automated Approach for Generating Online Review Templates, '
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
  text: We consider the problem of transforming a given graph G_s into a desired graph
    G_t by applying a minimum number of primitives from a particular set of local
    graph transformation primitives. These primitives are local in the sense that
    each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
    Although the specific set of primitives we consider makes it possible to transform
    any (weakly) connected graph into any other (weakly) connected graph consisting
    of the same nodes, they cannot disconnect the graph or introduce new nodes into
    the graph, making them ideal in the context of supervised overlay network transformations.
    We prove that computing a minimum sequence of primitive applications (even centralized)
    for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
    of local graph transformation primitives satisfying the aforementioned properties.
    On the other hand, we show that this problem admits a polynomial time algorithm
    with a constant approximation ratio.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
    In: <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>'
  apa: 'Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph
    Transformations. In <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece:
    Dagstuhl Publishing. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
    of Local Graph Transformations}, volume={132}, DOI={<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>},
    booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
    and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
    }'
  chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
    Graph Transformations.” In <i>Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl
    Publishing, 2019. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.
  ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
    in <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
  mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
    Transformations.” <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>.
  short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
  end_date: 2019-07-12
  location: Patras, Greece
  name: ICALP 2019
  start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T09:21:27Z
  date_updated: 2019-08-26T09:21:27Z
  file_id: '12955'
  file_name: LIPIcs-ICALP-2019-150.pdf
  file_size: 537649
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: '       132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
  and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '12870'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
    Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and
    Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>'
  apa: Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019).
    Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on
    Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>
  bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing
    Multiple Mobile Resources}, DOI={<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>},
    booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms
    (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and
    Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137}
    }'
  chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
    auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the
    17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer,
    2019. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>.
  ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
    Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation
    and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.
  mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer,
    2019, pp. 120–37, doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>.
  short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
    2019, pp. 120–137.'
date_created: 2019-07-22T09:00:05Z
date_updated: 2022-01-06T06:51:20Z
department:
- _id: '63'
doi: 10.1007/978-3-030-39479-0_9
external_id:
  arxiv:
  - '1907.09834'
language:
- iso: eng
page: 120 - 137
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 17th Workshop on Approximation and Online Algorithms
  (WAOA)
publication_status: published
publisher: Springer
status: public
title: Managing Multiple Mobile Resources
type: conference
user_id: '22704'
year: '2019'
...
---
_id: '15627'
author:
- first_name: John
  full_name: Augustine, John
  last_name: Augustine
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Philipp
  full_name: Schneider, Philipp
  last_name: Schneider
citation:
  ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths
    in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM
    Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a
    href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>'
  apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P.
    (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth
    Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia,
    PA. <a href="https://doi.org/10.1137/1.9781611975994.78">https://doi.org/10.1137/1.9781611975994.78</a>
  bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia,
    PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>},
    booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete
    Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian
    and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299}
    }'
  chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler,
    and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99.
    Philadelphia, PA, 2019. <a href="https://doi.org/10.1137/1.9781611975994.78">https://doi.org/10.1137/1.9781611975994.78</a>.
  ieee: J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest
    Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM
    Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.
  mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019,
    pp. 1280–99, doi:<a href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>.
  short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia,
    PA, 2019, pp. 1280–1299.'
date_created: 2020-01-22T09:07:36Z
date_updated: 2022-01-06T06:52:30Z
doi: 10.1137/1.9781611975994.78
language:
- iso: eng
page: 1280-1299
place: Philadelphia, PA
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  isbn:
  - '9781611975994'
publication_status: published
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '14829'
citation:
  ama: Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in
    Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>.
    ACM; 2019. doi:<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>
  apa: Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM. <a href="https://doi.org/10.1145/3323165">https://doi.org/10.1145/3323165</a>
  bibtex: '@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019},
    DOI={<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>}, publisher={ACM},
    year={2019} }'
  chicago: Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM, 2019. <a href="https://doi.org/10.1145/3323165">https://doi.org/10.1145/3323165</a>.
  ieee: C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>.
    ACM, 2019.
  mla: Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM, 2019, doi:<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>.
  short: C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019,
    ACM, 2019.
date_created: 2019-11-06T10:43:41Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1145/3323165
editor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Petra
  full_name: Berenbrink, Petra
  last_name: Berenbrink
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-1-4503-6184-2
publisher: ACM
status: public
title: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
  2019, Phoenix, AZ, USA, June 22-24, 2019
type: conference_editor
user_id: '477'
year: '2019'
...
---
_id: '15202'
abstract:
- lang: eng
  text: In this paper, we analyze the two-dimensional Nash bargaining solution (NBS)
    deploying a standard labor market negotiations model (see McDonald and Solow,
    1981; Creedy and McDonald, 1991). We show that the two-dimensional bargaining
    problem can be decomposed into two one-dimensional problems such that the (Cartesian)
    product of the solutions of these problems replicates the solution of the two-dimensional
    problem, if the NBS is applied. However, this decomposition fails for any solution
    concept that does not satisfy the axiom of Independence of Irrelevant Alternatives
    (IIA axiom). Our decomposition result has significant implications for actual
    negotiations, as it allows for the decomposition of a multi-issue bargaining problem
    into a set of simpler problems, in particular a set of single-issue bargaining
    problems. In this way, the decomposition may help facilitate negotiations in labor
    markets and also in other environments.
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Thorsten
  full_name: Upmann, Thorsten
  last_name: Upmann
- first_name: Papatya
  full_name: Duman, Papatya
  id: '72752'
  last_name: Duman
citation:
  ama: Haake C-J, Upmann T, Duman P. <i>The Decomposability of the Nash Bargaining
    Solution in Labor Markets</i>. Vol 128. CIE Working Paper Series, Paderborn University;
    2019.
  apa: Haake, C.-J., Upmann, T., &#38; Duman, P. (2019). <i>The Decomposability of
    the Nash Bargaining Solution in Labor Markets</i> (Vol. 128). CIE Working Paper
    Series, Paderborn University.
  bibtex: '@book{Haake_Upmann_Duman_2019, series={Working Papers CIE}, title={The
    Decomposability of the Nash Bargaining Solution in Labor Markets}, volume={128},
    publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen
    and Upmann, Thorsten and Duman, Papatya}, year={2019}, collection={Working Papers
    CIE} }'
  chicago: Haake, Claus-Jochen, Thorsten Upmann, and Papatya Duman. <i>The Decomposability
    of the Nash Bargaining Solution in Labor Markets</i>. Vol. 128. Working Papers
    CIE. CIE Working Paper Series, Paderborn University, 2019.
  ieee: C.-J. Haake, T. Upmann, and P. Duman, <i>The Decomposability of the Nash Bargaining
    Solution in Labor Markets</i>, vol. 128. CIE Working Paper Series, Paderborn University,
    2019.
  mla: Haake, Claus-Jochen, et al. <i>The Decomposability of the Nash Bargaining Solution
    in Labor Markets</i>. Vol. 128, CIE Working Paper Series, Paderborn University,
    2019.
  short: C.-J. Haake, T. Upmann, P. Duman, The Decomposability of the Nash Bargaining
    Solution in Labor Markets, CIE Working Paper Series, Paderborn University, 2019.
date_created: 2019-11-28T09:49:08Z
date_updated: 2022-01-06T06:52:16Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2019-11-28T09:50:10Z
  date_updated: 2019-11-28T09:50:10Z
  file_id: '15203'
  file_name: WP - The Decomposability of the Nash Bargaining Solution in Labor Markets.pdf
  file_size: 1068284
  relation: main_file
  success: 1
file_date_updated: 2019-11-28T09:50:10Z
has_accepted_license: '1'
intvolume: '       128'
keyword:
- Labor market negotiations
- Efficient bargains
- Nash bargaining solution
- Sequential bargaining
- Restricted bargaining games
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: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: The Decomposability of the Nash Bargaining Solution in Labor Markets
type: working_paper
user_id: '477'
volume: 128
year: '2019'
...
---
_id: '15204'
abstract:
- lang: eng
  text: 'We criticize some conceptual weaknesses in the recent literature on coalitional
    TUgames and propose, based on our critics, a new definition of dual TU-games that
    coincides with the one in the literature on the class of super-additive games.
    We justify our new definition in four alternative ways: 1. Via an adequate definition
    of ecient payo vectors. 2. Via a modification of the Bondareva-Shapley duality.
    3. Via an explicit consideration of \coalition building". 4. Via associating general
    TU-games to coalition-production economies. Rather than imputations, we base our
    analysis on a modification of aspirations.'
author:
- first_name: Fatma
  full_name: Aslan, Fatma
  last_name: Aslan
- first_name: Papatya
  full_name: Duman, Papatya
  last_name: Duman
- first_name: Walter
  full_name: Trockel, Walter
  last_name: Trockel
citation:
  ama: Aslan F, Duman P, Trockel W. <i>Duality for General TU-Games Redefined</i>.
    Vol 121. CIE Working Paper Series, Paderborn University; 2019.
  apa: Aslan, F., Duman, P., &#38; Trockel, W. (2019). <i>Duality for General TU-games
    Redefined</i> (Vol. 121). CIE Working Paper Series, Paderborn University.
  bibtex: '@book{Aslan_Duman_Trockel_2019, series={Working Papers CIE}, title={Duality
    for General TU-games Redefined}, volume={121}, publisher={CIE Working Paper Series,
    Paderborn University}, author={Aslan, Fatma and Duman, Papatya and Trockel, Walter},
    year={2019}, collection={Working Papers CIE} }'
  chicago: Aslan, Fatma, Papatya Duman, and Walter Trockel. <i>Duality for General
    TU-Games Redefined</i>. Vol. 121. Working Papers CIE. CIE Working Paper Series,
    Paderborn University, 2019.
  ieee: F. Aslan, P. Duman, and W. Trockel, <i>Duality for General TU-games Redefined</i>,
    vol. 121. CIE Working Paper Series, Paderborn University, 2019.
  mla: Aslan, Fatma, et al. <i>Duality for General TU-Games Redefined</i>. Vol. 121,
    CIE Working Paper Series, Paderborn University, 2019.
  short: F. Aslan, P. Duman, W. Trockel, Duality for General TU-Games Redefined, CIE
    Working Paper Series, Paderborn University, 2019.
date_created: 2019-11-28T10:00:41Z
date_updated: 2022-01-06T06:52:17Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2019-11-28T10:01:40Z
  date_updated: 2019-11-28T10:01:40Z
  file_id: '15205'
  file_name: WP - Duality for General TU-games Redefined.pdf
  file_size: 369323
  relation: main_file
  success: 1
file_date_updated: 2019-11-28T10:01:40Z
has_accepted_license: '1'
intvolume: '       121'
keyword:
- TU-games
- duality
- core
- c-Core
- cohesive games
- complete game efficiency
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: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: Duality for General TU-games Redefined
type: working_paper
user_id: '65453'
volume: 121
year: '2019'
...
---
_id: '13873'
article_number: '14'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. <i>ACM Transactions
    on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>
  apa: Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem.
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>
  bibtex: '@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem},
    volume={6}, DOI={<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>},
    number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord,
    Björn and Meyer auf der Heide, Friedhelm}, year={2019} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
    Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019).
    <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM
    Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019,
    doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>.
  short: B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing
    (TOPC) 6 (2019).
date_created: 2019-10-16T07:06:22Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3364204
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2020-01-24T08:12:58Z
  date_updated: 2020-01-24T08:12:58Z
  file_id: '15632'
  file_name: DissertationFeldkord.pdf
  file_size: 633652
  relation: main_file
  success: 1
file_date_updated: 2020-01-24T08:12:58Z
has_accepted_license: '1'
intvolume: '         6'
issue: '3'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: ACM Transactions on Parallel Computing (TOPC)
publication_status: published
status: public
title: The Mobile Server Problem
type: journal_article
user_id: '15504'
volume: 6
year: '2019'
...
---
_id: '13942'
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover
    and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321.
    doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>'
  apa: Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for
    Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>
    (pp. 315–321). SciTePress. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms
    for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>},
    booktitle={Proceedings of the 8th International Conference on Operations Research
    and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine
    and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }'
  chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    315–21. SciTePress, 2019. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>.
  ieee: C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex
    Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th
    International Conference on Operations Research and Enterprise Systems</i>, 2019,
    pp. 315–321.
  mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    SciTePress, 2019, pp. 315–21, doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp.
    315–321.'
date_created: 2019-10-21T13:42:50Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.5220/0007369503150321
language:
- iso: eng
page: 315-321
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 8th International Conference on Operations Research
  and Enterprise Systems
publisher: SciTePress
status: public
title: Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility
  Location
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13946'
author:
- first_name: Faisal N.
  full_name: Abu-Khzam, Faisal N.
  last_name: Abu-Khzam
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient
    parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>.
    2019;786:2-12. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>
  apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan,
    P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical
    Computer Science</i>, <i>786</i>, 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>
  bibtex: '@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient
    parallel algorithms for parameterized problems}, volume={786}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>},
    journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei
    and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
    year={2019}, pages={2–12} }'
  chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>.'
  ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
    “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer
    Science</i>, vol. 786, pp. 2–12, 2019.
  mla: Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>.
  short: F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
    Theoretical Computer Science 786 (2019) 2–12.
date_created: 2019-10-21T13:57:06Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2018.11.006
intvolume: '       786'
language:
- iso: eng
page: 2-12
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
status: public
title: Efficient parallel algorithms for parameterized problems
type: journal_article
user_id: '15415'
volume: 786
year: '2019'
...
---
_id: '14539'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
    in Hybrid Communication Networks. In: <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>.
    ; 2019:345-348. doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>'
  apa: Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of
    the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>
  bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>},
    booktitle={Proceedings of the 26th International Colloquium on Structural Information
    and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina
    and Scheideler, Christian}, year={2019}, pages={345–348} }'
  chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
    Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings
    of the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i>, 345–48, 2019. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>.
  ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
    Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>,
    L’Aquila, Italy, 2019, pp. 345–348.
  mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
    Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium
    on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp.
    345–48, doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>.
  short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019,
    pp. 345–348.'
conference:
  end_date: 2019-07-04
  location: L'Aquila, Italy
  name: SIROCCO 2019
  start_date: 2019-07-01
date_created: 2019-11-04T10:09:35Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-030-24922-9\_26
language:
- iso: eng
page: 345-348
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Colloquium on Structural Information
  and Communication Complexity (SIROCCO)
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13148'
abstract:
- lang: eng
  text: This paper examines the evolutionary stability of behaviour in contests where
    players’ participation can be stochastic. We find, for exogenously given participation
    probabilities, players exert more effort under the concept of a finite-population
    evolutionarily stable strategy (FPESS) than under Nash equilibrium (NE). We show
    that there is ex-ante overdissipation under FPESS for sufficiently large participation
    probabilities, if, and only if, the impact function is convex. With costly endogenous
    entry, players enter the contest with a higher probability and exert more effort
    under FPESS than under NE. Importantly, under endogenous entry, overdissipation
    can occur for all (Tullock) contest success functions, in particular those with
    concave impact functions.
author:
- first_name: Yiquan
  full_name: Gu, Yiquan
  last_name: Gu
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
- first_name: Wolfgang
  full_name: Leininger, Wolfgang
  last_name: Leininger
citation:
  ama: 'Gu Y, Hehenkamp B, Leininger W. Evolutionary equilibrium in contests with
    stochastic participation: Entry, effort and overdissipation. <i>Journal of Economic
    Behavior &#38; Organization</i>. 2019:469-485. doi:<a href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>'
  apa: 'Gu, Y., Hehenkamp, B., &#38; Leininger, W. (2019). Evolutionary equilibrium
    in contests with stochastic participation: Entry, effort and overdissipation.
    <i>Journal of Economic Behavior &#38; Organization</i>, 469–485. <a href="https://doi.org/10.1016/j.jebo.2019.06.011">https://doi.org/10.1016/j.jebo.2019.06.011</a>'
  bibtex: '@article{Gu_Hehenkamp_Leininger_2019, title={Evolutionary equilibrium in
    contests with stochastic participation: Entry, effort and overdissipation}, DOI={<a
    href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>},
    journal={Journal of Economic Behavior &#38; Organization}, author={Gu, Yiquan
    and Hehenkamp, Burkhard and Leininger, Wolfgang}, year={2019}, pages={469–485}
    }'
  chicago: 'Gu, Yiquan, Burkhard Hehenkamp, and Wolfgang Leininger. “Evolutionary
    Equilibrium in Contests with Stochastic Participation: Entry, Effort and Overdissipation.”
    <i>Journal of Economic Behavior &#38; Organization</i>, 2019, 469–85. <a href="https://doi.org/10.1016/j.jebo.2019.06.011">https://doi.org/10.1016/j.jebo.2019.06.011</a>.'
  ieee: 'Y. Gu, B. Hehenkamp, and W. Leininger, “Evolutionary equilibrium in contests
    with stochastic participation: Entry, effort and overdissipation,” <i>Journal
    of Economic Behavior &#38; Organization</i>, pp. 469–485, 2019.'
  mla: 'Gu, Yiquan, et al. “Evolutionary Equilibrium in Contests with Stochastic Participation:
    Entry, Effort and Overdissipation.” <i>Journal of Economic Behavior &#38; Organization</i>,
    2019, pp. 469–85, doi:<a href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>.'
  short: Y. Gu, B. Hehenkamp, W. Leininger, Journal of Economic Behavior &#38; Organization
    (2019) 469–485.
date_created: 2019-09-06T09:28:46Z
date_updated: 2022-01-06T06:51:29Z
department:
- _id: '280'
doi: 10.1016/j.jebo.2019.06.011
language:
- iso: eng
page: 469-485
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Journal of Economic Behavior & Organization
publication_identifier:
  issn:
  - 0167-2681
publication_status: published
status: public
title: 'Evolutionary equilibrium in contests with stochastic participation: Entry,
  effort and overdissipation'
type: journal_article
user_id: '37953'
year: '2019'
...
---
_id: '13182'
abstract:
- lang: eng
  text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe
    problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers
    (called \\emph{clients} in this paper) that want to send messages to a fixed common
    peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in
    V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity
    of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages
    per round and excess messages are dropped.\r\nThe server can modify these probabilities
    when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
    p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
    \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
    \  \r\nOur protocol lets the system converge from \\emph{any} initial state to
    a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)|
    \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
    rounds in expectation.\r\nIn particular, the initial client probabilities and
    server variables are not necessarily well-defined, i.e., they may have arbitrary
    values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
    is length of node identifiers, making it very lightweight.\r\nFinally we state
    a lower bound on the convergence time an see that our protocol performs asymptotically
    optimal (up to some polylogarithmic factor).\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for
    Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the
    21st International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164.
    doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>'
  apa: Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing
    Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>
  bibtex: '@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in
    Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion
    Control with Logarithmic Memory}, DOI={<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>},
    booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
    Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164},
    collection={Lecture Notes in Computer Science} }'
  chicago: Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely
    Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”
    In <i>Proceedings of the 21st International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer
    Science. Springer, Cham, 2019. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol
    for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>, 2019, pp. 149–164.
  mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized
    Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>,
    Springer, Cham, 2019, pp. 149–64, doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  short: 'M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    Springer, Cham, 2019, pp. 149–164.'
date_created: 2019-09-10T12:48:33Z
date_updated: 2022-01-06T06:51:30Z
ddc:
- '000'
department:
- _id: '79'
doi: https://doi.org/10.1007/978-3-030-34992-9_13
external_id:
  arxiv:
  - '1909.04544'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2019-09-11T11:20:16Z
  date_updated: 2019-09-11T11:20:16Z
  file_id: '13188'
  file_name: main.pdf
  file_size: 428908
  relation: main_file
  success: 1
file_date_updated: 2019-09-11T11:20:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 149-164
project:
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '1'
  name: SFB 901
publication: Proceedings of the 21st International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control with
  Logarithmic Memory
type: conference
user_id: '23538'
year: '2019'
...
---
_id: '10277'
author:
- first_name: Steffen
  full_name: Althaus, Steffen
  last_name: Althaus
citation:
  ama: Althaus S. <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn; 2019.
  apa: Althaus, S. (2019). <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn.
  bibtex: '@book{Althaus_2019, place={Universität Paderborn}, title={Optimizing Sales
    Channel Performance with Digital Experiments in the Crafting Industry}, author={Althaus,
    Steffen}, year={2019} }'
  chicago: Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital
    Experiments in the Crafting Industry</i>. Universität Paderborn, 2019.
  ieee: S. Althaus, <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn, 2019.
  mla: Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. 2019.
  short: S. Althaus, Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry, Universität Paderborn, 2019.
date_created: 2019-06-19T14:59:00Z
date_updated: 2022-01-06T06:50:33Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: Optimizing Sales Channel Performance with Digital Experiments in the Crafting
  Industry
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '10281'
abstract:
- lang: eng
  text: 'Competing firms tend to select similar locations for their stores. This phenomenon,
    called the principle of minimum differentiation, was captured by Hotelling with
    a landmark model of spatial competition but is still the object of an ongoing
    scientific debate. Although consistently observed in practice, many more realistic
    variants of Hotelling''s model fail to support minimum differentiation or do not
    have pure equilibria at all. In particular, it was recently proven for a generalized
    model which incorporates negative network externalities and which contains Hotelling''s
    model and classical selfish load balancing as special cases, that the unique equilibria
    do not adhere to minimum differentiation. Furthermore, it was shown that for a
    significant parameter range pure equilibria do not exist. We derive a sharp contrast
    to these previous results by investigating Hotelling''s model with negative network
    externalities from an entirely new angle: approximate pure subgame perfect equilibria.
    This approach allows us to prove analytically and via agent-based simulations
    that approximate equilibria having good approximation guarantees and that adhere
    to minimum differentiation exist for the full parameter range of the model. Moreover,
    we show that the obtained approximate equilibria have high social welfare.'
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: 'Pascal '
  full_name: 'Lenzner, Pascal '
  last_name: Lenzner
- first_name: Louise
  full_name: Molitor, Louise
  last_name: Molitor
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Feldotto M, Lenzner P, Molitor L, Skopalik A.  From Hotelling to Load Balancing:
    Approximation and the Principle of Minimum Differentiation. In: <i>Proceedings
    of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>.
    International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.'
  apa: 'Feldotto, M., Lenzner, P., Molitor, L., &#38; Skopalik, A. (2019).  From Hotelling
    to Load Balancing: Approximation and the Principle of Minimum Differentiation.
    In <i>Proceedings of the 18th International Conference on Autonomous Agents and
    MultiAgent Systems</i> (pp. 1949--1951). Montreal QC, Canada: International Foundation
    for Autonomous Agents and Multiagent Systems.'
  bibtex: '@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling
    to Load Balancing: Approximation and the Principle of Minimum Differentiation},
    booktitle={Proceedings of the 18th International Conference on Autonomous Agents
    and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents
    and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal  and Molitor,
    Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }'
  chicago: 'Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik.
    “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum
    Differentiation.” In <i>Proceedings of the 18th International Conference on Autonomous
    Agents and MultiAgent Systems</i>, 1949--1951. International Foundation for Autonomous
    Agents and Multiagent Systems, 2019.'
  ieee: 'M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to
    Load Balancing: Approximation and the Principle of Minimum Differentiation,” in
    <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent
    Systems</i>, Montreal QC, Canada, 2019, pp. 1949--1951.'
  mla: 'Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation
    and the Principle of Minimum Differentiation.” <i>Proceedings of the 18th International
    Conference on Autonomous Agents and MultiAgent Systems</i>, International Foundation
    for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
  short: 'M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the
    18th International Conference on Autonomous Agents and MultiAgent Systems, International
    Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
conference:
  location: Montreal QC, Canada
  name: 18th International Conference on Autonomous Agents and MultiAgent Systems
date_created: 2019-06-20T14:46:08Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '004'
department:
- _id: '541'
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:10:02Z
  date_updated: 2019-08-26T11:10:02Z
  file_id: '12962'
  file_name: 1903.04265.pdf
  file_size: 698599
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:10:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=3331973
page: 1949--1951
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Proceedings of the 18th International Conference on Autonomous Agents
  and MultiAgent Systems
publication_status: published
publisher: International Foundation for Autonomous Agents and Multiagent Systems
status: public
title: ' From Hotelling to Load Balancing: Approximation and the Principle of Minimum
  Differentiation'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10290'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: Gutt D. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität
    Paderborn; 2019. doi:<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>
  apa: Gutt, D. (2019). <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-688">https://doi.org/10.17619/UNIPB/1-688</a>
  bibtex: '@book{Gutt_2019, place={Universität Paderborn}, title={Essays on Drivers
    and Economic Outcomes of Online-Reviews}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>},
    author={Gutt, Dominik}, year={2019} }'
  chicago: Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn, 2019. <a href="https://doi.org/10.17619/UNIPB/1-688">https://doi.org/10.17619/UNIPB/1-688</a>.
  ieee: D. Gutt, <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn, 2019.
  mla: Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>.
  short: D. Gutt, Essays on Drivers and Economic Outcomes of Online-Reviews, Universität
    Paderborn, 2019.
date_created: 2019-06-25T09:43:55Z
date_updated: 2022-01-06T06:50:35Z
ddc:
- '330'
department:
- _id: '276'
doi: 10.17619/UNIPB/1-688
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-07-16T10:58:09Z
  date_updated: 2019-07-16T10:58:09Z
  file_id: '11960'
  file_name: DissertationGutt.pdf
  file_size: 1149237
  relation: main_file
  success: 1
file_date_updated: 2019-07-16T10:58:09Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: Essays on Drivers and Economic Outcomes of Online-Reviews
type: dissertation
user_id: '15504'
year: '2019'
...
---
_id: '10332'
abstract:
- lang: eng
  text: We analyze the incentives for retail bundling and the welfare effects of retail
    bundling in a decentralized distribution channel with two retailers and two monopolistic
    manufacturers. One manufacturer exclusively sells his good to one retailer, whereas
    the other manufacturer sells his good to both retailers. Thus, one retailer is
    a monopolist for one product but competes with the other retailer in the second
    product market. The two-product retailer has the option to bundle his goods or
    to sell them separately. We find that bundling aggravates the double marginalization
    problem for the bundling retailer. Nevertheless, when the retailers compete in
    prices, bundling can be more profitable than separate selling for the retailer
    as bundling softens the retail competition. The ultimate outcome depends on the
    manufacturers’ marginal costs. Given retail quantity competition, however, bundling
    is in no case the retailer’s best strategy. Furthermore, we show that profitable
    bundling reduces consumer and producer surplus in the equilibrium.
author:
- first_name: Joachim Maria Josef
  full_name: Heinzel, Joachim Maria Josef
  id: '53445'
  last_name: Heinzel
citation:
  ama: 'Heinzel JMJ. <i>Bundling in a Distribution Channel with Retail Competition</i>.
    Paderborn University: CIE Working Paper Series; 2019.'
  apa: 'Heinzel, J. M. J. (2019). <i>Bundling in a Distribution Channel with Retail
    Competition</i>. Paderborn University: CIE Working Paper Series.'
  bibtex: '@book{Heinzel_2019, place={Paderborn University}, title={Bundling in a
    Distribution Channel with Retail Competition}, publisher={CIE Working Paper Series},
    author={Heinzel, Joachim Maria Josef}, year={2019} }'
  chicago: 'Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with
    Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.'
  ieee: 'J. M. J. Heinzel, <i>Bundling in a Distribution Channel with Retail Competition</i>.
    Paderborn University: CIE Working Paper Series, 2019.'
  mla: Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail
    Competition</i>. CIE Working Paper Series, 2019.
  short: J.M.J. Heinzel, Bundling in a Distribution Channel with Retail Competition,
    CIE Working Paper Series, Paderborn University, 2019.
date_created: 2019-06-28T08:42:49Z
date_updated: 2022-01-06T06:50:37Z
ddc:
- '330'
department:
- _id: '280'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: jheinzel
  date_created: 2019-06-28T08:44:52Z
  date_updated: 2019-06-28T08:44:52Z
  file_id: '10333'
  file_name: WP120.pdf
  file_size: 375054
  relation: main_file
  success: 1
file_date_updated: 2019-06-28T08:44:52Z
has_accepted_license: '1'
keyword:
- retail bundling
- leverage theory
- double marginalization
language:
- iso: eng
place: Paderborn University
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series
status: public
title: Bundling in a Distribution Channel with Retail Competition
type: report
user_id: '53445'
year: '2019'
...