---
_id: '70'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- 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: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online
    Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>'
  apa: Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations
    in Online Leasing. In <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>
  bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price
    Fluctuations in Online Leasing}, DOI={<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>},
    booktitle={Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian,
    Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }'
  chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide.
    “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31,
    2017. <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>.
  ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations
    in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.
  mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings
    of the 11th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>.
  short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
    11th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA), 2017, pp. 17–31.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:26Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-71147-8_2
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:06:13Z
  date_updated: 2018-11-02T15:06:13Z
  file_id: '5293'
  file_name: PriceFluctuationInOnlineLeasin.pdf
  file_size: 287315
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:06:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 17 - 31
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 11th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
status: public
title: Price Fluctuations in Online Leasing
type: conference
user_id: '477'
year: '2017'
...
---
_id: '700'
author:
- first_name: Till
  full_name: Knollmann, Till
  last_name: Knollmann
citation:
  ama: Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn; 2017.
  apa: Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn.
  bibtex: '@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of
    Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017}
    }'
  chicago: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn, 2017.
  ieee: T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  mla: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  short: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität
    Paderborn, 2017.
date_created: 2017-11-14T08:04:35Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: A Self-Stabilizing Protocol for Graphs of Diameter Two
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '701'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
citation:
  ama: Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn;
    2017.
  apa: Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn.
  bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität
    Paderborn}, author={Götte, Thorsten}, year={2017} }'
  chicago: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  ieee: T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn,
    2017.
  mla: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn,
    2017.
date_created: 2017-11-14T09:32:39Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Self-Stabilizing Spanners for Tree Metrics
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '86'
author:
- first_name: Laura
  full_name: Niggemeyer, Laura
  last_name: Niggemeyer
citation:
  ama: Niggemeyer L. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
    Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn;
    2017.
  apa: Niggemeyer, L. (2017). <i>Kartellabsprachen und vertikale Preisbindungen -
    Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>.
    Universität Paderborn.
  bibtex: '@book{Niggemeyer_2017, title={Kartellabsprachen und vertikale Preisbindungen
    - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland},
    publisher={Universität Paderborn}, author={Niggemeyer, Laura}, year={2017} }'
  chicago: Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen -
    Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>.
    Universität Paderborn, 2017.
  ieee: L. Niggemeyer, <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
    Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn,
    2017.
  mla: Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen - Eine
    wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>.
    Universität Paderborn, 2017.
  short: L. Niggemeyer, Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
    Analyse am Bespiel der Lebensmittelindustrie in Deutschland, Universität Paderborn,
    2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:57Z
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: Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
  Analyse am Bespiel der Lebensmittelindustrie in Deutschland
type: bachelorsthesis
user_id: '42447'
year: '2017'
...
---
_id: '50'
author:
- first_name: Erna
  full_name: Hamdeev, Erna
  last_name: Hamdeev
citation:
  ama: Hamdeev E. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>.
    Universität Paderborn; 2017.
  apa: Hamdeev, E. (2017). <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>.
    Universität Paderborn.
  bibtex: '@book{Hamdeev_2017, title={Verzerrte Online-Produktbewertungen - Literaturüberblick},
    publisher={Universität Paderborn}, author={Hamdeev, Erna}, year={2017} }'
  chicago: Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>.
    Universität Paderborn, 2017.
  ieee: E. Hamdeev, <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>.
    Universität Paderborn, 2017.
  mla: Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>.
    Universität Paderborn, 2017.
  short: E. Hamdeev, Verzerrte Online-Produktbewertungen - Literaturüberblick, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:34Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Verzerrte Online-Produktbewertungen - Literaturüberblick
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '5084'
author:
- first_name: Thomas
  full_name: Streck, Thomas
  id: '33041'
  last_name: Streck
