---
_id: '1183'
abstract:
- lang: eng
  text: "As our world grows in complexity, companies and employees alike need, more
    than ever before, solutions tailored to their exact needs. Since such tools cannot
    always be purchased off-the-shelf and need to be designed from the ground up,
    developers rely on software requirements. In this paper, we present our vision
    of a syntactic rule-based extraction\r\ntool for software requirements specification
    documents. In contrast to other methods, our tool will allow stakeholders to express
    their needs and wishes in unfiltered natural language, which we believe is essential
    for non-expert users."
author:
- first_name: Matthew
  full_name: Caron, Matthew
  last_name: Caron
- first_name: Frederik Simon
  full_name: Bäumer, Frederik Simon
  id: '38837'
  last_name: Bäumer
- first_name: Michaela
  full_name: Geierhos, Michaela
  id: '42496'
  last_name: Geierhos
  orcid: 0000-0002-8180-5606
citation:
  ama: 'Caron M, Bäumer FS, Geierhos M. Back to Basics: Extracting Software Requirements
    with a Syntactic Approach. In: Schmid K, Spoletini P, Ben Charrada E, et al.,
    eds. <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies
    Track, and Poster Track Co-Located with the 23rd International Conference on Requirements
    Engineering: Foundation for Software Quality (REFSQ 2018)</i>. Vol 2075. CEUR
    Workshop Proceedings. CEUR-WS.org; 2018.'
  apa: 'Caron, M., Bäumer, F. S., &#38; Geierhos, M. (2018). Back to Basics: Extracting
    Software Requirements with a Syntactic Approach. In K. Schmid, P. Spoletini, E.
    Ben Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, … A. Zamansky (Eds.), <i>Joint
    Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and
    Poster Track co-located with the 23rd International Conference on Requirements
    Engineering: Foundation for Software Quality (REFSQ 2018)</i> (Vol. 2075). Utrecht,
    The Netherlands: CEUR-WS.org.'
  bibtex: '@inproceedings{Caron_Bäumer_Geierhos_2018, series={CEUR Workshop Proceedings},
    title={Back to Basics: Extracting Software Requirements with a Syntactic Approach},
    volume={2075}, booktitle={Joint Proceedings of REFSQ-2018 Workshops, Doctoral
    Symposium, Live Studies Track, and Poster Track co-located with the 23rd International
    Conference on Requirements Engineering: Foundation for Software Quality (REFSQ
    2018)}, publisher={CEUR-WS.org}, author={Caron, Matthew and Bäumer, Frederik Simon
    and Geierhos, Michaela}, editor={Schmid, Klaus and Spoletini, Paola and Ben Charrada,
    Eya and Chisik, Yoram and Dalpiaz, Fabiano and Ferrari, Alessio and Forbrig, Peter
    and Franch, Xavier and Kirikova, Marite and Madhavji, Nazim and et al.Editors},
    year={2018}, collection={CEUR Workshop Proceedings} }'
  chicago: 'Caron, Matthew, Frederik Simon Bäumer, and Michaela Geierhos. “Back to
    Basics: Extracting Software Requirements with a Syntactic Approach.” In <i>Joint
    Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and
    Poster Track Co-Located with the 23rd International Conference on Requirements
    Engineering: Foundation for Software Quality (REFSQ 2018)</i>, edited by Klaus
    Schmid, Paola Spoletini, Eya Ben Charrada, Yoram Chisik, Fabiano Dalpiaz, Alessio
    Ferrari, Peter Forbrig, et al., Vol. 2075. CEUR Workshop Proceedings. CEUR-WS.org,
    2018.'
  ieee: 'M. Caron, F. S. Bäumer, and M. Geierhos, “Back to Basics: Extracting Software
    Requirements with a Syntactic Approach,” in <i>Joint Proceedings of REFSQ-2018
    Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located
    with the 23rd International Conference on Requirements Engineering: Foundation
    for Software Quality (REFSQ 2018)</i>, Utrecht, The Netherlands, 2018, vol. 2075.'
  mla: 'Caron, Matthew, et al. “Back to Basics: Extracting Software Requirements with
    a Syntactic Approach.” <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral
    Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International
    Conference on Requirements Engineering: Foundation for Software Quality (REFSQ
    2018)</i>, edited by Klaus Schmid et al., vol. 2075, CEUR-WS.org, 2018.'
  short: 'M. Caron, F.S. Bäumer, M. Geierhos, in: K. Schmid, P. Spoletini, E. Ben
    Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, P. Forbrig, X. Franch, M. Kirikova,
    N. Madhavji, C. Palomares, J. Ralyté, M. Sabetzadeh, P. Sawyer, D. van der Linden,
    A. Zamansky (Eds.), Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium,
    Live Studies Track, and Poster Track Co-Located with the 23rd International Conference
    on Requirements Engineering: Foundation for Software Quality (REFSQ 2018), CEUR-WS.org,
    2018.'
