---
_id: '109'
author:
- first_name: Felix
  full_name: Pauck, Felix
  id: '22398'
  last_name: Pauck
citation:
  ama: Pauck F. <i>Cooperative Static Analysis of Android Applications</i>. Universität
    Paderborn; 2017.
  apa: Pauck, F. (2017). <i>Cooperative static analysis of Android applications</i>.
    Universität Paderborn.
  bibtex: '@book{Pauck_2017, title={Cooperative static analysis of Android applications},
    publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }'
  chicago: Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>.
    Universität Paderborn, 2017.
  ieee: F. Pauck, <i>Cooperative static analysis of Android applications</i>. Universität
    Paderborn, 2017.
  mla: Pauck, Felix. <i>Cooperative Static Analysis of Android Applications</i>. Universität
    Paderborn, 2017.
  short: F. Pauck, Cooperative Static Analysis of Android Applications, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:52Z
ddc:
- '000'
department:
- _id: '77'
file:
- access_level: open_access
  content_type: application/pdf
  creator: fpauck
  date_created: 2019-08-07T08:55:58Z
  date_updated: 2019-08-07T09:03:48Z
  file_id: '12905'
  file_name: fpauck_2017.pdf
  file_size: 5093611
  relation: main_file
  title: Master's Thesis
file_date_updated: 2019-08-07T09:03:48Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Cooperative static analysis of Android applications
type: mastersthesis
user_id: '22398'
year: '2017'
...
---
_id: '1098'
abstract:
- lang: eng
  text: An end user generally writes down software requirements in ambiguous expressions
    using natural language; hence, a software developer attuned to programming language
    finds it difficult to understand th meaning of the requirements. To solve this
    problem we define semantic categories for disambiguation and classify/annotate
    the requirement into the categories by using machine-learning models. We extensively
    use a language frame closely related to such categories for designing features
    to overcome the problem of insufficient training data compare to the large number
    of classes. Our proposed model obtained a micro-average F1-score of 0.75, outperforming
    the previous model, REaCT.
article_type: original
author:
- first_name: Yeong-Su
  full_name: Kim, Yeong-Su
  last_name: Kim
- first_name: 'Seung-Woo '
  full_name: 'Lee, Seung-Woo '
  last_name: Lee
- first_name: Markus
  full_name: Dollmann, Markus
  id: '27578'
  last_name: Dollmann
- first_name: Michaela
  full_name: Geierhos, Michaela
  id: '42496'
  last_name: Geierhos
  orcid: 0000-0002-8180-5606
citation:
  ama: Kim Y-S, Lee S-W, Dollmann M, Geierhos M. Semantic Annotation of Software Requirements
    with Language Frame. <i>International Journal of Software Engineering for Smart
    Device</i>. 2017;4(2):1-6.
  apa: Kim, Y.-S., Lee, S.-W., Dollmann, M., &#38; Geierhos, M. (2017). Semantic Annotation
    of Software Requirements with Language Frame. <i>International Journal of Software
    Engineering for Smart Device</i>, <i>4</i>(2), 1–6.
  bibtex: '@article{Kim_Lee_Dollmann_Geierhos_2017, title={Semantic Annotation of
    Software Requirements with Language Frame}, volume={4}, number={2}, journal={International
    Journal of Software Engineering for Smart Device}, publisher={Global Vision School
    Publication}, author={Kim, Yeong-Su and Lee, Seung-Woo  and Dollmann, Markus and
    Geierhos, Michaela}, year={2017}, pages={1–6} }'
  chicago: 'Kim, Yeong-Su, Seung-Woo  Lee, Markus Dollmann, and Michaela Geierhos.
    “Semantic Annotation of Software Requirements with Language Frame.” <i>International
    Journal of Software Engineering for Smart Device</i> 4, no. 2 (2017): 1–6.'
  ieee: Y.-S. Kim, S.-W. Lee, M. Dollmann, and M. Geierhos, “Semantic Annotation of
    Software Requirements with Language Frame,” <i>International Journal of Software
    Engineering for Smart Device</i>, vol. 4, no. 2, pp. 1–6, 2017.
  mla: Kim, Yeong-Su, et al. “Semantic Annotation of Software Requirements with Language
    Frame.” <i>International Journal of Software Engineering for Smart Device</i>,
    vol. 4, no. 2, Global Vision School Publication, 2017, pp. 1–6.
  short: Y.-S. Kim, S.-W. Lee, M. Dollmann, M. Geierhos, International Journal of
    Software Engineering for Smart Device 4 (2017) 1–6.
date_created: 2018-01-25T15:23:15Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-12-12T15:30:59Z
  date_updated: 2018-12-12T15:30:59Z
  file_id: '6196'
  file_name: Semantic_Annotation_of_Software_Requirements.pdf
  file_size: 244655
  relation: main_file
  success: 1
file_date_updated: 2018-12-12T15:30:59Z
has_accepted_license: '1'
intvolume: '         4'
issue: '2'
keyword:
- Natural Language Processing
- Semantic Annotation
- Machine Learning
language:
- iso: eng
page: 1-6
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publication: International Journal of Software Engineering for Smart Device
publication_identifier:
  issn:
  - 2205-8494