citation:
  ama: Streck T. <i>How to Adequately Relocate Asylum Applicants within the European
    Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>.
    Universität Paderborn; 2017.
  apa: Streck, T. (2017). <i>How to adequately relocate asylum applicants within the
    European Union - An attempt to apply matching theory in the current migration
    crisis</i>. Universität Paderborn.
  bibtex: '@book{Streck_2017, title={How to adequately relocate asylum applicants
    within the European Union - An attempt to apply matching theory in the current
    migration crisis}, publisher={Universität Paderborn}, author={Streck, Thomas},
    year={2017} }'
  chicago: Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within
    the European Union - An Attempt to Apply Matching Theory in the Current Migration
    Crisis</i>. Universität Paderborn, 2017.
  ieee: T. Streck, <i>How to adequately relocate asylum applicants within the European
    Union - An attempt to apply matching theory in the current migration crisis</i>.
    Universität Paderborn, 2017.
  mla: Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within the
    European Union - An Attempt to Apply Matching Theory in the Current Migration
    Crisis</i>. Universität Paderborn, 2017.
  short: T. Streck, How to Adequately Relocate Asylum Applicants within the European
    Union - An Attempt to Apply Matching Theory in the Current Migration Crisis, Universität
    Paderborn, 2017.
date_created: 2018-10-30T14:51:20Z
date_updated: 2022-01-06T07:01:37Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '1'
  name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: How to adequately relocate asylum applicants within the European Union - An
  attempt to apply matching theory in the current migration crisis
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '51'
author:
- first_name: Nikolai
  full_name: Winkelhake, Nikolai
  last_name: Winkelhake
citation:
  ama: Winkelhake N. <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
    Analyse</i>. Universität Paderborn; 2017.
  apa: Winkelhake, N. (2017). <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
    Analyse</i>. Universität Paderborn.
  bibtex: '@book{Winkelhake_2017, title={Tying und Bundling in digitalen Märkten -
    eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Winkelhake,
    Nikolai}, year={2017} }'
  chicago: Winkelhake, Nikolai. <i>Tying und Bundling in digitalen Märkten - eine
    wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.
  ieee: N. Winkelhake, <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
    Analyse</i>. Universität Paderborn, 2017.
  mla: Winkelhake, Nikolai. <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
    Analyse</i>. Universität Paderborn, 2017.
  short: N. Winkelhake, Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische
    Analyse, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:37Z
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: Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse
type: mastersthesis
user_id: '42447'
year: '2017'
...
---
_id: '53'
abstract:
- lang: eng
  text: "Amongst the growing body of literature on the drivers of online ratings,
    the influence of\r\ncustomers’ local offline environment on their ratings has
    largely been neglected. This\r\nstudy examines the relationship between ratings
    made outside of a customer’s home area\r\nand the magnitude of online ratings.
    We employ a data-driven identification of a\r\ncustomer’s geographic home area
    and use variation in this variable to identify the\r\nconsequences for the magnitude
    of ratings. In line with our theory, we find that customers\r\nwho rate while
    traveling give, on average, higher ratings than locals. However, this\r\nrelationship
    is moderated by the posting time of a review relative to consumption, as\r\ntravelers
    post more negative ratings during or shortly after consumption. These\r\nrelationships
    are most pronounced for customers who travel and rate less frequently. Our\r\nresults
    come with substantial implications for a business’s average rating and for\r\ncustomer
    decision making. "
author:
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring
    the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS)</i>. ; 2017.'
  apa: Neumann, J., Gutt, D., &#38; Kundisch, D. (2017). The Traveling Reviewer Problem
    – Exploring the Relationship Between Offline Locations and Online Rating Behavior.
    In <i>Proceedings of the 38th International Conference on Information Systems
    (ICIS)</i>. Seoul, South Korea.
  bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer
    Problem – Exploring the Relationship Between Offline Locations and Online Rating
    Behavior}, booktitle={Proceedings of the 38th International Conference on Information
    Systems (ICIS)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis},
    year={2017} }'
  chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
    Problem – Exploring the Relationship Between Offline Locations and Online Rating
    Behavior.” In <i>Proceedings of the 38th International Conference on Information
    Systems (ICIS)</i>, 2017.
  ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring
    the Relationship Between Offline Locations and Online Rating Behavior,” in <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS)</i>, Seoul,
    South Korea, 2017.
  mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship
    Between Offline Locations and Online Rating Behavior.” <i>Proceedings of the 38th
    International Conference on Information Systems (ICIS)</i>, 2017.
  short: 'J. Neumann, D. Gutt, D. Kundisch, in: Proceedings of the 38th International
    Conference on Information Systems (ICIS), 2017.'
conference:
  end_date: 2017-12-13
  location: Seoul, South Korea
  name: 38th International Conference on Information Systems (ICIS)
  start_date: 2017-12-10
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:49Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T10:30:59Z
  date_updated: 2018-11-12T10:30:59Z
  file_id: '5486'
  file_name: viewcontent.pdf
  file_size: 532659
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T10:30:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 38th International Conference on Information Systems
  (ICIS)