conference:
  end_date: 2018-03-19
  location: Utrecht, The Netherlands
  name: 1st Workshop on Natural Language Processing for Requirements Engineering (NLP4RE)
  start_date: 2018-03-19
date_created: 2018-03-02T09:28:59Z
date_updated: 2022-01-06T06:51:11Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
editor:
- first_name: Klaus
  full_name: Schmid, Klaus
  last_name: Schmid
- first_name: Paola
  full_name: Spoletini, Paola
  last_name: Spoletini
- first_name: Eya
  full_name: Ben Charrada, Eya
  last_name: Ben Charrada
- first_name: Yoram
  full_name: Chisik, Yoram
  last_name: Chisik
- first_name: Fabiano
  full_name: Dalpiaz, Fabiano
  last_name: Dalpiaz
- first_name: Alessio
  full_name: Ferrari, Alessio
  last_name: Ferrari
- first_name: Peter
  full_name: Forbrig, Peter
  last_name: Forbrig
- first_name: Xavier
  full_name: Franch, Xavier
  last_name: Franch
- first_name: Marite
  full_name: Kirikova, Marite
  last_name: Kirikova
- first_name: Nazim
  full_name: Madhavji, Nazim
  last_name: Madhavji
- first_name: Cristina
  full_name: Palomares, Cristina
  last_name: Palomares
- first_name: Jolita
  full_name: Ralyté, Jolita
  last_name: Ralyté
- first_name: Mehrdad
  full_name: Sabetzadeh, Mehrdad
  last_name: Sabetzadeh
- first_name: Pete
  full_name: Sawyer, Pete
  last_name: Sawyer
- first_name: Dirk
  full_name: van der Linden, Dirk
  last_name: van der Linden
- first_name: Anna
  full_name: Zamansky, Anna
  last_name: Zamansky
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:40:58Z
  date_updated: 2018-11-02T14:40:58Z
  file_id: '5279'
  file_name: NLP4RE_paper5.pdf
  file_size: 254814
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:40:58Z
has_accepted_license: '1'
intvolume: '      2075'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://ceur-ws.org/Vol-2075/NLP4RE_paper5.pdf
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publication: 'Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live
  Studies Track, and Poster Track co-located with the 23rd International Conference
  on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)'
publication_identifier:
  issn:
  - 1613-0073
publication_status: published
publisher: CEUR-WS.org
quality_controlled: '1'
series_title: CEUR Workshop Proceedings
status: public
title: 'Back to Basics: Extracting Software Requirements with a Syntactic Approach'
type: conference
user_id: '477'
volume: 2075
year: '2018'
...
---
_id: '1186'
author:
- first_name: Arne
  full_name: Kemper, Arne
  last_name: Kemper
citation:
  ama: Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn; 2018.
  apa: Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn.
  bibtex: '@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games
    via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne},
    year={2018} }'
  chicago: Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  ieee: A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  mla: Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions</i>. Universität Paderborn, 2018.
  short: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential
    Functions, Universität Paderborn, 2018.
date_created: 2018-03-02T13:47:57Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
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: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Pure Nash Equilibria in Robust Congestion Games via Potential Functions
type: mastersthesis
user_id: '14052'
year: '2018'
...
---
_id: '1187'
author:
- first_name: Marcel
  full_name: Nachtigall, Marcel
  last_name: Nachtigall
citation:
  ama: Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model</i>. Universität Paderborn; 2018.
  apa: Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition
    Game Model</i>. Universität Paderborn.
  bibtex: '@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player
    Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall,
    Marcel}, year={2018} }'
  chicago: Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player
    Composition Game Model</i>. Universität Paderborn, 2018.
  ieee: M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition
    Game Model</i>. Universität Paderborn, 2018.
  mla: Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model</i>. Universität Paderborn, 2018.
  short: M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition
    Game Model, Universität Paderborn, 2018.
date_created: 2018-03-02T13:49:39Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
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: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Scenario-driven Strategy Analysis in a n-player Composition Game Model
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1188'
author:
- first_name: Jérôme
  full_name: Kempf, Jérôme
  last_name: Kempf
citation:
  ama: Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn; 2018.
  apa: Kempf, J. (2018). <i>Learning deterministic bandit behaviour form compositions</i>.
    Universität Paderborn.
  bibtex: '@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions},
    publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }'
  chicago: Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn, 2018.
  ieee: J. Kempf, <i>Learning deterministic bandit behaviour form compositions</i>.
    Universität Paderborn, 2018.
  mla: Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>.
    Universität Paderborn, 2018.
  short: J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität
    Paderborn, 2018.
