---
_id: '13148'
abstract:
- lang: eng
  text: This paper examines the evolutionary stability of behaviour in contests where
    players’ participation can be stochastic. We find, for exogenously given participation
    probabilities, players exert more effort under the concept of a finite-population
    evolutionarily stable strategy (FPESS) than under Nash equilibrium (NE). We show
    that there is ex-ante overdissipation under FPESS for sufficiently large participation
    probabilities, if, and only if, the impact function is convex. With costly endogenous
    entry, players enter the contest with a higher probability and exert more effort
    under FPESS than under NE. Importantly, under endogenous entry, overdissipation
    can occur for all (Tullock) contest success functions, in particular those with
    concave impact functions.
author:
- first_name: Yiquan
  full_name: Gu, Yiquan
  last_name: Gu
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
- first_name: Wolfgang
  full_name: Leininger, Wolfgang
  last_name: Leininger
citation:
  ama: 'Gu Y, Hehenkamp B, Leininger W. Evolutionary equilibrium in contests with
    stochastic participation: Entry, effort and overdissipation. <i>Journal of Economic
    Behavior &#38; Organization</i>. 2019:469-485. doi:<a href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>'
  apa: 'Gu, Y., Hehenkamp, B., &#38; Leininger, W. (2019). Evolutionary equilibrium
    in contests with stochastic participation: Entry, effort and overdissipation.
    <i>Journal of Economic Behavior &#38; Organization</i>, 469–485. <a href="https://doi.org/10.1016/j.jebo.2019.06.011">https://doi.org/10.1016/j.jebo.2019.06.011</a>'
  bibtex: '@article{Gu_Hehenkamp_Leininger_2019, title={Evolutionary equilibrium in
    contests with stochastic participation: Entry, effort and overdissipation}, DOI={<a
    href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>},
    journal={Journal of Economic Behavior &#38; Organization}, author={Gu, Yiquan
    and Hehenkamp, Burkhard and Leininger, Wolfgang}, year={2019}, pages={469–485}
    }'
  chicago: 'Gu, Yiquan, Burkhard Hehenkamp, and Wolfgang Leininger. “Evolutionary
    Equilibrium in Contests with Stochastic Participation: Entry, Effort and Overdissipation.”
    <i>Journal of Economic Behavior &#38; Organization</i>, 2019, 469–85. <a href="https://doi.org/10.1016/j.jebo.2019.06.011">https://doi.org/10.1016/j.jebo.2019.06.011</a>.'
  ieee: 'Y. Gu, B. Hehenkamp, and W. Leininger, “Evolutionary equilibrium in contests
    with stochastic participation: Entry, effort and overdissipation,” <i>Journal
    of Economic Behavior &#38; Organization</i>, pp. 469–485, 2019.'
  mla: 'Gu, Yiquan, et al. “Evolutionary Equilibrium in Contests with Stochastic Participation:
    Entry, Effort and Overdissipation.” <i>Journal of Economic Behavior &#38; Organization</i>,
    2019, pp. 469–85, doi:<a href="https://doi.org/10.1016/j.jebo.2019.06.011">10.1016/j.jebo.2019.06.011</a>.'
  short: Y. Gu, B. Hehenkamp, W. Leininger, Journal of Economic Behavior &#38; Organization
    (2019) 469–485.
date_created: 2019-09-06T09:28:46Z
date_updated: 2022-01-06T06:51:29Z
department:
- _id: '280'
doi: 10.1016/j.jebo.2019.06.011
language:
- iso: eng
page: 469-485
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Journal of Economic Behavior & Organization
publication_identifier:
  issn:
  - 0167-2681
publication_status: published
status: public
title: 'Evolutionary equilibrium in contests with stochastic participation: Entry,
  effort and overdissipation'
type: journal_article
user_id: '37953'
year: '2019'
...
---
_id: '13182'
abstract:
- lang: eng
  text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe
    problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers
    (called \\emph{clients} in this paper) that want to send messages to a fixed common
    peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in
    V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity
    of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages
    per round and excess messages are dropped.\r\nThe server can modify these probabilities
    when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
    p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
    \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
    \  \r\nOur protocol lets the system converge from \\emph{any} initial state to
    a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)|
    \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
    rounds in expectation.\r\nIn particular, the initial client probabilities and
    server variables are not necessarily well-defined, i.e., they may have arbitrary
    values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
    is length of node identifiers, making it very lightweight.\r\nFinally we state
    a lower bound on the convergence time an see that our protocol performs asymptotically
    optimal (up to some polylogarithmic factor).\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for
    Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the
    21st International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164.
    doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>'
  apa: Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing
    Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>
  bibtex: '@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in
    Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion
    Control with Logarithmic Memory}, DOI={<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>},
    booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
    Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164},
    collection={Lecture Notes in Computer Science} }'
  chicago: Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely
    Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”
    In <i>Proceedings of the 21st International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer
    Science. Springer, Cham, 2019. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol
    for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>, 2019, pp. 149–164.
  mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized
    Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>,
    Springer, Cham, 2019, pp. 149–64, doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  short: 'M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    Springer, Cham, 2019, pp. 149–164.'
