---
_id: '243'
abstract:
- lang: eng
  text: This paper introduces the problem of communication pattern adaption for a
    distributed self-adjusting binary search tree. We propose a simple local algorithm,
    which is closely related to the nearly thirty-year-old idea of splay trees and
    evaluate its adaption performance in the distributed scenario if different communication
    patterns are provided.To do so, the process of self-adjustment is modeled similarly
    to a basic network creation game, in which the nodes want to communicate with
    only a certain subset of all nodes. We show that, in general, the game (i.e.,
    the process of local adjustments) does not converge, and convergence is related
    to certain structures of the communication interests, which we call conflicts.We
    classify conflicts and show that for two communication scenarios in which convergence
    is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
    the different classes of conflicts separately and show that, for a certain class
    of conflicts, the performance of the tree network is asymptotically as good as
    the performance for converging instances. However, for the other conflict classes,
    a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Strothmann TF. The impact of communication patterns on distributed locally
    self-adjusting binary search trees. In: <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>'
  apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
    locally self-adjusting binary search trees. In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>
  bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
    patterns on distributed locally self-adjusting binary search trees}, DOI={<a href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>},
    booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
    (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
    collection={LNCS} }'
  chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>.
  ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
    self-adjusting binary search trees,” in <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186.
  mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>.
  short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
    and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:59:00Z
  date_updated: 2018-03-21T09:59:00Z
  file_id: '1495'
  file_name: 243-Strothmann-Walcom2015.pdf
  file_size: 1003113
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
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 9th International Workshop on Algorithms and Computation
  (WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
  binary search trees
type: conference
user_id: '477'
year: '2015'
...
---
_id: '244'
abstract:
- lang: eng
  text: We revisit the simple class of weighted congestion games on parallel links
    [10], where each player has a non-negative weight and her cost on the link she
    chooses is the sum of the weights of all players choosing the link. We extend
    this class to mix-weighted congestion games on parallel links, where weights may
    as well be negative. For the resulting simple class, we study the complexity of
    deciding the existence of a pure equilibrium, where no player could unilaterally
    improve her cost by switching to another link.We show that even for a singlenegative
    weight, this decision problem is strongly NP-complete when the number of links
    is part of the input; the problem is NP-complete already for two links. When the
    number of links is a fixed constant, we show, through a pseudopolynomial, dynamic
    programming algorithm, that the problem is not strongly NP-complete unless P =
    NP; the algorithm works for any number of negative weights.
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
citation:
  ama: Monien B, Mavronicolas M. The complexity of pure equilibria in mix-weighted
    congestion games on parallel links. <i>Information Processing Letters</i>. 2015;115(12):927-931.
    doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>
  apa: Monien, B., &#38; Mavronicolas, M. (2015). The complexity of pure equilibria
    in mix-weighted congestion games on parallel links. <i>Information Processing
    Letters</i>, <i>115</i>(12), 927–931. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>
  bibtex: '@article{Monien_Mavronicolas_2015, title={The complexity of pure equilibria
    in mix-weighted congestion games on parallel links}, volume={115}, DOI={<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>},
    number={12}, journal={Information Processing Letters}, publisher={Elsevier}, author={Monien,
    Burkhard and Mavronicolas, Marios}, year={2015}, pages={927–931} }'
  chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i> 115, no. 12 (2015): 927–31. <a href="https://doi.org/10.1016/j.ipl.2015.07.012">https://doi.org/10.1016/j.ipl.2015.07.012</a>.'
  ieee: B. Monien and M. Mavronicolas, “The complexity of pure equilibria in mix-weighted
    congestion games on parallel links,” <i>Information Processing Letters</i>, vol.
    115, no. 12, pp. 927–931, 2015.
  mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
    in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing
    Letters</i>, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:<a href="https://doi.org/10.1016/j.ipl.2015.07.012">10.1016/j.ipl.2015.07.012</a>.
  short: B. Monien, M. Mavronicolas, Information Processing Letters 115 (2015) 927–931.
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:20Z
ddc:
- '040'
doi: 10.1016/j.ipl.2015.07.012
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:48:16Z
  date_updated: 2018-03-21T09:48:16Z
  file_id: '1494'
  file_name: 244-Mavronic_Monien2015_01.pdf
  file_size: 239984
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:48:16Z
has_accepted_license: '1'
intvolume: '       115'
issue: '12'
language:
- iso: eng
main_file_link:
- url: http://www.sciencedirect.com/journal/information-processing-letters/vol/115/issue/12
page: 927-931
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Information Processing Letters
publisher: Elsevier
status: public
title: The complexity of pure equilibria in mix-weighted congestion games on parallel
  links