publication_status: published
publisher: Global Vision School Publication
quality_controlled: '1'
status: public
title: Semantic Annotation of Software Requirements with Language Frame
type: journal_article
user_id: '477'
volume: 4
year: '2017'
...
---
_id: '110'
abstract:
- lang: eng
  text: 'We consider an extension of the dynamic speed scaling scheduling model introduced
    by Yao et al.: A set of jobs, each with a release time, deadline, and workload,
    has to be scheduled on a single, speed-scalable processor. Both the maximum allowed
    speed of the processor and the energy costs may vary continuously over time. The
    objective is to find a feasible schedule that minimizes the total energy costs.
    Theoretical algorithm design for speed scaling problems often tends to discretize
    problems, as our tools in the discrete realm are often better developed or understood.
    Using the above speed scaling variant with variable, continuous maximal processor
    speeds and energy prices as an example, we demonstrate that a more direct approach
    via tools from variational calculus can not only lead to a very concise and elegant
    formulation and analysis, but also avoids the “explosion of variables/constraints”
    that often comes with discretizing. Using well-known tools from calculus of variations,
    we derive combinatorial optimality characteristics for our continuous problem
    and provide a quite concise and simple correctness proof.'
author:
- first_name: Antonios
  full_name: Antoniadis, Antonios
  last_name: Antoniadis
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Sebastian
  full_name: Ott, Sebastian
  last_name: Ott
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability:
    A Simple and Direct Approach. <i>Theoretical Computer Science</i>. 2017:1-13.
    doi:<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>'
  apa: 'Antoniadis, A., Kling, P., Ott, S., &#38; Riechers, S. (2017). Continuous
    Speed Scaling with Variability: A Simple and Direct Approach. <i>Theoretical Computer
    Science</i>, 1–13. <a href="https://doi.org/10.1016/j.tcs.2017.03.021">https://doi.org/10.1016/j.tcs.2017.03.021</a>'
  bibtex: '@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling
    with Variability: A Simple and Direct Approach}, DOI={<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis,
    Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017},
    pages={1–13} }'
  chicago: 'Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers.
    “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” <i>Theoretical
    Computer Science</i>, 2017, 1–13. <a href="https://doi.org/10.1016/j.tcs.2017.03.021">https://doi.org/10.1016/j.tcs.2017.03.021</a>.'
  ieee: 'A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling
    with Variability: A Simple and Direct Approach,” <i>Theoretical Computer Science</i>,
    pp. 1–13, 2017.'
  mla: 'Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A
    Simple and Direct Approach.” <i>Theoretical Computer Science</i>, Elsevier, 2017,
    pp. 1–13, doi:<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>.'
  short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science
    (2017) 1–13.
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1016/j.tcs.2017.03.021
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:07:43Z
  date_updated: 2018-03-21T13:07:43Z
  file_id: '1567'
  file_name: 110-TCSSubmission.pdf
  file_size: 494600
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:07:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-13
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '117'
author:
- first_name: Pascal
  full_name: Bemmann, Pascal
  id: '32571'
  last_name: Bemmann
citation:
  ama: Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn; 2017.
  apa: Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving
    Signatures</i>. Universität Paderborn.
  bibtex: '@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving
    Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017}
    }'
  chicago: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving
    Signatures</i>. Universität Paderborn, 2017.
  ieee: P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  mla: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  short: P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:06Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Attribute-based Signatures using Structure Preserving Signatures
type: mastersthesis
user_id: '25078'
year: '2017'
...
---
_id: '118'
author:
- first_name: Ngoc
  full_name: Chi Banh, Ngoc
  last_name: Chi Banh
citation:
  ama: Chi Banh N. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Chi Banh, N. (2017). <i>An Asynchronous Adaptation of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Chi Banh_2017, title={An Asynchronous Adaptation of a Churn-resistant
    Overlay Network}, publisher={Universität Paderborn}, author={Chi Banh, Ngoc},
    year={2017} }'
  chicago: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. Chi Banh, <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  short: N. Chi Banh, An Asynchronous Adaptation of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:08Z
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: An Asynchronous Adaptation of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1180'
abstract:
- lang: eng
  text: These days, there is a strong rise in the needs for machine learning applications,
    requiring an automation of machine learning engineering which is referred to as
    AutoML. In AutoML the selection, composition and parametrization of machine learning
    algorithms is automated and tailored to a specific problem, resulting in a machine
    learning pipeline. Current approaches reduce the AutoML problem to optimization
    of hyperparameters. Based on recursive task networks, in this paper we present
    one approach from the field of automated planning and one evolutionary optimization
    approach. Instead of simply parametrizing a given pipeline, this allows for structure
    optimization of machine learning pipelines, as well. We evaluate the two approaches
    in an extensive evaluation, finding both approaches to have their strengths in
    different areas. Moreover, the two approaches outperform the state-of-the-art
    tool Auto-WEKA in many settings.
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: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Wever MD, Mohr F, Hüllermeier E. Automatic Machine Learning: Hierachical Planning
    Versus Evolutionary Optimization. In: <i>27th Workshop Computational Intelligence</i>.
    Dortmund; 2017.'
  apa: 'Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2017). Automatic Machine Learning:
    Hierachical Planning Versus Evolutionary Optimization. In <i>27th Workshop Computational
    Intelligence</i>. Dortmund.'
  bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2017, place={Dortmund}, title={Automatic
    Machine Learning: Hierachical Planning Versus Evolutionary Optimization}, booktitle={27th
    Workshop Computational Intelligence}, author={Wever, Marcel Dominik and Mohr,
    Felix and Hüllermeier, Eyke}, year={2017} }'
  chicago: 'Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automatic Machine
    Learning: Hierachical Planning Versus Evolutionary Optimization.” In <i>27th Workshop
    Computational Intelligence</i>. Dortmund, 2017.'
  ieee: 'M. D. Wever, F. Mohr, and E. Hüllermeier, “Automatic Machine Learning: Hierachical
    Planning Versus Evolutionary Optimization,” in <i>27th Workshop Computational
    Intelligence</i>, Dortmund, 2017.'
  mla: 'Wever, Marcel Dominik, et al. “Automatic Machine Learning: Hierachical Planning
    Versus Evolutionary Optimization.” <i>27th Workshop Computational Intelligence</i>,
    2017.'
  short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: 27th Workshop Computational Intelligence,
    Dortmund, 2017.'