date_created: 2019-09-10T12:48:33Z
date_updated: 2022-01-06T06:51:30Z
ddc:
- '000'
department:
- _id: '79'
doi: https://doi.org/10.1007/978-3-030-34992-9_13
external_id:
  arxiv:
  - '1909.04544'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2019-09-11T11:20:16Z
  date_updated: 2019-09-11T11:20:16Z
  file_id: '13188'
  file_name: main.pdf
  file_size: 428908
  relation: main_file
  success: 1
file_date_updated: 2019-09-11T11:20:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 149-164
project:
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '1'
  name: SFB 901
publication: Proceedings of the 21st International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control with
  Logarithmic Memory
type: conference
user_id: '23538'
year: '2019'
...
---
_id: '13292'
abstract:
- lang: eng
  text: "Building on 5G and network function virtualization (NFV), smart manufacturing
    has the potential to drastically increase productivity, reduce cost, and introduce
    novel, flexible manufacturing services. Current work mostly focuses on high-level
    scenarios or emulation-based prototype deployments. \r\n\r\nExtending our previous
    work, we showcase one of the first cloud-native 5G verticals focusing on the deployment
    of smart manufacturing use cases on production infrastructure. In particular,
    we use the 5GTANGO service platform to deploy our developed network services on
    Kubernetes. For this demo, we implemented a series of cloud-native virtualized
    network functions (VNFs) and created suitable service descriptors. Their light-weight,
    stateless deployment on Kubernetes enables quick instantiation, scalability, and
    robustness."
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Kai
  full_name: Hannemann, Kai
  last_name: Hannemann
- first_name: Daniel
  full_name: Behnke, Daniel
  last_name: Behnke
- first_name: Marcel
  full_name: Müller, Marcel
  last_name: Müller
- first_name: Patrick-Benjamin
  full_name: Bök, Patrick-Benjamin
  last_name: Bök
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Schneider SB, Peuster M, Hannemann K, et al. “Producing Cloud-Native”: Smart
    Manufacturing Use Cases on Kubernetes. In: <i>IEEE Conference on Network Function
    Virtualization and Software Defined Networks (NFV-SDN) Demo Track</i>. Dallas,
    TX, USA: IEEE; 2019.'
  apa: 'Schneider, S. B., Peuster, M., Hannemann, K., Behnke, D., Müller, M., Bök,
    P.-B., &#38; Karl, H. (2019). “Producing Cloud-Native”: Smart Manufacturing Use
    Cases on Kubernetes. In <i>IEEE Conference on Network Function Virtualization
    and Software Defined Networks (NFV-SDN) Demo Track</i>. Dallas, TX, USA: IEEE.'
  bibtex: '@inproceedings{Schneider_Peuster_Hannemann_Behnke_Müller_Bök_Karl_2019,
    place={Dallas, TX, USA}, title={“Producing Cloud-Native”: Smart Manufacturing
    Use Cases on Kubernetes}, booktitle={IEEE Conference on Network Function Virtualization
    and Software Defined Networks (NFV-SDN) Demo Track}, publisher={IEEE}, author={Schneider,
    Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and
    Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}, year={2019} }'
  chicago: 'Schneider, Stefan Balthasar, Manuel Peuster, Kai Hannemann, Daniel Behnke,
    Marcel Müller, Patrick-Benjamin Bök, and Holger Karl. “‘Producing Cloud-Native’:
    Smart Manufacturing Use Cases on Kubernetes.” In <i>IEEE Conference on Network
    Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track</i>.
    Dallas, TX, USA: IEEE, 2019.'
  ieee: 'S. B. Schneider <i>et al.</i>, “‘Producing Cloud-Native’: Smart Manufacturing
    Use Cases on Kubernetes,” in <i>IEEE Conference on Network Function Virtualization
    and Software Defined Networks (NFV-SDN) Demo Track</i>, Dallas, TX, USA, 2019.'
  mla: 'Schneider, Stefan Balthasar, et al. “‘Producing Cloud-Native’: Smart Manufacturing
    Use Cases on Kubernetes.” <i>IEEE Conference on Network Function Virtualization
    and Software Defined Networks (NFV-SDN) Demo Track</i>, IEEE, 2019.'
  short: 'S.B. Schneider, M. Peuster, K. Hannemann, D. Behnke, M. Müller, P.-B. Bök,
    H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined
    Networks (NFV-SDN) Demo Track, IEEE, Dallas, TX, USA, 2019.'
conference:
  location: Dallas, TX, USA
  name: 2019 IEEE Conference on Network Function Virtualization and Software Defined
    Networks (NFV-SDN) Demo Track
date_created: 2019-09-19T07:17:46Z
date_updated: 2022-01-06T06:51:32Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2019-09-19T07:17:41Z
  date_updated: 2019-09-19T07:17:41Z
  file_id: '13293'
  file_name: preprint_ris.pdf
  file_size: 182136
  relation: main_file
file_date_updated: 2019-09-19T07:17:41Z
has_accepted_license: '1'
keyword:
- 5G
- NFV
- Smart Manufacturing
- Cloud-Native
- Kubernetes
language:
- iso: eng
oa: '1'
place: Dallas, TX, USA
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
publication: IEEE Conference on Network Function Virtualization and Software Defined
  Networks (NFV-SDN) Demo Track