date_created: 2018-03-02T13:51:14Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
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: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Learning deterministic bandit behaviour form compositions
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1208'
author:
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
citation:
  ama: Schwabe A. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>.
    Universität Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-287">10.17619/UNIPB/1-287</a>
  apa: Schwabe, A. (2018). <i>Data-Centre Traffic Optimisation using Software-Defined
    Networks</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-287">https://doi.org/10.17619/UNIPB/1-287</a>
  bibtex: '@book{Schwabe_2018, title={Data-Centre Traffic Optimisation using Software-Defined
    Networks}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-287">10.17619/UNIPB/1-287</a>},
    publisher={Universität Paderborn}, author={Schwabe, Arne}, year={2018} }'
  chicago: Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined
    Networks</i>. Universität Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-287">https://doi.org/10.17619/UNIPB/1-287</a>.
  ieee: A. Schwabe, <i>Data-Centre Traffic Optimisation using Software-Defined Networks</i>.
    Universität Paderborn, 2018.
  mla: Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>.
    Universität Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-287">10.17619/UNIPB/1-287</a>.
  short: A. Schwabe, Data-Centre Traffic Optimisation Using Software-Defined Networks,
    Universität Paderborn, 2018.
date_created: 2018-03-13T10:22:51Z
date_updated: 2022-01-06T06:51:17Z
department:
- _id: '75'
doi: 10.17619/UNIPB/1-287
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subproject A2
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
title: Data-Centre Traffic Optimisation using Software-Defined Networks
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '15206'
abstract:
- lang: eng
  text: We show that the Boston school choice mechanism (BM), the student proposing
    deferred acceptance algorithm (DA) and the top trading cycles algorithm (TTC)
    generate the same outcome when the colleges’ priorities are modified according
    to students’ preferences in a “first preferences first” manner. This outcome coincides
    with the BM outcome under original priorities. As a result, the DA and TTC mechanism
    that are non-manipulable under original priorities become vulnerable to strategic
    behavior.
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  last_name: Haake
- first_name: Nadja
  full_name: Stroh-Maraun, Nadja
  last_name: Stroh-Maraun
citation:
  ama: Haake C-J, Stroh-Maraun N. <i>A Note on Manipulability in School Choice with
    Reciprocal Preferences</i>. Vol 111. CIE Working Paper Series, Paderborn University;
    2018.
  apa: Haake, C.-J., &#38; Stroh-Maraun, N. (2018). <i>A Note on Manipulability in
    School Choice with Reciprocal Preferences</i> (Vol. 111). CIE Working Paper Series,
    Paderborn University.
  bibtex: '@book{Haake_Stroh-Maraun_2018, series={Working Papers CIE}, title={A Note
    on Manipulability in School Choice with Reciprocal Preferences}, volume={111},
    publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen
    and Stroh-Maraun, Nadja}, year={2018}, collection={Working Papers CIE} }'
  chicago: Haake, Claus-Jochen, and Nadja Stroh-Maraun. <i>A Note on Manipulability
    in School Choice with Reciprocal Preferences</i>. Vol. 111. Working Papers CIE.
    CIE Working Paper Series, Paderborn University, 2018.
  ieee: C.-J. Haake and N. Stroh-Maraun, <i>A Note on Manipulability in School Choice
    with Reciprocal Preferences</i>, vol. 111. CIE Working Paper Series, Paderborn
    University, 2018.
  mla: Haake, Claus-Jochen, and Nadja Stroh-Maraun. <i>A Note on Manipulability in
    School Choice with Reciprocal Preferences</i>. Vol. 111, CIE Working Paper Series,
    Paderborn University, 2018.
  short: C.-J. Haake, N. Stroh-Maraun, A Note on Manipulability in School Choice with
    Reciprocal Preferences, CIE Working Paper Series, Paderborn University, 2018.
date_created: 2019-11-28T10:03:40Z
date_updated: 2022-01-06T06:52:17Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2019-11-28T10:07:24Z
  date_updated: 2019-11-28T10:07:24Z
  file_id: '15209'
  file_name: WP - A Note on Manipulability in Scho ol Choice with Reciprocal Preferences.pdf
  file_size: 328319
  relation: main_file
  success: 1
file_date_updated: 2019-11-28T10:07:24Z
has_accepted_license: '1'
intvolume: '       111'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: A Note on Manipulability in School Choice with Reciprocal Preferences
type: working_paper
user_id: '65453'
volume: 111
year: '2018'
...
---
_id: '15207'
abstract:
- lang: eng
  text: 'The purpose of the present study is to experimentally test a version of the
    classical Chain Store Game (CSG) paradox, proposed by Trockel (1986), and determine
    whether one of the two theories of Induction and Deterrence, which were originally
    tested competitively by Selten (1978), may better account for the results. With
    complete and perfect information, the CSG of Selten (1978) was designed to analyze
    the role of reputation in repeated market interactions. Its results were discussed
    in two diﬀerent ways: one is based on backward induction, and the other is intuitively
    derived from a deterrence argument. As the two explanations are incompatible,
    alternative models have been proposed to understand them better. The alternative
    game proposed by Trockel is an imperfect information version of the CSG in which
    the order of the two players is changed in each round and the ’Out-Aggressive’
    equilibrium is used to build reputation. The existence of more than one equilibrium
    is the basis for the building of reputation. To the best of my knowledge, this
    study is the ﬁrst attempt to experimentally test this alternative game with the
    same purpose.'