conference:
  end_date: 2017-11-24
  location: Dortmund
  name: 27th Workshop Computational Intelligence
  start_date: 2017-11-23
date_created: 2018-02-22T07:19:18Z
date_updated: 2022-01-06T06:51:09Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
  content_type: application/pdf
  creator: wever
  date_created: 2018-11-06T15:28:09Z
  date_updated: 2018-11-06T15:28:09Z
  file_id: '5387'
  file_name: CI Workshop AutoML.pdf
  file_size: 323589
  relation: main_file
  success: 1
file_date_updated: 2018-11-06T15:28:09Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://publikationen.bibliothek.kit.edu/1000074341/4643874
oa: '1'
place: Dortmund
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
publication: 27th Workshop Computational Intelligence
publication_status: published
status: public
title: 'Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization'
type: conference
user_id: '49109'
year: '2017'
...
---
_id: '119'
author:
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
  ama: Wever MD. <i>Active Learning of User Requirement Specifications in Dynamic
    Software Service Markets</i>. Universität Paderborn; 2017.
  apa: Wever, M. D. (2017). <i>Active Learning of User Requirement Specifications
    in Dynamic Software Service Markets</i>. Universität Paderborn.
  bibtex: '@book{Wever_2017, title={Active Learning of User Requirement Specifications
    in Dynamic Software Service Markets}, publisher={Universität Paderborn}, author={Wever,
    Marcel Dominik}, year={2017} }'
  chicago: Wever, Marcel Dominik. <i>Active Learning of User Requirement Specifications
    in Dynamic Software Service Markets</i>. Universität Paderborn, 2017.
  ieee: M. D. Wever, <i>Active Learning of User Requirement Specifications in Dynamic
    Software Service Markets</i>. Universität Paderborn, 2017.
  mla: Wever, Marcel Dominik. <i>Active Learning of User Requirement Specifications
    in Dynamic Software Service Markets</i>. Universität Paderborn, 2017.
  short: M.D. Wever, Active Learning of User Requirement Specifications in Dynamic
    Software Service Markets, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:12Z
ddc:
- '000'
file:
- access_level: open_access
  content_type: application/pdf
  creator: wever
  date_created: 2018-11-06T15:31:48Z
  date_updated: 2020-07-16T11:53:45Z
  file_id: '5388'
  file_name: MT-export-2017-03-17.pdf
  file_size: 4012186
  relation: main_file
file_date_updated: 2020-07-16T11:53:45Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Active Learning of User Requirement Specifications in Dynamic Software Service
  Markets
type: mastersthesis
user_id: '33176'
year: '2017'
...
---
_id: '120'
abstract:
- lang: eng
  text: 'Within software engineering, requirements engineering starts from imprecise
    and vague user requirements descriptions and infers precise, formalized specifications.
    Techniques, such as interviewing by requirements engineers, are typically applied
    to identify the user’s needs. We want to partially automate even this first step
    of requirements elicitation by methods of evolutionary computation. The idea is
    to enable users to specify their desired software by listing examples of behavioral
    descriptions. Users initially specify two lists of operation sequences, one with
    desired behaviors and one with forbidden behaviors. Then, we search for the appropriate
    formal software specification in the form of a deterministic finite automaton.
    We solve this problem known as grammatical inference with an active coevolutionary
    approach following Bongard and Lipson [2]. The coevolutionary process alternates
    between two phases: (A) additional training data is actively proposed by an evolutionary
    process and the user is interactively asked to label it; (B) appropriate automata
    are then evolved to solve this extended grammatical inference problem. Our approach
    leverages multi-objective evolution in both phases and outperforms the state-of-the-art
    technique [2] for input alphabet sizes of three and more, which are relevant to
    our problem domain of requirements specification.'
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: Lorijn
  full_name: van Rooijen, Lorijn
  id: '58843'
  last_name: van Rooijen
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: 'Wever MD, van Rooijen L, Hamann H. Active Coevolutionary Learning of Requirements
    Specifications from Examples. In: <i>Proceedings of the Genetic and Evolutionary
    Computation Conference (GECCO)</i>. ; 2017:1327--1334. doi:<a href="https://doi.org/10.1145/3071178.3071258">10.1145/3071178.3071258</a>'
  apa: Wever, M. D., van Rooijen, L., &#38; Hamann, H. (2017). Active Coevolutionary
    Learning of Requirements Specifications from Examples. In <i>Proceedings of the
    Genetic and Evolutionary Computation Conference (GECCO)</i> (pp. 1327--1334).
    <a href="https://doi.org/10.1145/3071178.3071258">https://doi.org/10.1145/3071178.3071258</a>
  bibtex: '@inproceedings{Wever_van Rooijen_Hamann_2017, title={Active Coevolutionary
    Learning of Requirements Specifications from Examples}, DOI={<a href="https://doi.org/10.1145/3071178.3071258">10.1145/3071178.3071258</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
    (GECCO)}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko},
    year={2017}, pages={1327--1334} }'
  chicago: Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Active Coevolutionary
    Learning of Requirements Specifications from Examples.” In <i>Proceedings of the
    Genetic and Evolutionary Computation Conference (GECCO)</i>, 1327--1334, 2017.
    <a href="https://doi.org/10.1145/3071178.3071258">https://doi.org/10.1145/3071178.3071258</a>.
  ieee: M. D. Wever, L. van Rooijen, and H. Hamann, “Active Coevolutionary Learning
    of Requirements Specifications from Examples,” in <i>Proceedings of the Genetic
    and Evolutionary Computation Conference (GECCO)</i>, 2017, pp. 1327--1334.
  mla: Wever, Marcel Dominik, et al. “Active Coevolutionary Learning of Requirements
    Specifications from Examples.” <i>Proceedings of the Genetic and Evolutionary
    Computation Conference (GECCO)</i>, 2017, pp. 1327--1334, doi:<a href="https://doi.org/10.1145/3071178.3071258">10.1145/3071178.3071258</a>.
  short: 'M.D. Wever, L. van Rooijen, H. Hamann, in: Proceedings of the Genetic and
    Evolutionary Computation Conference (GECCO), 2017, pp. 1327--1334.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:15Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1145/3071178.3071258
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:00:35Z
  date_updated: 2018-11-02T15:00:35Z
  file_id: '5290'
  file_name: p1327-wever.pdf
  file_size: 1092021
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:00:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 1327--1334
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subproject B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)
status: public
title: Active Coevolutionary Learning of Requirements Specifications from Examples
type: conference
user_id: '477'
year: '2017'
...
---
_id: '121'
abstract:
- lang: eng
  text: Research on ad copy design is well-studied in the context of offline marketing.
    However, researchers have only recently started to investigate ad copies in the
    context of paid search, and have not yet explored the potential of information
    cues to enhance customers’ search process. In this paper we analyze the impact
    of an information cue on user behavior in ad copies. Contrary to prevalent advice,
    results suggest that reducing the number of words in an ad is not always beneficial.
    Users act quite differently (and unexpectedly) in response to an information cue
    depending on their search phrases. In turn, practitioners could leverage the observed
    moderating effect of an information cue to enhance paid search success. Furthermore,
    having detected deviating user behavior in terms of clicks and conversions, we
    provide first indicative evidence of a self-selection mechanism at play when paid
    search users respond to differently phrased ad copies.