type: journal_article
user_id: '42447'
volume: 115
year: '2015'
...
---
_id: '247'
abstract:
- lang: eng
  text: 'Multi-rooted trees are becoming the norm for modern data-center networks.
    In these networks, scalable flow routing is challenging owing to vast number of
    flows. Current approaches either employ a central controller that can have scalability
    issues or a scalable decentralized algorithm only considering local information.
    In this paper we present a new decentralized approach to least-congested path
    routing in software-defined data center networks that has neither of these issues:
    By duplicating the initial (or SYN) packet of a flow and estimating the data rate
    of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find
    the least congested path. We show that our algorithm significantly improves flow
    completion time without the need for a central controller or specialized hardware.'
author:
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing
    without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>'
  apa: 'Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path
    Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href="https://doi.org/10.1109/EWSDN.2015.58">https://doi.org/10.1109/EWSDN.2015.58</a>'
  bibtex: '@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive
    Multi-path Routing without Collecting Statistics}, DOI={<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>},
    booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
    (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42}
    }'
  chicago: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive
    Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th
    European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015.
    <a href="https://doi.org/10.1109/EWSDN.2015.58">https://doi.org/10.1109/EWSDN.2015.58</a>.'
  ieee: 'A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path
    Routing without Collecting Statistics,” in <i>Proceedings of the 4th European
    Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.'
  mla: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path
    Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href="https://doi.org/10.1109/EWSDN.2015.58">10.1109/EWSDN.2015.58</a>.'
  short: 'A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.58
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:46:21Z
  date_updated: 2018-03-21T09:46:21Z
  file_id: '1491'
  file_name: 247-07313613.pdf
  file_size: 277574
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:46:21Z
has_accepted_license: '1'
page: 37-42
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 4th European Workshop on Software Defined Networks
  (EWSDN 2015)
status: public
title: 'SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting
  Statistics'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '258'
author:
- first_name: Melissa
  full_name: Sonntag, Melissa
  last_name: Sonntag
citation:
  ama: Sonntag M. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn; 2015.
  apa: Sonntag, M. (2015). <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn.
  bibtex: '@book{Sonntag_2015, title={Reputation und Vertrauen auf Online-Märkten},
    publisher={Universität Paderborn}, author={Sonntag, Melissa}, year={2015} }'
  chicago: Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  ieee: M. Sonntag, <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  mla: Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität
    Paderborn, 2015.
  short: M. Sonntag, Reputation und Vertrauen auf Online-Märkten, Universität Paderborn,
    2015.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:12Z
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: Reputation und Vertrauen auf Online-Märkten
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '259'
author:
- 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: 'Gutt D, Kundisch D. Rating Aggregation in Multi-Dimensional Rating Systems:
    How Do Reviewers Form Overall Ratings? In: <i>INFORMS Annual Meeting</i>. ; 2015.'
  apa: 'Gutt, D., &#38; Kundisch, D. (2015). Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings? In <i>INFORMS Annual Meeting</i>.
    Philadelphia, USA.'
  bibtex: '@inproceedings{Gutt_Kundisch_2015, title={Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?}, booktitle={INFORMS Annual
    Meeting}, author={Gutt, Dominik and Kundisch, Dennis}, year={2015} }'
  chicago: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?” In <i>INFORMS Annual Meeting</i>,
    2015.'
  ieee: 'D. Gutt and D. Kundisch, “Rating Aggregation in Multi-Dimensional Rating
    Systems: How Do Reviewers Form Overall Ratings?,” in <i>INFORMS Annual Meeting</i>,
    Philadelphia, USA, 2015.'
  mla: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
    Rating Systems: How Do Reviewers Form Overall Ratings?” <i>INFORMS Annual Meeting</i>,
    2015.'
  short: 'D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2015.'