author:
- first_name: Papatya
  full_name: Duman, Papatya
  last_name: Duman
citation:
  ama: Duman P. <i>Does Informational Equivalence Preserve Strategic Behavior? An
    Experimental Study on Trockel’s Game</i>. Vol 117. CIE Working Paper Series, Paderborn
    University; 2018.
  apa: Duman, P. (2018). <i>Does Informational Equivalence Preserve Strategic Behavior?
    An Experimental Study on Trockel’s Game</i> (Vol. 117). CIE Working Paper Series,
    Paderborn University.
  bibtex: '@book{Duman_2018, series={Working Papers CIE}, title={Does Informational
    Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game},
    volume={117}, publisher={CIE Working Paper Series, Paderborn University}, author={Duman,
    Papatya}, year={2018}, collection={Working Papers CIE} }'
  chicago: Duman, Papatya. <i>Does Informational Equivalence Preserve Strategic Behavior?
    An Experimental Study on Trockel’s Game</i>. Vol. 117. Working Papers CIE. CIE
    Working Paper Series, Paderborn University, 2018.
  ieee: P. Duman, <i>Does Informational Equivalence Preserve Strategic Behavior? An
    Experimental Study on Trockel’s Game</i>, vol. 117. CIE Working Paper Series,
    Paderborn University, 2018.
  mla: Duman, Papatya. <i>Does Informational Equivalence Preserve Strategic Behavior?
    An Experimental Study on Trockel’s Game</i>. Vol. 117, CIE Working Paper Series,
    Paderborn University, 2018.
  short: P. Duman, Does Informational Equivalence Preserve Strategic Behavior? An
    Experimental Study on Trockel’s Game, CIE Working Paper Series, Paderborn University,
    2018.
date_created: 2019-11-28T10:06:11Z
date_updated: 2022-01-06T06:52:18Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2019-11-28T10:06:57Z
  date_updated: 2019-11-28T10:06:57Z
  file_id: '15208'
  file_name: WP - Does Informational Equivalence Preserve Strategic Behavior_ An Experimental
    Study on Trockel's Game.pdf
  file_size: 678790
  relation: main_file
  success: 1
file_date_updated: 2019-11-28T10:06:57Z
has_accepted_license: '1'
intvolume: '       117'
keyword:
- Chain Store Game
- reputation building
- entry deterrence
- Trockel's game
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: Does Informational Equivalence Preserve Strategic Behavior? An Experimental
  Study on Trockel's Game
type: working_paper
user_id: '65453'
volume: 117
year: '2018'
...
---
_id: '1029'
abstract:
- lang: eng
  text: We present a game-theoretic model of the repression–dissent nexus, focusing
    on preemptive repression. A small group of instigating dissidents triggers a protest
    if each dissident participates. The dissidents face random checks by security
    forces, and when an individual dissident is caught while preparing to participate,
    he or she is prevented from doing so. Each dissident can invest in countermeasures,
    which make checks ineffective. For large benefits of protest, higher preemptive
    repression in the form of a higher number of checks has a deterrence effect and
    makes dissidents less prone to invest in countermeasures, decreasing the probability
    of protest. For small benefits of protest, higher preemptive repression instead
    has a backfiring effect. Both myopic and farsighted governments avoid the backfiring
    effect by setting low levels of preemptive repression (velvet-glove strategy).
    However, only a farsighted government is able to exploit the deterrence effect
    by maintaining a high level of preemptive repression (iron-fist strategy).
author:
- first_name: Kris
  full_name: De Jaegher, Kris
  last_name: De Jaegher
- first_name: Britta
  full_name: Hoyer, Britta
  id: '42447'
  last_name: Hoyer
citation:
  ama: 'De Jaegher K, Hoyer B. Preemptive Repression: Deterrence, Backfiring, Iron
    Fists and Velvet Gloves. <i>Journal of Conflict Resolution</i>. 2018;63(2):502--527.
    doi:<a href="https://doi.org/10.1177/0022002717750450">10.1177/0022002717750450</a>'
  apa: 'De Jaegher, K., &#38; Hoyer, B. (2018). Preemptive Repression: Deterrence,
    Backfiring, Iron Fists and Velvet Gloves. <i>Journal of Conflict Resolution</i>,
    <i>63</i>(2), 502--527. <a href="https://doi.org/10.1177/0022002717750450">https://doi.org/10.1177/0022002717750450</a>'
  bibtex: '@article{De Jaegher_Hoyer_2018, title={Preemptive Repression: Deterrence,
    Backfiring, Iron Fists and Velvet Gloves}, volume={63}, DOI={<a href="https://doi.org/10.1177/0022002717750450">10.1177/0022002717750450</a>},
    number={2}, journal={Journal of Conflict Resolution}, publisher={SAGE Publications},
    author={De Jaegher, Kris and Hoyer, Britta}, year={2018}, pages={502--527} }'
  chicago: 'De Jaegher, Kris, and Britta Hoyer. “Preemptive Repression: Deterrence,
    Backfiring, Iron Fists and Velvet Gloves.” <i>Journal of Conflict Resolution</i>
    63, no. 2 (2018): 502--527. <a href="https://doi.org/10.1177/0022002717750450">https://doi.org/10.1177/0022002717750450</a>.'
  ieee: 'K. De Jaegher and B. Hoyer, “Preemptive Repression: Deterrence, Backfiring,
    Iron Fists and Velvet Gloves,” <i>Journal of Conflict Resolution</i>, vol. 63,
    no. 2, pp. 502--527, 2018.'
  mla: 'De Jaegher, Kris, and Britta Hoyer. “Preemptive Repression: Deterrence, Backfiring,
    Iron Fists and Velvet Gloves.” <i>Journal of Conflict Resolution</i>, vol. 63,
    no. 2, SAGE Publications, 2018, pp. 502--527, doi:<a href="https://doi.org/10.1177/0022002717750450">10.1177/0022002717750450</a>.'
  short: K. De Jaegher, B. Hoyer, Journal of Conflict Resolution 63 (2018) 502--527.