author:
- first_name: Darius
  full_name: Schlangenotto, Darius
  last_name: Schlangenotto
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Schlangenotto D, Kundisch D. Achieving more by saying less? On the Moderating
    Effect of Information Cues in Paid Search. In: <i>Proceedings of the 50th Annual
    Hawaii International Conference on System Sciences (HICSS), Waikoloa Village,
    HI, USA</i>. ; 2017.'
  apa: Schlangenotto, D., &#38; Kundisch, D. (2017). Achieving more by saying less?
    On the Moderating Effect of Information Cues in Paid Search. In <i>Proceedings
    of the 50th annual Hawaii International Conference on System Sciences (HICSS),
    Waikoloa Village, HI, USA</i>.
  bibtex: '@inproceedings{Schlangenotto_Kundisch_2017, title={Achieving more by saying
    less? On the Moderating Effect of Information Cues in Paid Search}, booktitle={Proceedings
    of the 50th annual Hawaii International Conference on System Sciences (HICSS),
    Waikoloa Village, HI, USA}, author={Schlangenotto, Darius and Kundisch, Dennis},
    year={2017} }'
  chicago: Schlangenotto, Darius, and Dennis Kundisch. “Achieving More by Saying Less?
    On the Moderating Effect of Information Cues in Paid Search.” In <i>Proceedings
    of the 50th Annual Hawaii International Conference on System Sciences (HICSS),
    Waikoloa Village, HI, USA</i>, 2017.
  ieee: D. Schlangenotto and D. Kundisch, “Achieving more by saying less? On the Moderating
    Effect of Information Cues in Paid Search,” in <i>Proceedings of the 50th annual
    Hawaii International Conference on System Sciences (HICSS), Waikoloa Village,
    HI, USA</i>, 2017.
  mla: Schlangenotto, Darius, and Dennis Kundisch. “Achieving More by Saying Less?
    On the Moderating Effect of Information Cues in Paid Search.” <i>Proceedings of
    the 50th Annual Hawaii International Conference on System Sciences (HICSS), Waikoloa
    Village, HI, USA</i>, 2017.
  short: 'D. Schlangenotto, D. Kundisch, in: Proceedings of the 50th Annual Hawaii
    International Conference on System Sciences (HICSS), Waikoloa Village, HI, USA,
    2017.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:17Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:03:28Z
  date_updated: 2018-03-21T13:03:28Z
  file_id: '1563'
  file_name: 121-Achieving_more_by_saying_less_-_Schlangenotto_Kundisch.pdf
  file_size: 753268
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:03:28Z
has_accepted_license: '1'
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 50th annual Hawaii International Conference on System
  Sciences (HICSS), Waikoloa Village, HI, USA
status: public
title: Achieving more by saying less? On the Moderating Effect of Information Cues
  in Paid Search
type: conference
user_id: '477'
year: '2017'
...
---
_id: '122'
abstract:
- lang: eng
  text: Current research on paid search highlights its ability to enhance both online
    and offline conversions. Yet, research investigating the impact of placing paid
    search ads on less prominent positions on subsequent consumer behavior is limited
    to the online environment. This paper presents a field experiment using differences-in-differences
    analysis to investigate whether the targeting of a less prominent ad position
    can be beneficial for bricks-and-mortar retailers. Results indicate that paid
    search advertising budgets could be allocated more efficiently by targeting less
    prominent ad positions, thus allowing bricks-and-mortar retailers with a limited
    marketing budget to increase the reach of their marketing campaign, attract more
    consumers to their website and achieve an overall increase in conversions. Furthermore,
    the pay-per-click billing mechanism allows advertisers to increase their marketing
    reach at no additional cost. Consequently, bricks-and-mortar retailers should
    consider targeting less prominent ad positions to reduce advertising costs while
    simultaneously enhancing advertising benefits.