status: public
title: The Traveling Reviewer Problem – Exploring the Relationship Between Offline
  Locations and Online Rating Behavior
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '54'
author:
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring
    the Relationship between Offline Locations and Online Rating Behavior. In: <i>INFORMS
    Annual Meeting</i>. ; 2017.'
  apa: Neumann, J., Gutt, D., &#38; Kundisch, D. (2017). The Traveling Reviewer Problem
    – Exploring the Relationship between Offline Locations and Online Rating Behavior.
    In <i>INFORMS Annual Meeting</i>. Houston, USA.
  bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer
    Problem – Exploring the Relationship between Offline Locations and Online Rating
    Behavior}, booktitle={INFORMS Annual Meeting}, author={Neumann, Jürgen and Gutt,
    Dominik and Kundisch, Dennis}, year={2017} }'
  chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
    Problem – Exploring the Relationship between Offline Locations and Online Rating
    Behavior.” In <i>INFORMS Annual Meeting</i>, 2017.
  ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring
    the Relationship between Offline Locations and Online Rating Behavior,” in <i>INFORMS
    Annual Meeting</i>, Houston, USA, 2017.
  mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship
    between Offline Locations and Online Rating Behavior.” <i>INFORMS Annual Meeting</i>,
    2017.
  short: 'J. Neumann, D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2017.'