conference:
  location: Philadelphia, USA
  name: INFORMS Annual Meeting
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:13Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2019-01-18T14:11:39Z
  date_updated: 2019-01-18T14:11:39Z
  file_id: '6862'
  file_name: Informs_annual_meeting_2015.pdf
  file_size: 89877
  relation: main_file
  success: 1
file_date_updated: 2019-01-18T14:11: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: 'Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form
  Overall Ratings?'
type: conference_abstract
user_id: '477'
year: '2015'
...
---
_id: '264'
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
citation:
  ama: Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>.
    Universität Paderborn; 2015.
  apa: Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer
    Knowledge</i>. Universität Paderborn.
  bibtex: '@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer
    Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015}
    }'
  chicago: Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer
    Knowledge</i>. Universität Paderborn, 2015.
  ieee: P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer
    Knowledge</i>. Universität Paderborn, 2015.
  mla: Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer
    Knowledge</i>. Universität Paderborn, 2015.
  short: P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:20Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:34:36Z
  date_updated: 2018-03-21T09:34:36Z
  file_id: '1481'
  file_name: 264-Dissertation_-_Wette.pdf
  file_size: 8031107
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:34:36Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
title: Optimizing Software-Defined Networks using Application-Layer Knowledge
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
  text: 'Many markets have seen a shift from the idea of buying and moved to leasing
    instead. Arguably, the latter has been the major catalyst for their success. Ten
    years ago, research realized this shift and initiated the study of "online leasing
    problems" by introducing leasing to online optimization problems. Resources required
    to provide a service in an "online leasing problem" are no more bought but leased
    for different durations. In this paper, we provide an overview of results that
    contribute to the understanding of "online resource leasing problems". '
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 Resource Leasing. In: <i>Proceedings
    of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ;
    2015:343-344. doi:<a href="https://doi.org/10.1145/2767386.2767454">10.1145/2767386.2767454</a>'
  apa: Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing.
    In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
    (PODC)</i> (pp. 343–344). <a href="https://doi.org/10.1145/2767386.2767454">https://doi.org/10.1145/2767386.2767454</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
    Leasing}, DOI={<a href="https://doi.org/10.1145/2767386.2767454">10.1145/2767386.2767454</a>},
    booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
    Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
    year={2015}, pages={343–344} }'
  chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
    Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed
    Computing (PODC)</i>, 343–44, 2015. <a href="https://doi.org/10.1145/2767386.2767454">https://doi.org/10.1145/2767386.2767454</a>.
  ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings
    of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015,
    pp. 343–344.
  mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
    <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
    (PODC)</i>, 2015, pp. 343–44, doi:<a href="https://doi.org/10.1145/2767386.2767454">10.1145/2767386.2767454</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
    on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:33:11Z
  date_updated: 2018-03-21T09:33:11Z
  file_id: '1478'
  file_name: 266-p343-markarian.pdf
  file_size: 679580
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
  (PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '268'
author:
- first_name: Alexander
  full_name: Lange, Alexander
  last_name: Lange
citation:
  ama: Lange A. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität
    Paderborn; 2015.
  apa: Lange, A. (2015). <i>Online Bewertungssysteme – Ein systematischer Überblick</i>.
    Universität Paderborn.
  bibtex: '@book{Lange_2015, title={Online Bewertungssysteme – Ein systematischer
    Überblick}, publisher={Universität Paderborn}, author={Lange, Alexander}, year={2015}
    }'
  chicago: Lange, Alexander. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>.
    Universität Paderborn, 2015.
  ieee: A. Lange, <i>Online Bewertungssysteme – Ein systematischer Überblick</i>.
    Universität Paderborn, 2015.
  mla: Lange, Alexander. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>.
    Universität Paderborn, 2015.
  short: A. Lange, Online Bewertungssysteme – Ein systematischer Überblick, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:28Z
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: Online Bewertungssysteme – Ein systematischer Überblick
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '320'
abstract:
- lang: eng
  text: 'We consider structural and algorithmic questions related to the Nash dynamics
    of weighted congestion games. In weighted congestion games with linear latency
    functions, the existence of pure Nash equilibria is guaranteed by a potential
    function argument. Unfortunately, this proof of existence is inefficient and computing
    pure Nash equilibria in such games is a PLS-hard problem even when all players
    have unit weights. The situation gets worse when superlinear (e.g., quadratic)
    latency functions come into play; in this case, the Nash dynamics of the game
    may contain cycles and pure Nash equilibria may not even exist. Given these obstacles,
    we consider approximate pure Nash equilibria as alternative solution concepts.
    A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game
    from which no player has any incentive to deviate in order to improve her cost
    by a multiplicative factor higher than ρ. Do such equilibria exist for small values
    of ρ? And if so, can we compute them efficiently?We provide positive answers to
    both questions for weighted congestion games with polynomial latency functions
    by exploiting an “approximation” of such games by a new class of potential games
    that we call Ψ-games. This allows us to show that these games have d!-approximate
    pure Nash equilibria, where d is the maximum degree of the latency functions.
    Our main technical contribution is an efficient algorithm for computing O(1)-approximate
    pure Nash equilibria when d is a constant. For games with linear latency functions,
    the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency
    functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial
    in the number of bits in the representation of the game and 1/γ. As a byproduct
    of our techniques, we also show the following interesting structural statement
    for weighted congestion games with polynomial latency functions of maximum degree
    d ≥ 2: polynomially-long sequences of best-response moves from any initial state
    to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified
    in such games as long as d is a constant.To the best of our knowledge, these are
    the first positive algorithmic results for approximate pure Nash equilibria in
    weighted congestion games. Our techniques significantly extend our recent work
    on unweighted congestion games through the use of Ψ-games. The concept of approximating
    nonpotential games by potential ones is interesting in itself and might have further
    applications.'