author:
- first_name: Darius
  full_name: Schlangenotto, Darius
  last_name: Schlangenotto
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: 'Schlangenotto D, Kundisch D, Gutt D. Achieving More by Paying Less? How Bricks-and-Mortar
    Retailers Can Benefit by Bidding Less Aggressively in Paid Search. In: <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>. ; 2017.'
  apa: Schlangenotto, D., Kundisch, D., &#38; Gutt, D. (2017). Achieving More by Paying
    Less? How Bricks-and-Mortar Retailers Can Benefit by Bidding Less Aggressively
    in Paid Search. In <i>Proceedings of the 38th International Conference on Information
    Systems (ICIS), Seoul, South Korea</i>. Seoul, South Korea.
  bibtex: '@inproceedings{Schlangenotto_Kundisch_Gutt_2017, title={Achieving More
    by Paying Less? How Bricks-and-Mortar Retailers Can Benefit by Bidding Less Aggressively
    in Paid Search}, booktitle={Proceedings of the 38th International Conference on
    Information Systems (ICIS), Seoul, South Korea}, author={Schlangenotto, Darius
    and Kundisch, Dennis and Gutt, Dominik}, year={2017} }'
  chicago: Schlangenotto, Darius, Dennis Kundisch, and Dominik Gutt. “Achieving More
    by Paying Less? How Bricks-and-Mortar Retailers Can Benefit by Bidding Less Aggressively
    in Paid Search.” In <i>Proceedings of the 38th International Conference on Information
    Systems (ICIS), Seoul, South Korea</i>, 2017.
  ieee: D. Schlangenotto, D. Kundisch, and D. Gutt, “Achieving More by Paying Less?
    How Bricks-and-Mortar Retailers Can Benefit by Bidding Less Aggressively in Paid
    Search,” in <i>Proceedings of the 38th International Conference on Information
    Systems (ICIS), Seoul, South Korea</i>, Seoul, South Korea, 2017.
  mla: Schlangenotto, Darius, et al. “Achieving More by Paying Less? How Bricks-and-Mortar
    Retailers Can Benefit by Bidding Less Aggressively in Paid Search.” <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>, 2017.
  short: 'D. Schlangenotto, D. Kundisch, D. Gutt, in: Proceedings of the 38th International
    Conference on Information Systems (ICIS), Seoul, South Korea, 2017.'
conference:
  location: Seoul, South Korea
  name: 38th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:18Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T09:53:25Z
  date_updated: 2018-11-12T09:53:25Z
  file_id: '5472'
  file_name: Achieving More by Paying Less_ How Bricks-and-Mortar Retailers Ca.pdf
  file_size: 1163201
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T09:53:25Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 38th International Conference on Information Systems
  (ICIS), Seoul, South Korea
status: public
title: Achieving More by Paying Less? How Bricks-and-Mortar Retailers Can Benefit
  by Bidding Less Aggressively in Paid Search
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '123'
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Olaf
  full_name: Zimmermann, Olaf
  last_name: Zimmermann
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Jazayeri B, Zimmermann O, Engels G, Kundisch D. <i>A Variability Model for
    Store-Oriented Software Ecosystems: An Enterprise Perspective (Supplementary Material)</i>.
    Universität Paderborn; 2017.'
  apa: 'Jazayeri, B., Zimmermann, O., Engels, G., &#38; Kundisch, D. (2017). <i>A
    Variability Model for Store-oriented Software Ecosystems: An Enterprise Perspective
    (Supplementary Material)</i>. Universität Paderborn.'
  bibtex: '@book{Jazayeri_Zimmermann_Engels_Kundisch_2017, title={A Variability Model
    for Store-oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material)}, publisher={Universität Paderborn}, author={Jazayeri, Bahar and Zimmermann,
    Olaf and Engels, Gregor and Kundisch, Dennis}, year={2017} }'
  chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, and Dennis Kundisch.
    <i>A Variability Model for Store-Oriented Software Ecosystems: An Enterprise Perspective
    (Supplementary Material)</i>. Universität Paderborn, 2017.'
  ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, and D. Kundisch, <i>A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material)</i>. Universität Paderborn, 2017.'
  mla: 'Jazayeri, Bahar, et al. <i>A Variability Model for Store-Oriented Software
    Ecosystems: An Enterprise Perspective (Supplementary Material)</i>. Universität
    Paderborn, 2017.'
  short: 'B. Jazayeri, O. Zimmermann, G. Engels, D. Kundisch, A Variability Model
    for Store-Oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material), Universität Paderborn, 2017.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:18Z
ddc:
- '040'
department:
- _id: '276'
- _id: '66'
file:
- access_level: closed
  content_type: application/pdf
  creator: bahareh
  date_created: 2018-11-12T19:13:39Z
  date_updated: 2018-11-12T19:13:39Z
  file_id: '5535'
  file_name: JZEK17.pdf
  file_size: 835116
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T19:13:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: 'A Variability Model for Store-oriented Software Ecosystems: An Enterprise
  Perspective (Supplementary Material)'