publisher: IEEE
status: public
title: '"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes'
type: conference
user_id: '35343'
year: '2019'
...
---
_id: '13435'
author:
- first_name: Edwin
  full_name: Friesen, Edwin
  last_name: Friesen
citation:
  ama: 'Friesen E. <i>Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>.
    Universität Paderborn; 2019.'
  apa: 'Friesen, E. (2019). <i>Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>.
    Universität Paderborn.'
  bibtex: '@book{Friesen_2019, title={Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis},
    publisher={Universität Paderborn}, author={Friesen, Edwin}, year={2019} }'
  chicago: 'Friesen, Edwin. <i>Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>.
    Universität Paderborn, 2019.'
  ieee: 'E. Friesen, <i>Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>.
    Universität Paderborn, 2019.'
  mla: 'Friesen, Edwin. <i>Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>.
    Universität Paderborn, 2019.'
  short: 'E. Friesen, Requirements Engineering im OTF-Computing: Informationsextraktion
    und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis, Universität
    Paderborn, 2019.'
date_created: 2019-09-20T14:58:49Z
date_updated: 2022-01-06T06:51:36Z
department:
- _id: '36'
- _id: '1'
- _id: '579'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Michaela
  full_name: Geierhos, Michaela
  id: '42496'
  last_name: Geierhos
  orcid: 0000-0002-8180-5606
title: 'Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation
  mittels domänenspezifischer Wissensbasis'
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '10093'
author:
- first_name: Dirk
  full_name: Beyer, Dirk
  last_name: Beyer
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Thomas
  full_name: Lemberger, Thomas
  last_name: Lemberger
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional
    Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S,
    eds. <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
    Germany, February 18-22, 2019</i>. Vol P-292. LNI. GI; 2019:151--152. doi:<a href="https://doi.org/10.18420/se2019-46">10.18420/se2019-46</a>'
  apa: Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2019). Combining
    Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic,
    G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management
    (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i> (Vol. P-292, pp. 151--152).
    GI. <a href="https://doi.org/10.18420/se2019-46">https://doi.org/10.18420/se2019-46</a>
  bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining
    Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={<a
    href="https://doi.org/10.18420/se2019-46">10.18420/se2019-46</a>}, booktitle={Software
    Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
    18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine
    and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic,
    Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152},
    collection={LNI} }'
  chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim.
    “Combining Verifiers in Conditional Model Checking via Reducers.” In <i>Software
    Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February
    18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and
    Stefan Wagner, P-292:151--152. LNI. GI, 2019. <a href="https://doi.org/10.18420/se2019-46">https://doi.org/10.18420/se2019-46</a>.
  ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers
    in Conditional Model Checking via Reducers,” in <i>Software Engineering and Software
    Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, 2019,
    vol. P-292, pp. 151--152.
  mla: Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via
    Reducers.” <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
    Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. P-292,
    GI, 2019, pp. 151--152, doi:<a href="https://doi.org/10.18420/se2019-46">10.18420/se2019-46</a>.
  short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic,
    G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM
    2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.'
date_created: 2019-06-03T08:08:39Z
date_updated: 2022-01-06T06:50:28Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.18420/se2019-46
editor:
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Ivan
  full_name: Bogicevic, Ivan
  last_name: Bogicevic
- first_name: Georg
  full_name: Herzwurm, Georg
  last_name: Herzwurm
- first_name: Stefan
  full_name: Wagner, Stefan
  last_name: Wagner
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T09:31:55Z
  date_updated: 2019-08-26T09:31:55Z
  file_id: '12956'
  file_name: 46.pdf
  file_size: 472426
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T09:31:55Z
has_accepted_license: '1'
language:
- iso: eng
page: 151--152
project:
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
publication: Software Engineering and Software Management (SE/SWM 2019), Stuttgart,
  Germany, February 18-22, 2019