article_number: '2'
author:
- first_name: Ioannis
  full_name: Caragiannis, Ioannis
  last_name: Caragiannis
- first_name: Angelo
  full_name: Fanelli, Angelo
  last_name: Fanelli
- first_name: Nick
  full_name: Gravin, Nick
  last_name: Gravin
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria
    in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
    <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>'
  apa: 'Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate
    Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1).
    <a href="https://doi.org/10.1145/2614687">https://doi.org/10.1145/2614687</a>'
  bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure
    Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure}, volume={3}, DOI={<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>},
    number={12}, journal={Transactions on Economics and Computation}, publisher={ACM},
    author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik,
    Alexander}, year={2015} }'
  chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
    “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient
    Computation, and Structure.” <i>Transactions on Economics and Computation</i>
    3, no. 1 (2015). <a href="https://doi.org/10.1145/2614687">https://doi.org/10.1145/2614687</a>.'
  ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure
    Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
    and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no.
    1, 2015.'
  mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted
    Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions
    on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href="https://doi.org/10.1145/2614687">10.1145/2614687</a>.'
  short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics
    and Computation 3 (2015).
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2614687
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:40:55Z
  date_updated: 2018-03-20T07:40:55Z
  file_id: '1433'
  file_name: 320-a2-caragiannis.pdf
  file_size: 260503
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:40:55Z
has_accepted_license: '1'
intvolume: '         3'
issue: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Transactions on Economics and Computation
publisher: ACM
status: public
title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence,
  Efficient Computation, and Structure'