conference:
  location: Houston, USA
  name: INFORMS Annual Meeting
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:51Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T10:38:39Z
  date_updated: 2018-11-12T10:38:39Z
  file_id: '5493'
  file_name: WP_TRP.pdf
  file_size: 694342
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T10:38:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: INFORMS Annual Meeting
status: public
title: The Traveling Reviewer Problem – Exploring the Relationship between Offline
  Locations and Online Rating Behavior
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '55'
abstract:
- lang: eng
  text: We introduce the mobile server problem, inspired by current trends to move
    computational tasks from cloud structures to multiple devices close to the end
    user. An example for this are embedded systems in autonomous cars that communicate
    in order to coordinate their actions. Our model is a variant of the classical
    Page Migration Problem. Moreformally, we consider a mobile server holding a data
    page.The server can move in the Euclidean space (of arbitrary dimension). In every
    round, requests for data items from the page pop up at arbitrary points in the
    space. The requests are served, each at a cost of the distance from the requesting
    point and the server, and the mobile server may move, at a cost D times the distance
    traveled for some constant D . We assume a maximum distance m the server is allowed
    to move per round. We show that no online algorithm can achieve a competitive
    ratio independent of the length of the input sequence in this setting. Hence we
    augment the maximum movement distance of the online algorithms to ( 1 + δ) times
    the maximum distance of the offline solution. We provide a deterministic algorithm
    which is simple to describe and works for multiple variants of our problem. The
    algorithm achieves almost tight competitive ratios independent of the length of
    the input sequence.
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. In: <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ; 2017:313-319. doi:<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>'
  apa: Feldkord, B., &#38; Meyer auf der Heide, F. (2017). The Mobile Server Problem.
    In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i> (pp. 313–319). <a href="https://doi.org/10.1145/3087556.3087575">https://doi.org/10.1145/3087556.3087575</a>
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server
    Problem}, DOI={<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>},
    booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm},
    year={2017}, pages={313–319} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
    Problem.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, 313–19, 2017. <a href="https://doi.org/10.1145/3087556.3087575">https://doi.org/10.1145/3087556.3087575</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    2017, pp. 313–319.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
    <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 2017, pp. 313–19, doi:<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>.
  short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3087556.3087575
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:55:10Z
  date_updated: 2018-11-02T14:55:10Z
  file_id: '5288'
  file_name: p313-feldkord.pdf
  file_size: 691691
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:55:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 313-319
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: The Mobile Server Problem
type: conference
user_id: '477'
year: '2017'
...
---
_id: '66'
abstract:
- lang: eng
  text: In budget games, players compete over resources with finite budgets. For every
    resource, a player has a specific demand and as a strategy, he chooses a subset
    of resources. If the total demand on a resource does not exceed its budget, the
    utility of each player who chose that resource equals his demand. Otherwise, the
    budget is shared proportionally. In the general case, pure Nash equilibria (NE)
    do not exist for such games. In this paper, we consider the natural classes of
    singleton and matroid budget games with additional constraints and show that for
    each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
    function to prove that every matroid budget game has an approximate pure NE which
    depends on the largest ratio between the different demands of each individual
    player.
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted
    Budget Games. In: <i>Proceedings of the 23rd International Computing and Combinatorics
    Conference (COCOON)</i>. LNCS. ; 2017:175--187. doi:<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>'
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2017). Pure Nash
    Equilibria in Restricted Budget Games. In <i>Proceedings of the 23rd International
    Computing and Combinatorics Conference (COCOON)</i> (pp. 175--187). <a href="https://doi.org/10.1007/978-3-319-62389-4_15">https://doi.org/10.1007/978-3-319-62389-4_15</a>
  bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
    Nash Equilibria in Restricted Budget Games}, DOI={<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>},
    booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
    (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
    and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “Pure Nash Equilibria in Restricted Budget Games.” In <i>Proceedings of the 23rd
    International Computing and Combinatorics Conference (COCOON)</i>, 175--187. LNCS,
    2017. <a href="https://doi.org/10.1007/978-3-319-62389-4_15">https://doi.org/10.1007/978-3-319-62389-4_15</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
    in Restricted Budget Games,” in <i>Proceedings of the 23rd International Computing
    and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187.
  mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
    <i>Proceedings of the 23rd International Computing and Combinatorics Conference
    (COCOON)</i>, 2017, pp. 175--187, doi:<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>.
  short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
    23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
    175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:58:42Z
  date_updated: 2018-10-31T16:58:42Z
  file_id: '5228'
  file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
  file_size: 346390
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 23rd International Computing and Combinatorics Conference
  (COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '696'
author:
- first_name: Lennart
  full_name: Wachowiak, Lennart
  last_name: Wachowiak
citation:
  ama: Wachowiak L. <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn;
    2017.
  apa: Wachowiak, L. (2017). <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn.
  bibtex: '@book{Wachowiak_2017, title={Das Mobile Server Problem in Netzwerken},
    publisher={Universität Paderborn}, author={Wachowiak, Lennart}, year={2017} }'
  chicago: Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  ieee: L. Wachowiak, <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  mla: Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  short: L. Wachowiak, Das Mobile Server Problem in Netzwerken, Universität Paderborn,
    2017.
date_created: 2017-11-14T06:58:39Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Das Mobile Server Problem in Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '697'
author:
- first_name: Michel
  full_name: Burkhardt, Michel
  last_name: Burkhardt
citation:
  ama: Burkhardt M. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn;
    2017.
  apa: Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.
  bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
    Paderborn}, author={Burkhardt, Michel}, year={2017} }'
  chicago: Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität
    Paderborn, 2017.
  ieee: M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  mla: Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  short: M. Burkhardt, Untersuchungen zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2017-11-14T08:01:41Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1048'
author:
- first_name: Andreas
  full_name: Schenk, Andreas
  last_name: Schenk
citation:
  ama: Schenk A. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn; 2017.
  apa: Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen</i>. Universität Paderborn.
  bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
    year={2017} }'
  chicago: Schenk, Andreas. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen</i>. Universität Paderborn, 2017.
  ieee: A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  mla: Schenk, Andreas. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  short: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:14:30Z
date_updated: 2022-01-06T06:50:41Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1049'
author:
- first_name: Björn
  full_name: Beckendorfer, Björn
  last_name: Beckendorfer
citation:
  ama: Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn; 2017.
  apa: Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn.
  bibtex: '@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter
    Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn},
    year={2017} }'
  chicago: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  ieee: B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  mla: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  short: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:17:43Z