date_created: 2017-12-06T10:52:44Z
date_updated: 2022-01-06T06:50:35Z
ddc:
- '000'
department:
- _id: '280'
- _id: '475'
doi: 10.1177/0022002717750450
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T16:07:11Z
  date_updated: 2018-11-02T16:07:11Z
  file_id: '5323'
  file_name: 0022002717750450.pdf
  file_size: 335051
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T16:07:11Z
has_accepted_license: '1'
intvolume: '        63'
issue: '2'
language:
- iso: eng
page: 502--527
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Journal of Conflict Resolution
publisher: SAGE Publications
status: public
title: 'Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves'
type: journal_article
user_id: '477'
volume: 63
year: '2018'
...
---
_id: '1031'
author:
- first_name: Daniel
  full_name: Kaimann, Daniel
  id: '18949'
  last_name: Kaimann
- first_name: Nadja
  full_name: Stroh-Maraun, Nadja
  id: '13264'
  last_name: Stroh-Maraun
- first_name: Joe
  full_name: Cox, Joe
  last_name: Cox
citation:
  ama: 'Kaimann D, Stroh-Maraun N, Cox J. Variety in the video game industry: An empirical
    study of the Wundt curve. <i>Managerial and Decision Economics</i>. 2018;39(3):354-362.
    doi:<a href="https://doi.org/10.1002/mde.2909">10.1002/mde.2909</a>'
  apa: 'Kaimann, D., Stroh-Maraun, N., &#38; Cox, J. (2018). Variety in the video
    game industry: An empirical study of the Wundt curve. <i>Managerial and Decision
    Economics</i>, <i>39</i>(3), 354–362. <a href="https://doi.org/10.1002/mde.2909">https://doi.org/10.1002/mde.2909</a>'
  bibtex: '@article{Kaimann_Stroh-Maraun_Cox_2018, title={Variety in the video game
    industry: An empirical study of the Wundt curve}, volume={39}, DOI={<a href="https://doi.org/10.1002/mde.2909">10.1002/mde.2909</a>},
    number={3}, journal={Managerial and Decision Economics}, publisher={Wiley-Blackwell},
    author={Kaimann, Daniel and Stroh-Maraun, Nadja and Cox, Joe}, year={2018}, pages={354–362}
    }'
  chicago: 'Kaimann, Daniel, Nadja Stroh-Maraun, and Joe Cox. “Variety in the Video
    Game Industry: An Empirical Study of the Wundt Curve.” <i>Managerial and Decision
    Economics</i> 39, no. 3 (2018): 354–62. <a href="https://doi.org/10.1002/mde.2909">https://doi.org/10.1002/mde.2909</a>.'
  ieee: 'D. Kaimann, N. Stroh-Maraun, and J. Cox, “Variety in the video game industry:
    An empirical study of the Wundt curve,” <i>Managerial and Decision Economics</i>,
    vol. 39, no. 3, pp. 354–362, 2018.'
  mla: 'Kaimann, Daniel, et al. “Variety in the Video Game Industry: An Empirical
    Study of the Wundt Curve.” <i>Managerial and Decision Economics</i>, vol. 39,
    no. 3, Wiley-Blackwell, 2018, pp. 354–62, doi:<a href="https://doi.org/10.1002/mde.2909">10.1002/mde.2909</a>.'
  short: D. Kaimann, N. Stroh-Maraun, J. Cox, Managerial and Decision Economics 39
    (2018) 354–362.
date_created: 2017-12-06T15:16:58Z
date_updated: 2022-01-06T06:50:36Z
ddc:
- '040'
department:
- _id: '205'
- _id: '183'
doi: 10.1002/mde.2909
file:
- access_level: closed
  content_type: application/pdf
  creator: nmaraun
  date_created: 2018-08-15T07:21:08Z
  date_updated: 2018-08-15T07:21:08Z
  file_id: '3907'
  file_name: Variety in the video game industry - An empirical study of the Wundt
    curve.pdf
  file_size: 434901
  relation: main_file
  success: 1