type: journal_article
user_id: '477'
volume: 3
year: '2015'
...
---
_id: '327'
abstract:
- lang: eng
  text: We consider the problem of resource discovery in distributed systems. In particular
    we give an algorithm, such that each node in a network discovers the address of
    any other node in the network. We model the knowledge of the nodes as a virtual
    overlay network given by a directed graph such that complete knowledge of all
    nodes corresponds to a complete graph in the overlay network. Although there are
    several solutions for resource discovery, our solution is the first that achieves
    worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n))
    or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower
    bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message
    complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>.
    2015:67-79. doi:<a href="https://doi.org/10.1016/j.tcs.2014.11.027">10.1016/j.tcs.2014.11.027</a>
  apa: Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic
    worst-case message complexity optimal solution for resource discovery. <i>Theoretical
    Computer Science</i>, 67–79. <a href="https://doi.org/10.1016/j.tcs.2014.11.027">https://doi.org/10.1016/j.tcs.2014.11.027</a>
  bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic
    worst-case message complexity optimal solution for resource discovery}, DOI={<a
    href="https://doi.org/10.1016/j.tcs.2014.11.027">10.1016/j.tcs.2014.11.027</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges,
    Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79}
    }'
  chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
    “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
    <i>Theoretical Computer Science</i>, 2015, 67–79. <a href="https://doi.org/10.1016/j.tcs.2014.11.027">https://doi.org/10.1016/j.tcs.2014.11.027</a>.
  ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case
    message complexity optimal solution for resource discovery,” <i>Theoretical Computer
    Science</i>, pp. 67–79, 2015.
  mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
    Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>,
    Elsevier, 2015, pp. 67–79, doi:<a href="https://doi.org/10.1016/j.tcs.2014.11.027">10.1016/j.tcs.2014.11.027</a>.
  short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science
    (2015) 67–79.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:08Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2014.11.027
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:38:02Z
  date_updated: 2018-03-20T07:38:02Z
  file_id: '1427'
  file_name: 327-KKS15-TOCS_01.pdf
  file_size: 398044
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:38:02Z
has_accepted_license: '1'
page: 67-79
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: A deterministic worst-case message complexity optimal solution for resource
  discovery
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3309'
author:
- first_name: Patrizia
  full_name: Fanasch, Patrizia
  last_name: Fanasch
citation:
  ama: Fanasch P. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn;
    2015.
  apa: Fanasch, P. (2015). <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn.
  bibtex: '@book{Fanasch_2015, title={Erfolg durch Persönlichkeit? Der Einfluss der
    Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg},
    publisher={Universität Paderborn}, author={Fanasch, Patrizia}, year={2015} }'
  chicago: Fanasch, Patrizia. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn,
    2015.
  ieee: P. Fanasch, <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn,
    2015.
  mla: Fanasch, Patrizia. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn,
    2015.
  short: P. Fanasch, Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit
    auf den Zusammenhang von Reputation und Unternehmenserfolg, Universität Paderborn,
    2015.
date_created: 2018-06-22T11:57:31Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den
  Zusammenhang von Reputation und Unternehmenserfolg
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '3310'
author:
- first_name: Gregor Paul
  full_name: Walczok, Gregor Paul
  last_name: Walczok
citation:
  ama: Walczok GP. <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>.
    Universität Paderborn; 2015.
  apa: Walczok, G. P. (2015). <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>.
    Universität Paderborn.
  bibtex: '@book{Walczok_2015, title={Die Veränderung des Mobilfunkmarktes durch die
    Discountanbieter}, publisher={Universität Paderborn}, author={Walczok, Gregor
    Paul}, year={2015} }'
  chicago: Walczok, Gregor Paul. <i>Die Veränderung des Mobilfunkmarktes durch die
    Discountanbieter</i>. Universität Paderborn, 2015.
  ieee: G. P. Walczok, <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>.
    Universität Paderborn, 2015.
  mla: Walczok, Gregor Paul. <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>.
    Universität Paderborn, 2015.
  short: G.P. Walczok, Die Veränderung des Mobilfunkmarktes durch die Discountanbieter,
    Universität Paderborn, 2015.
date_created: 2018-06-22T11:59:36Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: Die Veränderung des Mobilfunkmarktes durch die Discountanbieter
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '288'
abstract:
- lang: eng
  text: Experience goods are characterised by information asymmetry and a lack of
    ex ante knowledge of product quality, such that reliable external signals of quality
    are likely to be highly valued. Two potentially credible sources of such information
    are reviews from professional critics and ‘word of mouth’ from other consumers.
    This paper makes a direct comparison between the relative influences and interactions
    of reviews from both of these sources on the sales performance of video game software.
    In order to empirically estimate and separate the effects of the two signals,
    we analyze a sample of 1480 video games and their sales figures between 2004 and
    2010. We find evidence to suggest that even after taking steps to control for
    endogeneity, reviews from professional critics have a significantly positive influence
    on sales which outweighs that from consumer reviews. We also find evidence to
    suggest that reviews from professional critics also interact significantly with
    other signals of product quality. Consequently, we contend that professional critics
    adopt the role of an influencer, whereas word-of-mouth opinion acts more as a
    predictor of sales in the market for video games.