publisher: GI
series_title: LNI
status: public
title: Combining Verifiers in Conditional Model Checking via Reducers
type: conference
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '10095'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers
    - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds.
    <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years
    of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
    April 6-11, 2019, Proceedings, Part {III}</i>. Vol 11429. Lecture Notes in Computer
    Science. Springer; 2019:229-233. doi:<a href="https://doi.org/10.1007/978-3-030-17502-3_19">10.1007/978-3-030-17502-3_19</a>'
  apa: 'Richter, C., &#38; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations
    of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon,
    &#38; B. Steffen (Eds.), <i>Tools and Algorithms for the Construction and Analysis
    of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague,
    Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i> (Vol. 11429, pp.
    229–233). Springer. <a href="https://doi.org/10.1007/978-3-030-17502-3_19">https://doi.org/10.1007/978-3-030-17502-3_19</a>'
  bibtex: '@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer
    Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition
    Contribution)}, volume={11429}, DOI={<a href="https://doi.org/10.1007/978-3-030-17502-3_19">10.1007/978-3-030-17502-3_19</a>},
    booktitle={Tools and Algorithms for the Construction and Analysis of Systems -
    25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
    April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter,
    Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon,
    Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
    of Verifiers - (Competition Contribution).” In <i>Tools and Algorithms for the
    Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as
    Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part
    {III}</i>, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard
    Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. <a href="https://doi.org/10.1007/978-3-030-17502-3_19">https://doi.org/10.1007/978-3-030-17502-3_19</a>.'
  ieee: 'C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of
    Verifiers - (Competition Contribution),” in <i>Tools and Algorithms for the Construction
    and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
    2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, 2019,
    vol. 11429, pp. 229–233.'
  mla: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations
    of Verifiers - (Competition Contribution).” <i>Tools and Algorithms for the Construction
    and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS}
    2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited
    by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:<a href="https://doi.org/10.1007/978-3-030-17502-3_19">10.1007/978-3-030-17502-3_19</a>.'
  short: 'C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen
    (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25
    Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
    April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.'
date_created: 2019-06-03T08:12:55Z
date_updated: 2022-01-06T06:50:29Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1007/978-3-030-17502-3_19
editor:
- first_name: Dirk
  full_name: Beyer, Dirk
  last_name: Beyer
- first_name: Marieke
  full_name: Huisman, Marieke
  last_name: Huisman
- first_name: Fabrice
  full_name: Kordon, Fabrice
  last_name: Kordon
- first_name: Bernhard
  full_name: Steffen, Bernhard
  last_name: Steffen
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:01:00Z
  date_updated: 2019-08-26T11:01:00Z
  file_id: '12961'
  file_name: PeSCo.pdf
  file_size: 254772
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:01:00Z
has_accepted_license: '1'
intvolume: '     11429'
language:
- iso: eng
page: 229-233
project:
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
publication: Tools and Algorithms for the Construction and Analysis of Systems - 25
  Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic,
  April 6-11, 2019, Proceedings, Part {III}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)'
type: conference
user_id: '29719'
volume: 11429
year: '2019'
...
---
_id: '10105'
author:
- first_name: Jan
  full_name: Haltermann, Jan
  last_name: Haltermann
citation:
  ama: Haltermann J. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn;
    2019.
  apa: Haltermann, J. (2019). <i>Analyzing Data Usage in Array Programs</i>. Universität
    Paderborn.
  bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs},
    publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }'
  chicago: Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität
    Paderborn, 2019.
  ieee: J. Haltermann, <i>Analyzing Data Usage in Array Programs</i>. Universität
    Paderborn, 2019.
  mla: Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität
    Paderborn, 2019.
  short: J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn,
    2019.
date_created: 2019-06-04T10:54:08Z
date_updated: 2022-01-06T06:50:29Z
department:
- _id: '7'
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '11'
  name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Analyzing Data Usage in Array Programs
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10232'
abstract:
- lang: eng
  text: Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn,
    and more recently ML-Plan, have shown impressive results for the tasks of single-label
    classification and regression. Yet, there is only little work on other types of
    machine learning problems so far. In particular, there is almost no work on automating
    the engineering of machine learning solutions for multi-label classification (MLC).
    We show how the scope of ML-Plan, an AutoML-tool for multi-class classification,
    can be extended towards MLC using MEKA, which is a multi-label extension of the
    well-known Java library WEKA. The resulting approach recursively refines MEKA's
    multi-label classifiers, nesting other multi-label classifiers for meta algorithms
    and single-label classifiers provided by WEKA as base learners. In our evaluation,
    we find that the proposed approach yields strong results and performs significantly
    better than a set of baselines we compare with.
author:
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Alexander
  full_name: Tornede, Alexander
  id: '38209'
  last_name: Tornede
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification
    Extending ML-Plan. In: ; 2019.'
  apa: Wever, M. D., Mohr, F., Tornede, A., &#38; Hüllermeier, E. (2019). Automating
    Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop
    on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.
  bibtex: '@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label
    Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix
    and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }'
  chicago: Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier.
    “Automating Multi-Label Classification Extending ML-Plan,” 2019.
  ieee: M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label
    Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated
    Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019.
  mla: Wever, Marcel Dominik, et al. <i>Automating Multi-Label Classification Extending
    ML-Plan</i>. 2019.
  short: 'M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.'
conference:
  end_date: 2019-06-15
  location: Long Beach, CA, USA
  name: 6th ICML Workshop on Automated Machine Learning (AutoML 2019)
  start_date: 2019-06-09
date_created: 2019-06-11T21:33:06Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '006'
department:
- _id: '355'
file:
- access_level: open_access
  content_type: application/pdf
  creator: wever
  date_created: 2019-09-10T08:19:01Z
  date_updated: 2019-09-10T08:20:44Z
  file_id: '13177'
  file_name: Automating_MultiLabel_Classification_Extending_ML-Plan.pdf
  file_size: 388191
  relation: main_file
file_date_updated: 2019-09-10T08:20:44Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: Automating Multi-Label Classification Extending ML-Plan
type: conference
user_id: '33176'
year: '2019'
...
---
_id: '10271'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn; 2019.
  apa: N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn.
  bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
    Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
    N.}, year={2019} }'
  chicago: N., N. <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  ieee: N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  mla: N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _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: Implementation and Evaluation of Authenticated Data Structures Using Intel
  SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '10277'