type: report
user_id: '477'
year: '2017'
...
---
_id: '124'
abstract:
- lang: eng
  text: Pioneers of today’s software industry like Salesforce and Apple have established
    successful ecosystems around their software platforms. Architectural knowledge
    of the existing ecosystems is implicit and fragmented among online documentation.
    In protection of intellectual property, existing documentation hardly reveals
    influential business strategies that affect the ecosystem structure. Thus, other
    platform providers can hardly learn from the existing ecosystems in order to systematically
    make reasonable design decisions with respect to their business strategies to
    create their own ecosystems. In this paper, we identify a variability model for
    architectural design decisions of a store-oriented software ecosystem product
    line from an enterprise perspective, comprising business, application, and infrastructure
    views. We derive the variability model from fragmentary material of existing ecosystems
    and a rigorous literature review using a research method based on the design science
    paradigm. To show its validity, we describe real-world ecosystems from diverse
    domains using the variability model. This knowledge helps platform providers to
    develop customized ecosystems or to recreate existing designs in a systematic
    way. This, in turn, contributes to an increase in designer and developer productivity.
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Olaf
  full_name: Zimmermann, Olaf
  last_name: Zimmermann
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Jazayeri B, Zimmermann O, Engels G, Kundisch D. A Variability Model for Store-oriented
    Software Ecosystems: An Enterprise Perspective. In: <i>Proceedings of the 15th
    International Conference on Service Oriented Computing (ICSOC)</i>. Vol 10601.
    Lecture Notes in Computer Science (LNCS). Málaga, Spain: Springer; 2017. doi:<a
    href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>'
  apa: 'Jazayeri, B., Zimmermann, O., Engels, G., &#38; Kundisch, D. (2017). A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective. In <i>Proceedings
    of the 15th International Conference on Service Oriented Computing (ICSOC)</i>
    (Vol. 10601). Málaga, Spain: Springer. <a href="https://doi.org/10.1007/978-3-319-69035-3_42">https://doi.org/10.1007/978-3-319-69035-3_42</a>'
  bibtex: '@inproceedings{Jazayeri_Zimmermann_Engels_Kundisch_2017, place={Málaga,
    Spain}, series={Lecture Notes in Computer Science (LNCS)}, title={A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective}, volume={10601},
    DOI={<a href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>},
    booktitle={Proceedings of the 15th International Conference on Service Oriented
    Computing (ICSOC)}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann,
    Olaf and Engels, Gregor and Kundisch, Dennis}, year={2017}, collection={Lecture
    Notes in Computer Science (LNCS)} }'
  chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, and Dennis Kundisch.
    “A Variability Model for Store-Oriented Software Ecosystems: An Enterprise Perspective.”
    In <i>Proceedings of the 15th International Conference on Service Oriented Computing
    (ICSOC)</i>, Vol. 10601. Lecture Notes in Computer Science (LNCS). Málaga, Spain:
    Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-69035-3_42">https://doi.org/10.1007/978-3-319-69035-3_42</a>.'
  ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, and D. Kundisch, “A Variability Model
    for Store-oriented Software Ecosystems: An Enterprise Perspective,” in <i>Proceedings
    of the 15th International Conference on Service Oriented Computing (ICSOC)</i>,
    2017, vol. 10601.'
  mla: 'Jazayeri, Bahar, et al. “A Variability Model for Store-Oriented Software Ecosystems:
    An Enterprise Perspective.” <i>Proceedings of the 15th International Conference
    on Service Oriented Computing (ICSOC)</i>, vol. 10601, Springer, 2017, doi:<a
    href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>.'
  short: 'B. Jazayeri, O. Zimmermann, G. Engels, D. Kundisch, in: Proceedings of the
    15th International Conference on Service Oriented Computing (ICSOC), Springer,
    Málaga, Spain, 2017.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:18Z
ddc:
- '040'
department:
- _id: '66'
- _id: '276'
doi: 10.1007/978-3-319-69035-3_42
file:
- access_level: closed
  content_type: application/pdf
  creator: bahareh
  date_created: 2018-11-12T18:55:55Z
  date_updated: 2018-11-12T18:55:55Z
  file_id: '5532'
  file_name: Jaz_ICSOC17.pdf
  file_size: 566612
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T18:55:55Z
has_accepted_license: '1'
intvolume: '     10601'
language:
- iso: eng
place: Málaga, Spain
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 15th International Conference on Service Oriented
  Computing (ICSOC)
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'A Variability Model for Store-oriented Software Ecosystems: An Enterprise
  Perspective'
type: conference
user_id: '16205'
volume: 10601
year: '2017'
...
---
_id: '125'
abstract:
- lang: eng
  text: 'Searching for other participants is one of the most important operations
    in a distributed system.We are interested in topologies in which it is possible
    to route a packet in a fixed number of hops until it arrives at its destination.Given
    a constant $d$, this paper introduces a new self-stabilizing protocol for the
    $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route
    any search request in at most $d$ hops w.h.p., while significantly lowering the
    node degree compared to the clique: We require nodes to have a degree of $\mathcal
    O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The
    protocol keeps the expected amount of edge redirections per node in $\mathcal
    O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The
    number of messages that are periodically sent out by nodes is constant.'
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In:
    <i>Proceedings of the 19th International Symposium on Stabilization, Safety, and
    Security of Distributed Systems (SSS)</i>. Vol 10616. Lecture Notes in Computer
    Science. Springer, Cham; 2017:250-264. doi:<a href="https://doi.org/10.1007/978-3-319-69084-1_17">10.1007/978-3-319-69084-1_17</a>'
  apa: Feldmann, M., &#38; Scheideler, C. (2017). A Self-Stabilizing General De Bruijn
    Graph. In <i>Proceedings of the 19th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i> (Vol. 10616, pp. 250–264).
    Springer, Cham. <a href="https://doi.org/10.1007/978-3-319-69084-1_17">https://doi.org/10.1007/978-3-319-69084-1_17</a>
  bibtex: '@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer
    Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616},
    DOI={<a href="https://doi.org/10.1007/978-3-319-69084-1_17">10.1007/978-3-319-69084-1_17</a>},
    booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
    Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture
    Notes in Computer Science} }'
  chicago: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General
    De Bruijn Graph.” In <i>Proceedings of the 19th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, 10616:250–64. Lecture Notes
    in Computer Science. Springer, Cham, 2017. <a href="https://doi.org/10.1007/978-3-319-69084-1_17">https://doi.org/10.1007/978-3-319-69084-1_17</a>.
  ieee: M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,”
    in <i>Proceedings of the 19th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 2017, vol. 10616, pp. 250–264.
  mla: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De
    Bruijn Graph.” <i>Proceedings of the 19th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, vol. 10616, Springer, Cham,
    2017, pp. 250–64, doi:<a href="https://doi.org/10.1007/978-3-319-69084-1_17">10.1007/978-3-319-69084-1_17</a>.
  short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer,
    Cham, 2017, pp. 250–264.'
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:19Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-69084-1_17
external_id:
  arxiv:
  - '1708.06542'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:30:13Z
  date_updated: 2018-10-31T13:30:13Z
  file_id: '5214'
  file_name: Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf
  file_size: 311204
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:30:13Z
has_accepted_license: '1'
intvolume: '     10616'
language:
- iso: eng
page: '250-264 '
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 19th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publication_identifier:
  isbn:
  - 978-3-319-69083-4