date_updated: 2022-01-06T06:50:42Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '105'
abstract:
- lang: eng
  text: We initiate the study of network monitoring algorithms in a class of hybrid
    networks in which the nodes are connected by an external network and an internal
    network (as a short form for externally and internally controlled network). While
    the external network lies outside of the control of the nodes (or in our case,
    the monitoring protocol running in them) and might be exposed to continuous changes,
    the internal network is fully under the control of the nodes. As an example, consider
    a group of users with mobile devices having access to the cell phone infrastructure.
    While the network formed by the WiFi connections of the devices is an external
    network (as its structure is not necessarily under the control of the monitoring
    protocol), the connections between the devices via the cell phone infrastructure
    represent an internal network (as it can be controlled by the monitoring protocol).
    Our goal is to continuously monitor properties of the external network with the
    help of the internal network. We present scalable distributed algorithms that
    efficiently monitor the number of edges, the average node degree, the clustering
    coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their
    performance bounds demonstrate that monitoring the external network state with
    the help of an internal network can be done much more efficiently than just using
    the external network, as is usually done in the literature.
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network
    Properties: The Power of Hybrid Networks. In: <i>Proceedings of the 44th International
    Colloquium on Automata, Languages, and Programming (ICALP)</i>. Leibniz International
    Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>'
  apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., &#38; Sohler, C. (2017). Distributed
    Monitoring of Network Properties: The Power of Hybrid Networks. In <i>Proceedings
    of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>
    (pp. 137:1--137:15). <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>'
  bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz
    International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring
    of Network Properties: The Power of Hybrid Networks}, DOI={<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>},
    booktitle={Proceedings of the 44th International Colloquium on Automata, Languages,
    and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler,
    Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz
    International Proceedings in Informatics (LIPIcs)} }'
  chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian
    Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”
    In <i>Proceedings of the 44th International Colloquium on Automata, Languages,
    and Programming (ICALP)</i>, 137:1--137:15. Leibniz International Proceedings
    in Informatics (LIPIcs), 2017. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>.'
  ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring
    of Network Properties: The Power of Hybrid Networks,” in <i>Proceedings of the
    44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>,
    2017, pp. 137:1--137:15.'
  mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power
    of Hybrid Networks.” <i>Proceedings of the 44th International Colloquium on Automata,
    Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>.'
  short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the
    44th International Colloquium on Automata, Languages, and Programming (ICALP),
    2017, pp. 137:1--137:15.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.ICALP.2017.137
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-13T09:23:11Z
  date_updated: 2018-03-13T09:23:11Z
  file_id: '1207'
  file_name: 105-ICALP17-GHSS.pdf
  file_size: 504161
  relation: main_file
  success: 1
file_date_updated: 2018-03-13T09:23:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 137:1--137:15
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 44th International Colloquium on Automata, Languages,
  and Programming (ICALP)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks'
type: conference
user_id: '20792'
year: '2017'
...
---
_id: '1054'
abstract:
- lang: eng
  text: 'We explore how competition between physicians affects medical service provision.
    Previous research has shown that, without competition, physicians deviate from
    patient‐optimal treatment under payment systems like capitation and fee‐for‐service.
    Although competition might reduce these distortions, physicians usually interact
    with each other repeatedly over time and only a fraction of patients switches
    providers at all. Both patterns might prevent competition to work in the desired
    direction. To analyze the behavioral effects of competition, we develop a theoretical
    benchmark that is then tested in a controlled laboratory experiment. Experimental
    conditions vary physician payment and patient characteristics. Real patients benefit
    from provision decisions made in the experiment. Our results reveal that, in line
    with the theoretical prediction, introducing competition can reduce overprovision
    and underprovision, respectively. The observed effects depend on patient characteristics
    and the payment system, though. Tacit collusion is observed and particularly pronounced
    with fee‐for‐service payment, but it appears to be less frequent than in related
    experimental research on price competition. '
article_type: original
author:
- first_name: Janet
  full_name: Brosig-Koch, Janet
  last_name: Brosig-Koch
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
- first_name: Johanna
  full_name: Kokot, Johanna
  last_name: Kokot