author:
- first_name: Joe
  full_name: Cox, Joe
  last_name: Cox
- first_name: Daniel
  full_name: Kaimann, Daniel
  id: '18949'
  last_name: Kaimann
citation:
  ama: Cox J, Kaimann D. How do reviews from professional critics interact with other
    signals of product quality? Evidence from the video game industry. <i>Journal
    of Consumer Behaviour</i>. 2015;14(6):366-377. doi:<a href="https://doi.org/10.1002/cb.1553">10.1002/cb.1553</a>
  apa: Cox, J., &#38; Kaimann, D. (2015). How do reviews from professional critics
    interact with other signals of product quality? Evidence from the video game industry.
    <i>Journal of Consumer Behaviour</i>, <i>14</i>(6), 366–377. <a href="https://doi.org/10.1002/cb.1553">https://doi.org/10.1002/cb.1553</a>
  bibtex: '@article{Cox_Kaimann_2015, title={How do reviews from professional critics
    interact with other signals of product quality? Evidence from the video game industry},
    volume={14}, DOI={<a href="https://doi.org/10.1002/cb.1553">10.1002/cb.1553</a>},
    number={6}, journal={Journal of Consumer Behaviour}, publisher={Wiley Online Library},
    author={Cox, Joe and Kaimann, Daniel}, year={2015}, pages={366–377} }'
  chicago: 'Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics
    Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.”
    <i>Journal of Consumer Behaviour</i> 14, no. 6 (2015): 366–77. <a href="https://doi.org/10.1002/cb.1553">https://doi.org/10.1002/cb.1553</a>.'
  ieee: J. Cox and D. Kaimann, “How do reviews from professional critics interact
    with other signals of product quality? Evidence from the video game industry,”
    <i>Journal of Consumer Behaviour</i>, vol. 14, no. 6, pp. 366–377, 2015.
  mla: Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact
    with Other Signals of Product Quality? Evidence from the Video Game Industry.”
    <i>Journal of Consumer Behaviour</i>, vol. 14, no. 6, Wiley Online Library, 2015,
    pp. 366–77, doi:<a href="https://doi.org/10.1002/cb.1553">10.1002/cb.1553</a>.
  short: J. Cox, D. Kaimann, Journal of Consumer Behaviour 14 (2015) 366–377.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:25Z
ddc:
- '040'
department:
- _id: '183'
doi: 10.1002/cb.1553
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:24:24Z
  date_updated: 2018-03-21T09:24:24Z
  file_id: '1467'
  file_name: 288-Cox_et_al-2015-Journal_of_Consumer_Behaviour.pdf
  file_size: 386704
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:24:24Z
has_accepted_license: '1'
intvolume: '        14'
issue: '6'
language:
- iso: eng
page: 366-377
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Journal of Consumer Behaviour
publisher: Wiley Online Library
status: public
title: How do reviews from professional critics interact with other signals of product
  quality? Evidence from the video game industry
type: journal_article
user_id: '18949'
volume: 14
year: '2015'
...
---
_id: '289'
abstract:
- lang: eng
  text: We examine the effect of the variance of consumer ratings on product pricing
    and sales using an analytical model, which considers goods that are characterized
    by experience attributes and informed search attributes (i.e., experience attributes
    that were transformed in search attributes by consumer ratings). For pure informed
    search goods, equilibrium price increases and demand decreases in variance. For
    pure experience goods, equilibrium price and demand decrease in variance. For
    hybrid goods with low total variance, equilibrium price and demand increase with
    an increasing relative share of variance caused by informed search attributes
    when the average rating and total variance of ratings are held constant. Hence,
    risk-averse consumers may prefer a more expensive good with a higher variance
    of ratings out of two similar goods with the same average rating. Moreover, our
    analytical model provides a theoretical foundation for the empirically observed
    j-shaped distribution of consumer ratings in electronic commerce.