publication_status: published
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Self-Stabilizing General De Bruijn Graph
type: conference
user_id: '23538'
volume: 10616
year: '2017'
...
---
_id: '126'
abstract:
- lang: eng
  text: Optimal price setting in peer-to-peer markets featuring online ratings requires
    incorporating interactions between prices and ratings. Additionally, recent literature
    reports that online ratings in peer-to-peer markets tend to be inflated overall,
    undermining the reliability of online ratings as a quality signal. This study
    proposes a two-period model for optimal price setting that takes (potentially
    inflated) ratings into account. Our theoretical findings suggest that sellers
    in the medium-quality segment have an incentive to lower first-period prices to
    monetize on increased second-period ratings and that the possibility on monetizing
    on second-period ratings depends on the reliability of the rating system. Additionally,
    we find that total profits and prices increase with online ratings and additional
    quality signals. Empirically, conducting Difference-in-Difference regressions
    on a comprehensive panel data set from Airbnb, we can validate that price increases
    lead to lower ratings, and we find empirical support for the prediction that additional
    quality signals increase prices. Our work comes with substantial implications
    for sellers in peer-to-peer markets looking for an optimal price setting strategy.
    Moreover, we argue that our theoretical finding on the weights between online
    ratings and additional quality signals translates to conventional online markets.
author:
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: 'Neumann J, Gutt D. A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence
    for Optimal Pricing Conditional on Online Ratings. In: <i>Proceedings of the 25th
    Conference on Information Systems (ECIS)</i>. ; 2017.'
  apa: 'Neumann, J., &#38; Gutt, D. (2017). A Homeowner’s Guide to Airbnb: Theory
    and Empirical Evidence for Optimal Pricing Conditional on Online Ratings. In <i>Proceedings
    of the 25th Conference on Information Systems (ECIS)</i>. Guimaraes, Portugal.'
  bibtex: '@inproceedings{Neumann_Gutt_2017, title={A Homeowner’s Guide to Airbnb:
    Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings},
    booktitle={Proceedings of the 25th Conference on Information Systems (ECIS)},
    author={Neumann, Jürgen and Gutt, Dominik}, year={2017} }'
  chicago: 'Neumann, Jürgen, and Dominik Gutt. “A Homeowner’s Guide to Airbnb: Theory
    and Empirical Evidence for Optimal Pricing Conditional on Online Ratings.” In
    <i>Proceedings of the 25th Conference on Information Systems (ECIS)</i>, 2017.'
  ieee: 'J. Neumann and D. Gutt, “A Homeowner’s Guide to Airbnb: Theory and Empirical
    Evidence for Optimal Pricing Conditional on Online Ratings,” in <i>Proceedings
    of the 25th Conference on Information Systems (ECIS)</i>, Guimaraes, Portugal,
    2017.'
  mla: 'Neumann, Jürgen, and Dominik Gutt. “A Homeowner’s Guide to Airbnb: Theory
    and Empirical Evidence for Optimal Pricing Conditional on Online Ratings.” <i>Proceedings
    of the 25th Conference on Information Systems (ECIS)</i>, 2017.'
  short: 'J. Neumann, D. Gutt, in: Proceedings of the 25th Conference on Information
    Systems (ECIS), 2017.'
conference:
  location: Guimaraes, Portugal
  name: 25th Conference on Information Systems (ECIS)
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:19Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T09:57:18Z
  date_updated: 2018-11-12T09:57:18Z
  file_id: '5476'
  file_name: A HOMEOWNER_S GUIDE TO AIRBNB_ THEORY AND EMPIRICAL EVIDENCE FOR.pdf
  file_size: 595270
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T09:57:18Z
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 25th Conference on Information Systems (ECIS)
status: public
title: 'A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing
  Conditional on Online Ratings'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '100'
author:
- first_name: Albin
  full_name: Sergio Djoum Temdjim, Albin
  last_name: Sergio Djoum Temdjim