citation:
  ama: Brosig-Koch J, Hehenkamp B, Kokot J. The effects of competition on medical
    service provision. <i>Health Economics</i>. 2017;26(53):6-20. doi:<a href="https://doi.org/10.1002/hec.3583">10.1002/hec.3583</a>
  apa: Brosig-Koch, J., Hehenkamp, B., &#38; Kokot, J. (2017). The effects of competition
    on medical service provision. <i>Health Economics</i>, <i>26</i>(53), 6–20. <a
    href="https://doi.org/10.1002/hec.3583">https://doi.org/10.1002/hec.3583</a>
  bibtex: '@article{Brosig-Koch_Hehenkamp_Kokot_2017, title={The effects of competition
    on medical service provision}, volume={26}, DOI={<a href="https://doi.org/10.1002/hec.3583">10.1002/hec.3583</a>},
    number={53}, journal={Health Economics}, publisher={Wiley Online Library}, author={Brosig-Koch,
    Janet and Hehenkamp, Burkhard and Kokot, Johanna}, year={2017}, pages={6–20} }'
  chicago: 'Brosig-Koch, Janet, Burkhard Hehenkamp, and Johanna Kokot. “The Effects
    of Competition on Medical Service Provision.” <i>Health Economics</i> 26, no.
    53 (2017): 6–20. <a href="https://doi.org/10.1002/hec.3583">https://doi.org/10.1002/hec.3583</a>.'
  ieee: J. Brosig-Koch, B. Hehenkamp, and J. Kokot, “The effects of competition on
    medical service provision,” <i>Health Economics</i>, vol. 26, no. 53, pp. 6–20,
    2017.
  mla: Brosig-Koch, Janet, et al. “The Effects of Competition on Medical Service Provision.”
    <i>Health Economics</i>, vol. 26, no. 53, Wiley Online Library, 2017, pp. 6–20,
    doi:<a href="https://doi.org/10.1002/hec.3583">10.1002/hec.3583</a>.
  short: J. Brosig-Koch, B. Hehenkamp, J. Kokot, Health Economics 26 (2017) 6–20.
date_created: 2017-12-15T11:16:41Z
date_updated: 2022-01-06T06:50:43Z
ddc:
- '000'
department:
- _id: '280'
- _id: '475'
doi: 10.1002/hec.3583
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:39:01Z
  date_updated: 2018-11-02T15:39:01Z
  file_id: '5309'
  file_name: Brosig-Koch_et_al-2018-Health_Economics.pdf
  file_size: 1116140
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:39:01Z
has_accepted_license: '1'
intvolume: '        26'
issue: '53'
language:
- iso: eng
page: 6-20
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Health Economics
publication_status: published
publisher: Wiley Online Library
quality_controlled: '1'
status: public
title: The effects of competition on medical service provision
type: journal_article
user_id: '477'
volume: 26
year: '2017'
...
---
_id: '1055'
author:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
- first_name: Oddvar
  full_name: Kaarboe, Oddvar
  last_name: Kaarboe
citation:
  ama: Hehenkamp B, Kaarboe O. <i>Location Choice and Quality Competition in Mixed
    Hospital Markets</i>. Universität Paderborn; 2017.
  apa: Hehenkamp, B., &#38; Kaarboe, O. (2017). <i>Location Choice and Quality Competition
    in Mixed Hospital Markets</i>. Universität Paderborn.
  bibtex: '@book{Hehenkamp_Kaarboe_2017, title={Location Choice and Quality Competition
    in Mixed Hospital Markets}, publisher={Universität Paderborn}, author={Hehenkamp,
    Burkhard and Kaarboe, Oddvar}, year={2017} }'
  chicago: Hehenkamp, Burkhard, and Oddvar Kaarboe. <i>Location Choice and Quality
    Competition in Mixed Hospital Markets</i>. Universität Paderborn, 2017.
  ieee: B. Hehenkamp and O. Kaarboe, <i>Location Choice and Quality Competition in
    Mixed Hospital Markets</i>. Universität Paderborn, 2017.
  mla: Hehenkamp, Burkhard, and Oddvar Kaarboe. <i>Location Choice and Quality Competition
    in Mixed Hospital Markets</i>. Universität Paderborn, 2017.
  short: B. Hehenkamp, O. Kaarboe, Location Choice and Quality Competition in Mixed
    Hospital Markets, Universität Paderborn, 2017.
date_created: 2017-12-15T11:19:12Z
date_updated: 2022-01-06T06:50:44Z
ddc:
- '330'
department:
- _id: '280'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: bhoyer
  date_created: 2018-11-06T14:01:20Z
  date_updated: 2018-11-06T14:01:20Z
  file_id: '5379'
  file_name: HehenkampKaarboe_20180905.pdf
  file_size: 318340
  relation: main_file