author:
- first_name: Steffen
  full_name: Althaus, Steffen
  last_name: Althaus
citation:
  ama: Althaus S. <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn; 2019.
  apa: Althaus, S. (2019). <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn.
  bibtex: '@book{Althaus_2019, place={Universität Paderborn}, title={Optimizing Sales
    Channel Performance with Digital Experiments in the Crafting Industry}, author={Althaus,
    Steffen}, year={2019} }'
  chicago: Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital
    Experiments in the Crafting Industry</i>. Universität Paderborn, 2019.
  ieee: S. Althaus, <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. Universität Paderborn, 2019.
  mla: Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry</i>. 2019.
  short: S. Althaus, Optimizing Sales Channel Performance with Digital Experiments
    in the Crafting Industry, Universität Paderborn, 2019.
date_created: 2019-06-19T14:59:00Z
date_updated: 2022-01-06T06:50:33Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: Optimizing Sales Channel Performance with Digital Experiments in the Crafting
  Industry
type: mastersthesis
user_id: '16205'
year: '2019'
...
---
_id: '10281'
abstract:
- lang: eng
  text: 'Competing firms tend to select similar locations for their stores. This phenomenon,
    called the principle of minimum differentiation, was captured by Hotelling with
    a landmark model of spatial competition but is still the object of an ongoing
    scientific debate. Although consistently observed in practice, many more realistic
    variants of Hotelling''s model fail to support minimum differentiation or do not
    have pure equilibria at all. In particular, it was recently proven for a generalized
    model which incorporates negative network externalities and which contains Hotelling''s
    model and classical selfish load balancing as special cases, that the unique equilibria
    do not adhere to minimum differentiation. Furthermore, it was shown that for a
    significant parameter range pure equilibria do not exist. We derive a sharp contrast
    to these previous results by investigating Hotelling''s model with negative network
    externalities from an entirely new angle: approximate pure subgame perfect equilibria.
    This approach allows us to prove analytically and via agent-based simulations
    that approximate equilibria having good approximation guarantees and that adhere
    to minimum differentiation exist for the full parameter range of the model. Moreover,
    we show that the obtained approximate equilibria have high social welfare.'
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: 'Pascal '
  full_name: 'Lenzner, Pascal '
  last_name: Lenzner
- first_name: Louise
  full_name: Molitor, Louise
  last_name: Molitor
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Feldotto M, Lenzner P, Molitor L, Skopalik A.  From Hotelling to Load Balancing:
    Approximation and the Principle of Minimum Differentiation. In: <i>Proceedings
    of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>.
    International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.'
  apa: 'Feldotto, M., Lenzner, P., Molitor, L., &#38; Skopalik, A. (2019).  From Hotelling
    to Load Balancing: Approximation and the Principle of Minimum Differentiation.
    In <i>Proceedings of the 18th International Conference on Autonomous Agents and
    MultiAgent Systems</i> (pp. 1949--1951). Montreal QC, Canada: International Foundation
    for Autonomous Agents and Multiagent Systems.'
  bibtex: '@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling
    to Load Balancing: Approximation and the Principle of Minimum Differentiation},
    booktitle={Proceedings of the 18th International Conference on Autonomous Agents
    and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents
    and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal  and Molitor,
    Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }'
  chicago: 'Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik.
    “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum
    Differentiation.” In <i>Proceedings of the 18th International Conference on Autonomous
    Agents and MultiAgent Systems</i>, 1949--1951. International Foundation for Autonomous
    Agents and Multiagent Systems, 2019.'
  ieee: 'M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to
    Load Balancing: Approximation and the Principle of Minimum Differentiation,” in
    <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent
    Systems</i>, Montreal QC, Canada, 2019, pp. 1949--1951.'
  mla: 'Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation
    and the Principle of Minimum Differentiation.” <i>Proceedings of the 18th International
    Conference on Autonomous Agents and MultiAgent Systems</i>, International Foundation
    for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
  short: 'M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the
    18th International Conference on Autonomous Agents and MultiAgent Systems, International
    Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
conference:
  location: Montreal QC, Canada
  name: 18th International Conference on Autonomous Agents and MultiAgent Systems
date_created: 2019-06-20T14:46:08Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '004'
department:
- _id: '541'
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:10:02Z
  date_updated: 2019-08-26T11:10:02Z
  file_id: '12962'
  file_name: 1903.04265.pdf
  file_size: 698599
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:10:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=3331973
page: 1949--1951
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Proceedings of the 18th International Conference on Autonomous Agents
  and MultiAgent Systems
publication_status: published
publisher: International Foundation for Autonomous Agents and Multiagent Systems
status: public
title: ' From Hotelling to Load Balancing: Approximation and the Principle of Minimum
  Differentiation'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10290'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: Gutt D. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität
    Paderborn; 2019. doi:<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>
  apa: Gutt, D. (2019). <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-688">https://doi.org/10.17619/UNIPB/1-688</a>
  bibtex: '@book{Gutt_2019, place={Universität Paderborn}, title={Essays on Drivers
    and Economic Outcomes of Online-Reviews}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>},
    author={Gutt, Dominik}, year={2019} }'
  chicago: Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn, 2019. <a href="https://doi.org/10.17619/UNIPB/1-688">https://doi.org/10.17619/UNIPB/1-688</a>.
  ieee: D. Gutt, <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    Universität Paderborn, 2019.
  mla: Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>.
    2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-688">10.17619/UNIPB/1-688</a>.
  short: D. Gutt, Essays on Drivers and Economic Outcomes of Online-Reviews, Universität
    Paderborn, 2019.