author:
- first_name: Philipp
  full_name: Herrmann, Philipp
  last_name: Herrmann
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Steffen
  full_name: Zimmermann, Steffen
  last_name: Zimmermann
- first_name: Barry
  full_name: Nault, Barry
  last_name: Nault
citation:
  ama: 'Herrmann P, Kundisch D, Zimmermann S, Nault B. How do Different Sources of
    the Variance of Consumer Ratings Matter? In: <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth</i>. ; 2015.'
  apa: Herrmann, P., Kundisch, D., Zimmermann, S., &#38; Nault, B. (2015). How do
    Different Sources of the Variance of Consumer Ratings Matter? In <i>Proceedings
    of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>.
    Forth Worth, USA.
  bibtex: '@inproceedings{Herrmann_Kundisch_Zimmermann_Nault_2015, title={How do Different
    Sources of the Variance of Consumer Ratings Matter?}, booktitle={Proceedings of
    the 36th International Conference on Information Systems (ICIS), Fort Worth},
    author={Herrmann, Philipp and Kundisch, Dennis and Zimmermann, Steffen and Nault,
    Barry}, year={2015} }'
  chicago: Herrmann, Philipp, Dennis Kundisch, Steffen Zimmermann, and Barry Nault.
    “How Do Different Sources of the Variance of Consumer Ratings Matter?” In <i>Proceedings
    of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>,
    2015.
  ieee: P. Herrmann, D. Kundisch, S. Zimmermann, and B. Nault, “How do Different Sources
    of the Variance of Consumer Ratings Matter?,” in <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth</i>, Forth Worth, USA, 2015.
  mla: Herrmann, Philipp, et al. “How Do Different Sources of the Variance of Consumer
    Ratings Matter?” <i>Proceedings of the 36th International Conference on Information
    Systems (ICIS), Fort Worth</i>, 2015.
  short: 'P. Herrmann, D. Kundisch, S. Zimmermann, B. Nault, in: Proceedings of the
    36th International Conference on Information Systems (ICIS), Fort Worth, 2015.'
conference:
  location: Forth Worth, USA
  name: 36th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:40Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:22:36Z
  date_updated: 2018-03-21T09:22:36Z
  file_id: '1465'
  file_name: 289-How_do_Different_Sources_of_the_Variance_of_Consumer_Ratings_Matt.pdf
  file_size: 349683
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:22:36Z
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 36th International Conference on Information Systems
  (ICIS), Fort Worth
status: public
title: How do Different Sources of the Variance of Consumer Ratings Matter?
type: conference
user_id: '16205'
year: '2015'
...
---
_id: '292'
author:
- first_name: Christina
  full_name: Osburg, Christina
  last_name: Osburg
citation:
  ama: Osburg C. <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen</i>. Universität Paderborn; 2015.
  apa: Osburg, C. (2015). <i>Fusionen von gesetzlichen Krankenversicherungen zu den
    Effizienz- und Wechselwirkungen</i>. Universität Paderborn.
  bibtex: '@book{Osburg_2015, title={Fusionen von gesetzlichen Krankenversicherungen
    zu den Effizienz- und Wechselwirkungen}, publisher={Universität Paderborn}, author={Osburg,
    Christina}, year={2015} }'
  chicago: Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu
    den Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.
  ieee: C. Osburg, <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen</i>. Universität Paderborn, 2015.
  mla: Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu den
    Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.
  short: C. Osburg, Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz-
    und Wechselwirkungen, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '294'
author:
- first_name: GinaJoanna
  full_name: Materna, GinaJoanna
  last_name: Materna
citation:
  ama: Materna G. <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>.
    Universität Paderborn; 2015.
  apa: Materna, G. (2015). <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn.
  bibtex: '@book{Materna_2015, title={Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik}, publisher={Universität Paderborn}, author={Materna, GinaJoanna},
    year={2015} }'
  chicago: Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn, 2015.
  ieee: G. Materna, <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>.
    Universität Paderborn, 2015.
  mla: Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen
    Handelspolitik</i>. Universität Paderborn, 2015.
  short: G. Materna, Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:48Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '295'