file_date_updated: 2018-08-15T07:21:08Z
has_accepted_license: '1'
intvolume: '        39'
issue: '3'
language:
- iso: eng
page: 354 - 362
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Managerial and Decision Economics
publication_identifier:
  issn:
  - 0143-6570
publication_status: published
publisher: Wiley-Blackwell
status: public
title: 'Variety in the video game industry: An empirical study of the Wundt curve'
type: journal_article
user_id: '65453'
volume: 39
year: '2018'
...
---
_id: '1369'
abstract:
- lang: eng
  text: In budget games, players compete over resources with finite budgets. For every
    resource, a player has a specific demand and as a strategy, he chooses a subset
    of resources. If the total demand on a resource does not exceed its budget, the
    utility of each player who chose that resource equals his demand. Otherwise, the
    budget is shared proportionally. In the general case, pure Nash equilibria (NE)
    do not exist for such games. In this paper, we consider the natural classes of
    singleton and matroid budget games with additional constraints and show that for
    each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
    function to prove that every matroid budget game has an approximate pure NE which
    depends on the largest ratio between the different demands of each individual
    player.
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted
    budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash
    equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>.
    <a href="https://doi.org/10.1007/s10878-018-0269-7">https://doi.org/10.1007/s10878-018-0269-7</a>
  bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria
    in restricted budget games}, DOI={<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>},
    journal={Journal of Combinatorial Optimization}, publisher={Springer Nature},
    author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik,
    Alexander}, year={2018} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial
    Optimization</i>, 2018. <a href="https://doi.org/10.1007/s10878-018-0269-7">https://doi.org/10.1007/s10878-018-0269-7</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria
    in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.
  mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
    <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href="https://doi.org/10.1007/s10878-018-0269-7">10.1007/s10878-018-0269-7</a>.
  short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial
    Optimization (2018).
date_created: 2018-03-18T11:12:49Z
date_updated: 2022-01-06T06:51:42Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-018-0269-7
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:56:13Z
  date_updated: 2018-10-31T16:56:13Z
  file_id: '5225'
  file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf
  file_size: 561187
  relation: main_file
file_date_updated: 2018-10-31T16:56:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: Journal of Combinatorial Optimization
publication_identifier:
  issn:
  - 1382-6905
  - 1573-2886
publication_status: epub_ahead
publisher: Springer Nature
status: public
title: Pure Nash equilibria in restricted budget games
type: journal_article
user_id: '14052'
year: '2018'
...
---
_id: '5141'
author:
- first_name: Alexander
  full_name: Reger, Alexander
  last_name: Reger
citation:
  ama: Reger A. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler
    Geräte auf digitale Märkte</i>.; 2018.
  apa: Reger, A. (2018). <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss
    mobiler Geräte auf digitale Märkte</i>.
  bibtex: '@book{Reger_2018, place={Universität Paderborn}, title={Wenn Marketing
    mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte}, author={Reger,
    Alexander}, year={2018} }'
  chicago: Reger, Alexander. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss
    mobiler Geräte auf digitale Märkte</i>. Universität Paderborn, 2018.
  ieee: A. Reger, <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler
    Geräte auf digitale Märkte</i>. Universität Paderborn, 2018.
  mla: Reger, Alexander. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss
    mobiler Geräte auf digitale Märkte</i>. 2018.
  short: A. Reger, Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler
    Geräte auf digitale Märkte, Universität Paderborn, 2018.
date_created: 2018-10-31T09:10:50Z
date_updated: 2022-07-14T13:03:22Z
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: Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale
  Märkte
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '5539'
author:
- first_name: Viet Huy
  full_name: Tran, Viet Huy
  last_name: Tran
citation:
  ama: Tran VH. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>.;
    2018.
  apa: Tran, V. H. (2018). <i>Höhere Verkaufszahlen durch gute Online-Bewertungen
    - Ein Literaturüberblick</i>.
  bibtex: '@book{Tran_2018, place={Universität Paderborn}, title={Höhere Verkaufszahlen
    durch gute Online-Bewertungen - Ein Literaturüberblick}, author={Tran, Viet Huy},
    year={2018} }'
  chicago: Tran, Viet Huy. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen
    - Ein Literaturüberblick</i>. Universität Paderborn, 2018.
  ieee: V. H. Tran, <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>.
    Universität Paderborn, 2018.
  mla: Tran, Viet Huy. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein
    Literaturüberblick</i>. 2018.
  short: V.H. Tran, Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick,
    Universität Paderborn, 2018.
date_created: 2018-11-13T14:39:58Z
date_updated: 2022-07-14T13:02:54Z
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: Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '5150'
author:
- first_name: Raphael
  full_name: Mues, Raphael
  last_name: Mues