date_created: 2019-06-25T09:43:55Z
date_updated: 2022-01-06T06:50:35Z
ddc:
- '330'
department:
- _id: '276'
doi: 10.17619/UNIPB/1-688
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-07-16T10:58:09Z
  date_updated: 2019-07-16T10:58:09Z
  file_id: '11960'
  file_name: DissertationGutt.pdf
  file_size: 1149237
  relation: main_file
  success: 1
file_date_updated: 2019-07-16T10:58:09Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: Essays on Drivers and Economic Outcomes of Online-Reviews
type: dissertation
user_id: '15504'
year: '2019'
...
---
_id: '10325'
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Michael
  full_name: Marchetti, Michael
  last_name: Marchetti
- first_name: Gerardo
  full_name: García de Blas, Gerardo
  last_name: García de Blas
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Peuster M, Marchetti M, García de Blas G, Karl H. Automated testing of NFV
    orchestrators against carrier-grade multi-PoP scenarios using emulation-based
    smoke testing. <i>EURASIP Journal on Wireless Communications and Networking</i>.
    2019. doi:<a href="https://doi.org/10.1186/s13638-019-1493-2">10.1186/s13638-019-1493-2</a>
  apa: Peuster, M., Marchetti, M., García de Blas, G., &#38; Karl, H. (2019). Automated
    testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
    smoke testing. <i>EURASIP Journal on Wireless Communications and Networking</i>.
    <a href="https://doi.org/10.1186/s13638-019-1493-2">https://doi.org/10.1186/s13638-019-1493-2</a>
  bibtex: '@article{Peuster_Marchetti_García de Blas_Karl_2019, title={Automated testing
    of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
    smoke testing}, DOI={<a href="https://doi.org/10.1186/s13638-019-1493-2">10.1186/s13638-019-1493-2</a>},
    journal={EURASIP Journal on Wireless Communications and Networking}, publisher={Springer},
    author={Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and
    Karl, Holger}, year={2019} }'
  chicago: Peuster, Manuel, Michael Marchetti, Gerardo García de Blas, and Holger
    Karl. “Automated Testing of NFV Orchestrators against Carrier-Grade Multi-PoP
    Scenarios Using Emulation-Based Smoke Testing.” <i>EURASIP Journal on Wireless
    Communications and Networking</i>, 2019. <a href="https://doi.org/10.1186/s13638-019-1493-2">https://doi.org/10.1186/s13638-019-1493-2</a>.
  ieee: M. Peuster, M. Marchetti, G. García de Blas, and H. Karl, “Automated testing
    of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based
    smoke testing,” <i>EURASIP Journal on Wireless Communications and Networking</i>,
    2019.
  mla: Peuster, Manuel, et al. “Automated Testing of NFV Orchestrators against Carrier-Grade
    Multi-PoP Scenarios Using Emulation-Based Smoke Testing.” <i>EURASIP Journal on
    Wireless Communications and Networking</i>, Springer, 2019, doi:<a href="https://doi.org/10.1186/s13638-019-1493-2">10.1186/s13638-019-1493-2</a>.
  short: M. Peuster, M. Marchetti, G. García de Blas, H. Karl, EURASIP Journal on
    Wireless Communications and Networking (2019).
date_created: 2019-06-27T06:42:38Z
date_updated: 2022-01-06T06:50:37Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1186/s13638-019-1493-2
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:13:00Z
  date_updated: 2019-08-26T11:13:00Z
  file_id: '12963'
  file_name: s13638-019-1493-2.pdf
  file_size: 1750901
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:13:00Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://jwcn-eurasipjournals.springeropen.com/articles/10.1186/s13638-019-1493-2
oa: '1'
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: EURASIP Journal on Wireless Communications and Networking
publication_identifier:
  issn:
  - 1687-1499
publication_status: published
publisher: Springer
status: public
title: Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios
  using emulation-based smoke testing
type: journal_article
user_id: '477'
year: '2019'
...
---
_id: '10332'
abstract:
- lang: eng
  text: We analyze the incentives for retail bundling and the welfare effects of retail
    bundling in a decentralized distribution channel with two retailers and two monopolistic
    manufacturers. One manufacturer exclusively sells his good to one retailer, whereas
    the other manufacturer sells his good to both retailers. Thus, one retailer is
    a monopolist for one product but competes with the other retailer in the second
    product market. The two-product retailer has the option to bundle his goods or
    to sell them separately. We find that bundling aggravates the double marginalization
    problem for the bundling retailer. Nevertheless, when the retailers compete in
    prices, bundling can be more profitable than separate selling for the retailer
    as bundling softens the retail competition. The ultimate outcome depends on the
    manufacturers’ marginal costs. Given retail quantity competition, however, bundling
    is in no case the retailer’s best strategy. Furthermore, we show that profitable
    bundling reduces consumer and producer surplus in the equilibrium.