author:
- first_name: Patricia
  full_name: Goronczewski, Patricia
  last_name: Goronczewski
citation:
  ama: Goronczewski P. <i>Fair Trade - An Economic Investigation of Benefits and Drawbacks</i>.
    Universität Paderborn; 2015.
  apa: Goronczewski, P. (2015). <i>Fair Trade - An economic investigation of benefits
    and drawbacks</i>. Universität Paderborn.
  bibtex: '@book{Goronczewski_2015, title={Fair Trade - An economic investigation
    of benefits and drawbacks}, publisher={Universität Paderborn}, author={Goronczewski,
    Patricia}, year={2015} }'
  chicago: Goronczewski, Patricia. <i>Fair Trade - An Economic Investigation of Benefits
    and Drawbacks</i>. Universität Paderborn, 2015.
  ieee: P. Goronczewski, <i>Fair Trade - An economic investigation of benefits and
    drawbacks</i>. Universität Paderborn, 2015.
  mla: Goronczewski, Patricia. <i>Fair Trade - An Economic Investigation of Benefits
    and Drawbacks</i>. Universität Paderborn, 2015.
  short: P. Goronczewski, Fair Trade - An Economic Investigation of Benefits and Drawbacks,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:49Z
date_updated: 2022-01-06T06:58:48Z
department:
- _id: '280'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Fair Trade - An economic investigation of benefits and drawbacks
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '298'
author:
- first_name: Dennis
  full_name: Plonka, Dennis
  last_name: Plonka
citation:
  ama: Plonka D. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn;
    2015.
  apa: Plonka, D. (2015). <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn.
  bibtex: '@book{Plonka_2015, title={Entwicklung von Ablösesummen und Gehälter in
    der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit},
    publisher={Universität Paderborn}, author={Plonka, Dennis}, year={2015} }'
  chicago: Plonka, Dennis. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn,
    2015.
  ieee: D. Plonka, <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn,
    2015.
  mla: Plonka, Dennis. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn,
    2015.
  short: D. Plonka, Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga
    - Salary Caps als mögliches Modell der Chancengleichheit, Universität Paderborn,
    2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:50Z
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: Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary
  Caps als mögliches Modell der Chancengleichheit
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '304'
author:
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
citation:
  ama: Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>.
    Universität Paderborn; 2015.
  apa: Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>.
    Universität Paderborn.
  bibtex: '@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological
    Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos,
    Andreas}, year={2015} }'
  chicago: Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>.
    Universität Paderborn, 2015.
  ieee: A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>.
    Universität Paderborn, 2015.
  mla: Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>.
    Universität Paderborn, 2015.
  short: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:53Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:46:19Z
  date_updated: 2018-03-20T07:46:19Z
  file_id: '1441'
  file_name: 304-Dissertation_-_Koutsopoulos.pdf
  file_size: 2275834
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:46:19Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject 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: Dynamics and Efficiency in Topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '305'
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
citation:
  ama: Kniesburges S. <i>Distributed Data Structures and the Power of Topological
    Self-Stabilization</i>. Universität Paderborn; 2015.
  apa: Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological
    Self-Stabilization</i>. Universität Paderborn.
  bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power
    of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges,
    Sebastian}, year={2015} }'
  chicago: Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of
    Topological Self-Stabilization</i>. Universität Paderborn, 2015.
  ieee: S. Kniesburges, <i>Distributed Data Structures and the Power of topological
    Self-Stabilization</i>. Universität Paderborn, 2015.
  mla: Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological
    Self-Stabilization</i>. Universität Paderborn, 2015.
  short: S. Kniesburges, Distributed Data Structures and the Power of Topological
    Self-Stabilization, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-13T09:14:43Z
  date_updated: 2018-03-13T09:14:43Z
  file_id: '1206'
  file_name: 305-Dissertation_-_Kniesburges.pdf
  file_size: 1709094
  relation: main_file
  success: 1
file_date_updated: 2018-03-13T09:14:43Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Distributed Data Structures and the Power of topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...