citation:
  ama: Sergio Djoum Temdjim A. <i>Evaluation of Software Reputation Matching Based
    on App Reviews</i>. Universität Paderborn; 2017.
  apa: Sergio Djoum Temdjim, A. (2017). <i>Evaluation of Software Reputation Matching
    Based on App Reviews</i>. Universität Paderborn.
  bibtex: '@book{Sergio Djoum Temdjim_2017, title={Evaluation of Software Reputation
    Matching Based on App Reviews}, publisher={Universität Paderborn}, author={Sergio
    Djoum Temdjim, Albin}, year={2017} }'
  chicago: Sergio Djoum Temdjim, Albin. <i>Evaluation of Software Reputation Matching
    Based on App Reviews</i>. Universität Paderborn, 2017.
  ieee: A. Sergio Djoum Temdjim, <i>Evaluation of Software Reputation Matching Based
    on App Reviews</i>. Universität Paderborn, 2017.
  mla: Sergio Djoum Temdjim, Albin. <i>Evaluation of Software Reputation Matching
    Based on App Reviews</i>. Universität Paderborn, 2017.
  short: A. Sergio Djoum Temdjim, Evaluation of Software Reputation Matching Based
    on App Reviews, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:21Z
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Evaluation of Software Reputation Matching Based on App Reviews
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '101'
author:
- first_name: Lennart
  full_name: Rehmer, Lennart
  last_name: Rehmer
citation:
  ama: Rehmer L. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn; 2017.
  apa: Rehmer, L. (2017). <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn.
  bibtex: '@book{Rehmer_2017, title={Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation}, publisher={Universität Paderborn},
    author={Rehmer, Lennart}, year={2017} }'
  chicago: Rehmer, Lennart. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  ieee: L. Rehmer, <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  mla: Rehmer, Lennart. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  short: L. Rehmer, Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:29Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
title: Erweiterung eines kontextsensitiven Autovervollständigungstools zur natürlichsprachlichen
  Softwarespezifikation
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '102'
author:
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
citation:
  ama: Becker M. <i>Engineering Self-Adaptive Systems with Simulation-Based Performence
    Prediction</i>. Universität Paderborn; 2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-133">10.17619/UNIPB/1-133</a>
  apa: Becker, M. (2017). <i>Engineering Self-Adaptive Systems with Simulation-Based
    Performence Prediction</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-133">https://doi.org/10.17619/UNIPB/1-133</a>
  bibtex: '@book{Becker_2017, title={Engineering Self-Adaptive Systems with Simulation-Based
    Performence Prediction}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-133">10.17619/UNIPB/1-133</a>},
    publisher={Universität Paderborn}, author={Becker, Matthias}, year={2017} }'
  chicago: Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based
    Performence Prediction</i>. Universität Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-133">https://doi.org/10.17619/UNIPB/1-133</a>.
  ieee: M. Becker, <i>Engineering Self-Adaptive Systems with Simulation-Based Performence
    Prediction</i>. Universität Paderborn, 2017.
  mla: Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based
    Performence Prediction</i>. Universität Paderborn, 2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-133">10.17619/UNIPB/1-133</a>.
  short: M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence
    Prediction, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:31Z
department:
- _id: '76'
doi: 10.17619/UNIPB/1-133
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
title: Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '5954'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural
    Approach</i>. Universität Paderborn; 2017.
  apa: N, N. (2017). <i>Multi-Dimensional Bargaining Problem and Nash Solution - A
    procedural approach</i>. Universität Paderborn.
  bibtex: '@book{N_2017, title={Multi-Dimensional Bargaining Problem and Nash Solution
    - A procedural approach}, publisher={Universität Paderborn}, author={N, N}, year={2017}
    }'
  chicago: N, N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural
    Approach</i>. Universität Paderborn, 2017.
  ieee: N. N, <i>Multi-Dimensional Bargaining Problem and Nash Solution - A procedural
    approach</i>. Universität Paderborn, 2017.
  mla: N, N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural
    Approach</i>. Universität Paderborn, 2017.
  short: N. N, Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural
    Approach, Universität Paderborn, 2017.
date_created: 2018-11-28T11:39:28Z
date_updated: 2022-11-30T14:16:20Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '5957'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>.
    Universität Paderborn; 2017.
  apa: N, N. (2017). <i>Game Theory solutions for the Transshipment Problem in Logistic
    Networks</i>. Universität Paderborn.
  bibtex: '@book{N_2017, title={Game Theory solutions for the Transshipment Problem
    in Logistic Networks}, publisher={Universität Paderborn}, author={N, N}, year={2017}
    }'
  chicago: N, N. <i>Game Theory Solutions for the Transshipment Problem in Logistic
    Networks</i>. Universität Paderborn, 2017.
  ieee: N. N, <i>Game Theory solutions for the Transshipment Problem in Logistic Networks</i>.
    Universität Paderborn, 2017.
  mla: N, N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>.
    Universität Paderborn, 2017.
  short: N. N, Game Theory Solutions for the Transshipment Problem in Logistic Networks,
    Universität Paderborn, 2017.
date_created: 2018-11-28T11:46:21Z
date_updated: 2022-11-30T14:16:55Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Game Theory solutions for the Transshipment Problem in Logistic Networks
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '5955'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i>
    Universität Paderborn; 2017.
  apa: N, N. (2017). <i>Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute Kryptowährung
    aus?</i> Universität Paderborn.
  bibtex: '@book{N_2017, title={Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute
    Kryptowährung aus?}, publisher={Universität Paderborn}, author={N, N}, year={2017}
    }'
  chicago: N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung
    Aus?</i> Universität Paderborn, 2017.
  ieee: N. N, <i>Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute Kryptowährung
    aus?</i> Universität Paderborn, 2017.
  mla: N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i>
    Universität Paderborn, 2017.
  short: N. N, Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?,
    Universität Paderborn, 2017.
date_created: 2018-11-28T11:41:05Z
date_updated: 2022-11-30T14:16:36Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Bitcoin, Ethereum & Co. Was zeichnet eine gute Kryptowährung aus?
type: mastersthesis
user_id: '477'
year: '2017'
...