author:
- first_name: Joachim Maria Josef
  full_name: Heinzel, Joachim Maria Josef
  id: '53445'
  last_name: Heinzel
citation:
  ama: 'Heinzel JMJ. <i>Bundling in a Distribution Channel with Retail Competition</i>.
    Paderborn University: CIE Working Paper Series; 2019.'
  apa: 'Heinzel, J. M. J. (2019). <i>Bundling in a Distribution Channel with Retail
    Competition</i>. Paderborn University: CIE Working Paper Series.'
  bibtex: '@book{Heinzel_2019, place={Paderborn University}, title={Bundling in a
    Distribution Channel with Retail Competition}, publisher={CIE Working Paper Series},
    author={Heinzel, Joachim Maria Josef}, year={2019} }'
  chicago: 'Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with
    Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.'
  ieee: 'J. M. J. Heinzel, <i>Bundling in a Distribution Channel with Retail Competition</i>.
    Paderborn University: CIE Working Paper Series, 2019.'
  mla: Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail
    Competition</i>. CIE Working Paper Series, 2019.
  short: J.M.J. Heinzel, Bundling in a Distribution Channel with Retail Competition,
    CIE Working Paper Series, Paderborn University, 2019.
date_created: 2019-06-28T08:42:49Z
date_updated: 2022-01-06T06:50:37Z
ddc:
- '330'
department:
- _id: '280'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: jheinzel
  date_created: 2019-06-28T08:44:52Z
  date_updated: 2019-06-28T08:44:52Z
  file_id: '10333'
  file_name: WP120.pdf
  file_size: 375054
  relation: main_file
  success: 1
file_date_updated: 2019-06-28T08:44:52Z
has_accepted_license: '1'
keyword:
- retail bundling
- leverage theory
- double marginalization
language:
- iso: eng
place: Paderborn University
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series
status: public
title: Bundling in a Distribution Channel with Retail Competition
type: report
user_id: '53445'
year: '2019'
...
---
_id: '10344'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  last_name: Pukrop
citation:
  ama: Pukrop S. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn; 2019.
  apa: Pukrop, S. (2019). <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn.
  bibtex: '@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs
    with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop,
    Simon}, year={2019} }'
  chicago: Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn, 2019.
  ieee: S. Pukrop, <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn, 2019.
  mla: Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn, 2019.
  short: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine, Universität Paderborn, 2019.
date_created: 2019-07-04T07:21:19Z
date_updated: 2022-01-06T06:50:37Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13586'
author:
- first_name: Janina
  full_name: Seutter, Janina
  id: '64464'
  last_name: Seutter
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
citation:
  ama: 'Seutter J, Neumann J. Head over Feels? Differences in Online Rating Behavior
    for Utilitarian and Hedonic Service Aspects. In: <i>Proceedings of the 40th International
    Conference on Information Systems (ICIS)</i>. ; 2019.'
  apa: Seutter, J., &#38; Neumann, J. (2019). Head over Feels? Differences in Online
    Rating Behavior for Utilitarian and Hedonic Service Aspects. In <i>Proceedings
    of the 40th International Conference on Information Systems (ICIS)</i>. Munich,
    Germany.
  bibtex: '@inproceedings{Seutter_Neumann_2019, title={Head over Feels? Differences
    in Online Rating Behavior for Utilitarian and Hedonic Service Aspects}, booktitle={Proceedings
    of the 40th International Conference on Information Systems (ICIS)}, author={Seutter,
    Janina and Neumann, Jürgen}, year={2019} }'
  chicago: Seutter, Janina, and Jürgen Neumann. “Head over Feels? Differences in Online
    Rating Behavior for Utilitarian and Hedonic Service Aspects.” In <i>Proceedings
    of the 40th International Conference on Information Systems (ICIS)</i>, 2019.
  ieee: J. Seutter and J. Neumann, “Head over Feels? Differences in Online Rating
    Behavior for Utilitarian and Hedonic Service Aspects,” in <i>Proceedings of the
    40th International Conference on Information Systems (ICIS)</i>, Munich, Germany,
    2019.
  mla: Seutter, Janina, and Jürgen Neumann. “Head over Feels? Differences in Online
    Rating Behavior for Utilitarian and Hedonic Service Aspects.” <i>Proceedings of
    the 40th International Conference on Information Systems (ICIS)</i>, 2019.
  short: 'J. Seutter, J. Neumann, in: Proceedings of the 40th International Conference
    on Information Systems (ICIS), 2019.'
conference:
  location: Munich, Germany
  name: '40th International Conference on Information Systems (ICIS), '
date_created: 2019-10-02T10:09:05Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Proceedings of the 40th International Conference on Information Systems
  (ICIS)
status: public
title: Head over Feels? Differences in Online Rating Behavior for Utilitarian and
  Hedonic Service Aspects