citation:
  ama: Mues R. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen</i>.; 2018.
  apa: Mues, R. (2018). <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen</i>.
  bibtex: '@book{Mues_2018, place={Universität Paderborn}, title={Eine experimentelle
    Untersuchung der Wahrnehmung professioneller Online Bewertungen}, author={Mues,
    Raphael}, year={2018} }'
  chicago: Mues, Raphael. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen</i>. Universität Paderborn, 2018.
  ieee: R. Mues, <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen</i>. Universität Paderborn, 2018.
  mla: Mues, Raphael. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen</i>. 2018.
  short: R. Mues, Eine experimentelle Untersuchung der Wahrnehmung professioneller
    Online Bewertungen, Universität Paderborn, 2018.
date_created: 2018-10-31T09:26:36Z
date_updated: 2022-07-14T13:03:15Z
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: Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '5432'
author:
- first_name: Johannes
  full_name: Dierkes, Johannes
  last_name: Dierkes
citation:
  ama: Dierkes J. <i>Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy</i>.;
    2018.
  apa: Dierkes, J. (2018). <i>Sharing is Caring - Ein Literaturüberblick über die
    Sharing Economy</i>.
  bibtex: '@book{Dierkes_2018, place={Universität Paderborn}, title={Sharing is Caring
    - Ein Literaturüberblick über die Sharing Economy}, author={Dierkes, Johannes},
    year={2018} }'
  chicago: Dierkes, Johannes. <i>Sharing Is Caring - Ein Literaturüberblick Über Die
    Sharing Economy</i>. Universität Paderborn, 2018.
  ieee: J. Dierkes, <i>Sharing is Caring - Ein Literaturüberblick über die Sharing
    Economy</i>. Universität Paderborn, 2018.
  mla: Dierkes, Johannes. <i>Sharing Is Caring - Ein Literaturüberblick Über Die Sharing
    Economy</i>. 2018.
  short: J. Dierkes, Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy,
    Universität Paderborn, 2018.
date_created: 2018-11-08T11:57:25Z
date_updated: 2022-07-14T13:03:08Z
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: Sharing is Caring - Ein Literaturüberblick über die Sharing Economy
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '5470'
author:
- first_name: Jiajia
  full_name: Hoffmeister, Jiajia
  last_name: Hoffmeister
citation:
  ama: 'Hoffmeister J. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.;
    2018.'
  apa: 'Hoffmeister, J. (2018). <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.'
  bibtex: '@book{Hoffmeister_2018, place={Universität Paderborn}, title={Evaluation
    von Taxonomien: Ein Literaturüberblick}, author={Hoffmeister, Jiajia}, year={2018}
    }'
  chicago: 'Hoffmeister, Jiajia. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.
    Universität Paderborn, 2018.'
  ieee: 'J. Hoffmeister, <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.
    Universität Paderborn, 2018.'
  mla: 'Hoffmeister, Jiajia. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.
    2018.'
  short: 'J. Hoffmeister, Evaluation von Taxonomien: Ein Literaturüberblick, Universität
    Paderborn, 2018.'
date_created: 2018-11-12T09:16:54Z
date_updated: 2022-07-14T13:03:01Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: 'Evaluation von Taxonomien: Ein Literaturüberblick'
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4764'
author:
- first_name: Andreas
  full_name: Valentin, Andreas
  last_name: Valentin
citation:
  ama: Valentin A. <i>Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität
    Paderborn; 2018.
  apa: Valentin, A. (2018). <i>Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität
    Paderborn.
  bibtex: '@book{Valentin_2018, title={Zweiseitige Märkte und Plattformökonomie in
    der Information Systems-Forschung - Ein klassifizierender Literaturüberblick},
    publisher={Universität Paderborn}, author={Valentin, Andreas}, year={2018} }'
  chicago: Valentin, Andreas. <i>Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität
    Paderborn, 2018.
  ieee: A. Valentin, <i>Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität
    Paderborn, 2018.
  mla: Valentin, Andreas. <i>Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität
    Paderborn, 2018.
  short: A. Valentin, Zweiseitige Märkte und Plattformökonomie in der Information
    Systems-Forschung - Ein klassifizierender Literaturüberblick, Universität Paderborn,
    2018.
date_created: 2018-10-16T13:45:46Z
date_updated: 2022-07-14T13:04:03Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung
  - Ein klassifizierender Literaturüberblick
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4395'
author:
- first_name: René
  full_name: Heukrodt, René
  last_name: Heukrodt