file_date_updated: 2018-11-06T14:01:20Z
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
publisher: Universität Paderborn
status: public
title: Location Choice and Quality Competition in Mixed Hospital Markets
type: report
user_id: '42447'
year: '2017'
...
---
_id: '1056'
author:
- first_name: Yiguan
  full_name: Gu, Yiguan
  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. <i>Evolutionary Equilibrium in Stochastic Contests
    - Entry, Effort, and Overdissipation</i>. Universität Paderborn; 2017.
  apa: Gu, Y., Hehenkamp, B., &#38; Leininger, W. (2017). <i>Evolutionary Equilibrium
    in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn.
  bibtex: '@book{Gu_Hehenkamp_Leininger_2017, title={Evolutionary Equilibrium in Stochastic
    Contests - Entry, Effort, and Overdissipation}, publisher={Universität Paderborn},
    author={Gu, Yiguan and Hehenkamp, Burkhard and Leininger, Wolfgang}, year={2017}
    }'
  chicago: Gu, Yiguan, Burkhard Hehenkamp, and Wolfgang Leininger. <i>Evolutionary
    Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität
    Paderborn, 2017.
  ieee: Y. Gu, B. Hehenkamp, and W. Leininger, <i>Evolutionary Equilibrium in Stochastic
    Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn, 2017.
  mla: Gu, Yiguan, et al. <i>Evolutionary Equilibrium in Stochastic Contests - Entry,
    Effort, and Overdissipation</i>. Universität Paderborn, 2017.
  short: Y. Gu, B. Hehenkamp, W. Leininger, Evolutionary Equilibrium in Stochastic
    Contests - Entry, Effort, and Overdissipation, Universität Paderborn, 2017.
date_created: 2017-12-15T11:21:34Z
date_updated: 2022-01-06T06:50:44Z
ddc:
- '330'
department:
- _id: '280'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: bhoyer
  date_created: 2018-11-06T14:05:20Z
  date_updated: 2018-11-06T14:05:20Z
  file_id: '5380'
  file_name: ESS_Contest_20181026.pdf
  file_size: 520711
  relation: main_file
file_date_updated: 2018-11-06T14:05:20Z
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
publisher: Universität Paderborn
status: public
title: Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation
type: report
user_id: '42447'
year: '2017'
...
---
_id: '1057'
author:
- first_name: Oktay
  full_name: Sürücü, Oktay
  last_name: Sürücü
- first_name: Behnud
  full_name: Mir Djawadi, Behnud
  id: '26032'
  last_name: Mir Djawadi
  orcid: 0000-0002-6271-5912
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
citation:
  ama: Sürücü O, Mir Djawadi B, Brangewitz S. <i>Asymmetric Dominance Effect with
    Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn;
    2017.
  apa: Sürücü, O., Mir Djawadi, B., &#38; Brangewitz, S. (2017). <i>Asymmetric Dominance
    Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität
    Paderborn.
  bibtex: '@book{Sürücü_Mir Djawadi_Brangewitz_2017, title={Asymmetric Dominance Effect
    with Multiple Decoys for Low- and High-Variance Lotteries}, publisher={Universität
    Paderborn}, author={Sürücü, Oktay and Mir Djawadi, Behnud and Brangewitz, Sonja},
    year={2017} }'
  chicago: Sürücü, Oktay, Behnud Mir Djawadi, and Sonja Brangewitz. <i>Asymmetric
    Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>.
    Universität Paderborn, 2017.
  ieee: O. Sürücü, B. Mir Djawadi, and S. Brangewitz, <i>Asymmetric Dominance Effect
    with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn,
    2017.
  mla: Sürücü, Oktay, et al. <i>Asymmetric Dominance Effect with Multiple Decoys for
    Low- and High-Variance Lotteries</i>. Universität Paderborn, 2017.
  short: O. Sürücü, B. Mir Djawadi, S. Brangewitz, Asymmetric Dominance Effect with
    Multiple Decoys for Low- and High-Variance Lotteries, Universität Paderborn, 2017.
date_created: 2017-12-15T11:24:00Z
date_updated: 2022-01-06T06:50:44Z
ddc:
- '330'
department:
- _id: '205'
- _id: '179'
file:
- access_level: closed
  content_type: application/pdf
  creator: bhoyer
  date_created: 2018-11-06T15:27:20Z
  date_updated: 2018-11-06T15:27:20Z
  file_id: '5386'
  file_name: SSRN-id2959997.pdf
  file_size: 260633
  relation: main_file
  success: 1
file_date_updated: 2018-11-06T15:27:20Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance
  Lotteries
type: report
user_id: '477'
year: '2017'
...