type: conference_abstract
user_id: '16205'
year: '2019'
...
---
_id: '13587'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: W.
  full_name: Jabr, W.
  last_name: Jabr
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Gutt D, Neumann J, Jabr W, Kundisch D. The App Updating Conundrum: Implications
    of Platform’s Rating Resetting on Developers’ Behavior. In: <i>Proceedings of
    the 40th International Conference on Information Systems (ICIS)</i>. ; 2019.'
  apa: 'Gutt, D., Neumann, J., Jabr, W., &#38; Kundisch, D. (2019). The App Updating
    Conundrum: Implications of Platform’s Rating Resetting on Developers’ Behavior.
    In <i>Proceedings of the 40th International Conference on Information Systems
    (ICIS)</i>. Munich, Germany.'
  bibtex: '@inproceedings{Gutt_Neumann_Jabr_Kundisch_2019, title={The App Updating
    Conundrum: Implications of Platform’s Rating Resetting on Developers’ Behavior},
    booktitle={Proceedings of the 40th International Conference on Information Systems
    (ICIS)}, author={Gutt, Dominik and Neumann, Jürgen and Jabr, W. and Kundisch,
    Dennis}, year={2019} }'
  chicago: 'Gutt, Dominik, Jürgen Neumann, W. Jabr, and Dennis Kundisch. “The App
    Updating Conundrum: Implications of Platform’s Rating Resetting on Developers’
    Behavior.” In <i>Proceedings of the 40th International Conference on Information
    Systems (ICIS)</i>, 2019.'
  ieee: 'D. Gutt, J. Neumann, W. Jabr, and D. Kundisch, “The App Updating Conundrum:
    Implications of Platform’s Rating Resetting on Developers’ Behavior,” in <i>Proceedings
    of the 40th International Conference on Information Systems (ICIS)</i>, Munich,
    Germany, 2019.'
  mla: 'Gutt, Dominik, et al. “The App Updating Conundrum: Implications of Platform’s
    Rating Resetting on Developers’ Behavior.” <i>Proceedings of the 40th International
    Conference on Information Systems (ICIS)</i>, 2019.'
  short: 'D. Gutt, J. Neumann, W. Jabr, D. Kundisch, in: Proceedings of the 40th International
    Conference on Information Systems (ICIS), 2019.'
conference:
  location: Munich, Germany
  name: Proceedings of the 40th International Conference on Information Systems (ICIS)
date_created: 2019-10-02T11:25:04Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Proceedings of the 40th International Conference on Information Systems
  (ICIS)
status: public
title: 'The App Updating Conundrum: Implications of Platform’s Rating Resetting on
  Developers’ Behavior'
type: conference
user_id: '16205'
year: '2019'
...
---
_id: '13592'
author:
- first_name: Matthias
  full_name: Pilot, Matthias
  last_name: Pilot
citation:
  ama: Pilot M. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn; 2019.
  apa: Pilot, M. (2019). <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn.
  bibtex: '@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic
    Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot,
    Matthias}, year={2019} }'
  chicago: Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve
    Cryptography in Java</i>. Universität Paderborn, 2019.
  ieee: M. Pilot, <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn, 2019.
  mla: Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn, 2019.
  short: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java, Universität Paderborn, 2019.
date_created: 2019-10-03T12:30:24Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '13648'
author:
- first_name: Swante
  full_name: Scholz, Swante
  last_name: Scholz
citation:
  ama: Scholz S. <i>Implementation and Comparison of Elliptic Curve Algorithms in
    Java</i>. Universität Paderborn; 2019.
  apa: Scholz, S. (2019). <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn.
  bibtex: '@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve
    Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante},
    year={2019} }'
  chicago: Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn, 2019.
  ieee: S. Scholz, <i>Implementation and Comparison of Elliptic Curve Algorithms in
    Java</i>. Universität Paderborn, 2019.
  mla: Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn, 2019.
  short: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
    Java, Universität Paderborn, 2019.
date_created: 2019-10-07T09:56:58Z
date_updated: 2022-01-06T06:51:41Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: jbobolz
  date_created: 2020-04-27T10:32:00Z
  date_updated: 2020-04-27T10:33:59Z
  file_id: '16871'
  file_name: sscholz-MA-thesis-final.pdf
  file_size: 1714805
  relation: main_file
file_date_updated: 2020-04-27T10:33:59Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Implementation and Comparison of Elliptic Curve Algorithms in Java
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13652'
author:
- 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: Martijn
  full_name: Struijs, Martijn
  last_name: Struijs
citation:
  ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type
    Problems of Low Dimension. In: <i>33rd International Symposium on Distributed
    Computing (DISC 2019)</i>. ; 2019. doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>'
  apa: Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium
    on Distributed Computing (DISC 2019)</i>. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>
  bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>},
    booktitle={33rd International Symposium on Distributed Computing (DISC 2019)},
    author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn},
    year={2019} }'
  chicago: Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast
    Distributed Algorithms for LP-Type Problems of Low Dimension.” In <i>33rd International
    Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.
  ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
    for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on
    Distributed Computing (DISC 2019)</i>, 2019.
  mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
    of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC
    2019)</i>, 2019, doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>.
  short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium
    on Distributed Computing (DISC 2019), 2019.'
date_created: 2019-10-08T11:53:38Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '79'
doi: 10.4230/LIPICS.DISC.2019.23
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: 33rd International Symposium on Distributed Computing (DISC 2019)
status: public
title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
type: conference
user_id: '32229'
year: '2019'
...