citation:
  ama: Heukrodt R. <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung
    rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung
    der neuen DSGVO-Richtlinien</i>.; 2018.
  apa: Heukrodt, R. (2018). <i>Anwendung von verhaltenspsychologischen Theorien zur
    Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter
    Berücksichtigung der neuen DSGVO-Richtlinien</i>.
  bibtex: '@book{Heukrodt_2018, place={Universität Paderborn}, title={Anwendung von
    verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen
    im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien}, author={Heukrodt,
    René}, year={2018} }'
  chicago: Heukrodt, René. <i>Anwendung von verhaltenspsychologischen Theorien zur
    Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter
    Berücksichtigung der neuen DSGVO-Richtlinien</i>. Universität Paderborn, 2018.
  ieee: R. Heukrodt, <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung
    rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung
    der neuen DSGVO-Richtlinien</i>. Universität Paderborn, 2018.
  mla: Heukrodt, René. <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung
    rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung
    der neuen DSGVO-Richtlinien</i>. 2018.
  short: R. Heukrodt, Anwendung von verhaltenspsychologischen Theorien zur Steigerung
    rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung
    der neuen DSGVO-Richtlinien, Universität Paderborn, 2018.
date_created: 2018-09-14T10:30:04Z
date_updated: 2022-07-14T13:04:16Z
language:
- iso: ger
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: Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer
  Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '3932'
author:
- first_name: Christian
  full_name: Werning, Christian
  last_name: Werning
citation:
  ama: Werning C. <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands
    und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>.;
    2018.
  apa: Werning, C. (2018). <i>Gap Theory of Curiosity - Darstellung des aktuellen
    Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance
    auf einer Crowdsourcing-Plattform</i>.
  bibtex: '@book{Werning_2018, place={Universität Paderborn}, title={Gap Theory of
    Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses
    von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform}, author={Werning,
    Christian}, year={2018} }'
  chicago: Werning, Christian. <i>Gap Theory of Curiosity - Darstellung des aktuellen
    Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance
    auf einer Crowdsourcing-Plattform</i>. Universität Paderborn, 2018.
  ieee: C. Werning, <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands
    und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>.
    Universität Paderborn, 2018.
  mla: Werning, Christian. <i>Gap Theory of Curiosity - Darstellung des aktuellen
    Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance
    auf einer Crowdsourcing-Plattform</i>. 2018.
  short: C. Werning, Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands
    und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform,
    Universität Paderborn, 2018.
date_created: 2018-08-20T07:51:00Z
date_updated: 2022-07-14T13:04:30Z
language:
- iso: ger
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: Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung
  des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4795'
author:
- first_name: Timur Andreas Eduard Wolfgang
  full_name: Werner, Timur Andreas Eduard Wolfgang
  last_name: Werner
citation:
  ama: Werner TAEW. <i>Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische
    Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>.; 2018.
  apa: Werner, T. A. E. W. (2018). <i>Was bewegt Kunden auf Online-Plattformen? -
    Eine semantische Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation</i>.
  bibtex: '@book{Werner_2018, place={Universität Paderborn}, title={Was bewegt Kunden
    auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen mittels
    Latent Dirichlet Allocation}, author={Werner, Timur Andreas Eduard Wolfgang},
    year={2018} }'
  chicago: Werner, Timur Andreas Eduard Wolfgang. <i>Was Bewegt Kunden Auf Online-Plattformen?
    - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>.
    Universität Paderborn, 2018.
  ieee: T. A. E. W. Werner, <i>Was bewegt Kunden auf Online-Plattformen? - Eine semantische
    Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation</i>. Universität
    Paderborn, 2018.
  mla: Werner, Timur Andreas Eduard Wolfgang. <i>Was Bewegt Kunden Auf Online-Plattformen?
    - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>.
    2018.
  short: T.A.E.W. Werner, Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische
    Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation, Universität
    Paderborn, 2018.
date_created: 2018-10-23T07:10:22Z
date_updated: 2022-07-14T13:03:51Z
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: Was bewegt Kunden auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen
  mittels Latent Dirichlet Allocation
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
---
_id: '4560'
author:
- first_name: Marvin Alexander
  full_name: Jongen, Marvin Alexander
  last_name: Jongen
citation:
  ama: Jongen MA. <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens
    von Einheimischen und Reisenden</i>.; 2018.
  apa: Jongen, M. A. (2018). <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse
    des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>.
  bibtex: '@book{Jongen_2018, place={Universität Paderborn}, title={Zu Hause ist es
    am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen
    und Reisenden}, author={Jongen, Marvin Alexander}, year={2018} }'
  chicago: Jongen, Marvin Alexander. <i>Zu Hause ist es am schönsten? Eine deskriptive
    Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. Universität
    Paderborn, 2018.
  ieee: M. A. Jongen, <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des
    Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. Universität Paderborn,
    2018.
  mla: Jongen, Marvin Alexander. <i>Zu Hause ist es am schönsten? Eine deskriptive
    Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. 2018.
  short: M.A. Jongen, Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens
    von Einheimischen und Reisenden, Universität Paderborn, 2018.
date_created: 2018-10-01T09:00:10Z
date_updated: 2022-07-14T13:04:10Z
language:
- iso: ger
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: Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens
  von Einheimischen und Reisenden
type: bachelorsthesis
user_id: '16205'
year: '2018'
...
