---
_id: '306'
author:
- first_name: Christina
  full_name: Kunisch, Christina
  last_name: Kunisch
citation:
  ama: Kunisch C. <i>Diffusion of Innovations in Social Networks</i>. Universität
    Paderborn; 2015.
  apa: Kunisch, C. (2015). <i>Diffusion of Innovations in Social Networks</i>. Universität
    Paderborn.
  bibtex: '@book{Kunisch_2015, title={Diffusion of Innovations in Social Networks},
    publisher={Universität Paderborn}, author={Kunisch, Christina}, year={2015} }'
  chicago: Kunisch, Christina. <i>Diffusion of Innovations in Social Networks</i>.
    Universität Paderborn, 2015.
  ieee: C. Kunisch, <i>Diffusion of Innovations in Social Networks</i>. Universität
    Paderborn, 2015.
  mla: Kunisch, Christina. <i>Diffusion of Innovations in Social Networks</i>. Universität
    Paderborn, 2015.
  short: C. Kunisch, Diffusion of Innovations in Social Networks, Universität Paderborn,
    2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '280'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Diffusion of Innovations in Social Networks
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '308'
author:
- first_name: Alina
  full_name: Reimann, Alina
  last_name: Reimann
citation:
  ama: Reimann A. <i>Die Wirksamkeit von Zertifikaten als Qualitätssignal</i>. Universität
    Paderborn; 2015.
  apa: Reimann, A. (2015). <i>Die Wirksamkeit von Zertifikaten als Qualitätssignal</i>.
    Universität Paderborn.
  bibtex: '@book{Reimann_2015, title={Die Wirksamkeit von Zertifikaten als Qualitätssignal},
    publisher={Universität Paderborn}, author={Reimann, Alina}, year={2015} }'
  chicago: Reimann, Alina. <i>Die Wirksamkeit von Zertifikaten als Qualitätssignal</i>.
    Universität Paderborn, 2015.
  ieee: A. Reimann, <i>Die Wirksamkeit von Zertifikaten als Qualitätssignal</i>. Universität
    Paderborn, 2015.
  mla: Reimann, Alina. <i>Die Wirksamkeit von Zertifikaten als Qualitätssignal</i>.
    Universität Paderborn, 2015.
  short: A. Reimann, Die Wirksamkeit von Zertifikaten als Qualitätssignal, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:55Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Die Wirksamkeit von Zertifikaten als Qualitätssignal
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '309'
author:
- first_name: Barlas
  full_name: Topal, Barlas
  last_name: Topal
citation:
  ama: Topal B. <i>Die Einführung der EU-Merger Guidelines - Effizienz und Wohlfahrtswirkungen</i>.
    Universität Paderborn; 2015.
  apa: Topal, B. (2015). <i>Die Einführung der EU-Merger Guidelines - Effizienz und
    Wohlfahrtswirkungen</i>. Universität Paderborn.
  bibtex: '@book{Topal_2015, title={Die Einführung der EU-Merger Guidelines - Effizienz
    und Wohlfahrtswirkungen}, publisher={Universität Paderborn}, author={Topal, Barlas},
    year={2015} }'
  chicago: Topal, Barlas. <i>Die Einführung der EU-Merger Guidelines - Effizienz und
    Wohlfahrtswirkungen</i>. Universität Paderborn, 2015.
  ieee: B. Topal, <i>Die Einführung der EU-Merger Guidelines - Effizienz und Wohlfahrtswirkungen</i>.
    Universität Paderborn, 2015.
  mla: Topal, Barlas. <i>Die Einführung der EU-Merger Guidelines - Effizienz und Wohlfahrtswirkungen</i>.
    Universität Paderborn, 2015.
  short: B. Topal, Die Einführung der EU-Merger Guidelines - Effizienz und Wohlfahrtswirkungen,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:55Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Die Einführung der EU-Merger Guidelines - Effizienz und Wohlfahrtswirkungen
type: mastersthesis
user_id: '42447'
year: '2015'
...
---
_id: '314'
abstract:
- lang: eng
  text: On an intermediate goods market we allow for vertical and horizontal product
    differentiation and analyze the influence of simultaneous competition for resources
    and customers on the market outcome. Asymmetries between intermediaries cannot
    arise just from distinct product qualities, but also from different production
    technologies. The intermediaries face either price or quantity competition on
    the output market and a monopolistic input supplier on the input market. We find
    that there exist quality and productivity differences such that for quantity competition
    only one intermediary is willing to procure inputs from the input supplier, while
    for price competition both intermediaries are willing to purchase inputs. Considering
    product innovation for symmetric productivities we derive equilibrium conditions
    on the investment costs and compare price and quantity competition. It turns out
    that on the one hand there exist product qualities and degrees of horizontal product
    differentiation for complements such that asymmetric investment equilibria fail
    to exist. On the other hand we find that there also exist product qualities and
    degrees of horizontal product differentiation for substitutes such that existence
    can be guaranteed if the investment costs are chosen accordingly.
author:
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
- first_name: Jochen
  full_name: Manegold, Jochen
  last_name: Manegold
citation:
  ama: Brangewitz S, Manegold J. <i>Competition and Product Innovation of Intermediaries
    in a Differentiated Duopoly</i>. Universität Paderborn; 2015.
  apa: Brangewitz, S., &#38; Manegold, J. (2015). <i>Competition and Product Innovation
    of Intermediaries in a Differentiated Duopoly</i>. Universität Paderborn.
  bibtex: '@book{Brangewitz_Manegold_2015, title={Competition and Product Innovation
    of Intermediaries in a Differentiated Duopoly}, publisher={Universität Paderborn},
    author={Brangewitz, Sonja and Manegold, Jochen}, year={2015} }'
  chicago: Brangewitz, Sonja, and Jochen Manegold. <i>Competition and Product Innovation
    of Intermediaries in a Differentiated Duopoly</i>. Universität Paderborn, 2015.
  ieee: S. Brangewitz and J. Manegold, <i>Competition and Product Innovation of Intermediaries
    in a Differentiated Duopoly</i>. Universität Paderborn, 2015.
  mla: Brangewitz, Sonja, and Jochen Manegold. <i>Competition and Product Innovation
    of Intermediaries in a Differentiated Duopoly</i>. Universität Paderborn, 2015.
  short: S. Brangewitz, J. Manegold, Competition and Product Innovation of Intermediaries
    in a Differentiated Duopoly, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:58:58Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:43:55Z
  date_updated: 2018-03-20T07:43:55Z
  file_id: '1437'
  file_name: 314-PB-2015-04.pdf
  file_size: 631075
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:43:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Competition and Product Innovation of Intermediaries in a Differentiated Duopoly
type: report
user_id: '477'
year: '2015'
...
---
_id: '316'
author:
- first_name: Jannis
  full_name: Pautz, Jannis
  last_name: Pautz
citation:
  ama: Pautz J. <i>Budget Games with Priced Strategies</i>. Universität Paderborn;
    2015.
  apa: Pautz, J. (2015). <i>Budget Games with priced strategies</i>. Universität Paderborn.
  bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität
    Paderborn}, author={Pautz, Jannis}, year={2015} }'
  chicago: Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität
    Paderborn, 2015.
  ieee: J. Pautz, <i>Budget Games with priced strategies</i>. Universität Paderborn,
    2015.
  mla: Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn,
    2015.
  short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:53Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Budget Games with priced strategies
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '270'
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
citation:
  ama: Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>.
    Universität Paderborn; 2015.
  apa: Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-hoc Networks</i>. Universität Paderborn.
  bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
    Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
    Sebastian}, year={2015} }'
  chicago: Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-Hoc Networks</i>. Universität Paderborn, 2015.
  ieee: S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc
    Networks</i>. Universität Paderborn, 2015.
  mla: Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-Hoc Networks</i>. Universität Paderborn, 2015.
  short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:30:02Z
  date_updated: 2018-03-21T09:30:02Z
  file_id: '1476'
  file_name: 270-Dissertation_-_Abshoff.pdf
  file_size: 448614
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
  text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
    of various demands on different resources. The player's utility is at most the
    sum of these demands, provided they are fully satisfied. Every resource has a
    limited capacity and if it is exceeded by the total demand, it has to be split
    between the players. Since these games generally do not have pure Nash equilibria,
    we consider approximate pure Nash equilibria, in which no player can improve her
    utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
    There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
    the demand of each player on a specific resource) such that $\alpha$-approximate
    pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
    $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
    $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
    We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
    For a restricted version of the game, where demands of players only differ slightly
    from each other (e.g. symmetric games), we show that approximate Nash equilibria
    can be reached (and thus also be computed) in polynomial time using the best-response
    dynamic. Finally, we show that a broader class of utility-maximization games (which
    includes BAGs) converges quickly towards states whose social welfare is close
    to the optimum.
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. On Existence and Properties of
    Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: <i>Proceedings
    of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture
    Notes in Computer Science. ; 2015:178-189. doi:<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>'
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2015). On Existence
    and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
    In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory
    (SAGT)</i> (pp. 178–189). <a href="https://doi.org/10.1007/978-3-662-48433-3_14">https://doi.org/10.1007/978-3-662-48433-3_14</a>
  bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
    in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
    Equilibria in Bandwidth Allocation Games}, DOI={<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>},
    booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
    Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
    Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
    Notes in Computer Science} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
    Allocation Games.” In <i>Proceedings of the 8th International Symposium on Algorithmic
    Game Theory (SAGT)</i>, 178–89. Lecture Notes in Computer Science, 2015. <a href="https://doi.org/10.1007/978-3-662-48433-3_14">https://doi.org/10.1007/978-3-662-48433-3_14</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
    of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in <i>Proceedings
    of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015,
    pp. 178–189.
  mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
    Nash Equilibria in Bandwidth Allocation Games.” <i>Proceedings of the 8th International
    Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–89, doi:<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>.
  short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
    8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
  arxiv:
  - '1507.02908'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:29:34Z
  date_updated: 2018-03-21T09:29:34Z
  file_id: '1475'
  file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
  file_size: 256718
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
  (SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
  Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
  text: 'We investigate a non-cooperative game-theoretic model for the formation of
    communication networks by selfish agents. Each agent aims for a central position
    at minimum cost for creating edges. In particular, the general model (Fabrikant
    et al., PODC''03) became popular for studying the structure of the Internet or
    social networks. Despite its significance, locality in this game was first studied
    only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
    which came with a high efficiency loss in terms of quality of equilibria. Our
    main contribution is a new and more optimistic view on locality: agents are limited
    in their knowledge and actions to their local view ranges, but can probe different
    strategies and finally choose the best. We study the influence of our locality
    notion on the hardness of computing best responses, convergence to equilibria,
    and quality of equilibria. Moreover, we compare the strength of local versus non-local
    strategy changes. Our results address the gap between the original model and the
    worst case locality variant. On the bright side, our efficiency results are in
    line with observations from the original model, yet we have a non-constant lower
    bound on the Price of Anarchy.'
author:
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Pascal
  full_name: Lenzner, Pascal
  last_name: Lenzner
citation:
  ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
    In: <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer
    Science (MFCS)</i>. LNCS. ; 2015:248--260. doi:<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>'
  apa: 'Cord-Landwehr, A., &#38; Lenzner, P. (2015). Network Creation Games: Think
    Global - Act Local. In <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i> (pp. 248--260). <a href="https://doi.org/10.1007/978-3-662-48054-0_21">https://doi.org/10.1007/978-3-662-48054-0_21</a>'
  bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
    Creation Games: Think Global - Act Local}, DOI={<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>},
    booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
    Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
    pages={248--260}, collection={LNCS} }'
  chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
    Global - Act Local.” In <i>Proceedings of the 40th Conference on Mathematical
    Foundations of Computer Science (MFCS)</i>, 248--260. LNCS, 2015. <a href="https://doi.org/10.1007/978-3-662-48054-0_21">https://doi.org/10.1007/978-3-662-48054-0_21</a>.'
  ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
    Act Local,” in <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i>, 2015, pp. 248--260.'
  mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
    Global - Act Local.” <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i>, 2015, pp. 248--260, doi:<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>.'
  short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
    Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:27:12Z
  date_updated: 2018-03-21T09:27:12Z
  file_id: '1472'
  file_name: 275-978-3-662-48054-0_21.pdf
  file_size: 279995
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
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 40th Conference on Mathematical Foundations of Computer
  Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '276'
author:
- first_name: Till
  full_name: Hohenberger, Till
  last_name: Hohenberger
citation:
  ama: Hohenberger T. <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn; 2015.
  apa: Hohenberger, T. (2015). <i>Network Creation Games with Interest Groups</i>.
    Universität Paderborn.
  bibtex: '@book{Hohenberger_2015, title={Network Creation Games with Interest Groups},
    publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2015} }'
  chicago: Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>.
    Universität Paderborn, 2015.
  ieee: T. Hohenberger, <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn, 2015.
  mla: Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn, 2015.
  short: T. Hohenberger, Network Creation Games with Interest Groups, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:43Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Network Creation Games with Interest Groups
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
  full_name: Kothe, Nils
  last_name: Kothe
citation:
  ama: Kothe N. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn; 2015.
  apa: Kothe, N. (2015). <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk</i>. Universität Paderborn.
  bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
    year={2015} }'
  chicago: Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen
    im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.
  ieee: N. Kothe, <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn, 2015.
  mla: Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>.
    Universität Paderborn, 2015.
  short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
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: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '278'
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
citation:
  ama: Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De
    Bruijn Graphs</i>. Universität Paderborn; 2015.
  apa: Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn.
  bibtex: '@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted
    Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann,
    Michael}, year={2015} }'
  chicago: Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn, 2015.
  ieee: M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De
    Bruijn Graphs</i>. Universität Paderborn, 2015.
  mla: Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn, 2015.
  short: M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De
    Bruijn Graphs, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:45Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '234'
author:
- first_name: Maria Reinhild
  full_name: Menne, Maria Reinhild
  last_name: Menne
citation:
  ama: Menne MR. <i>Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
    Analyse am Fallbeispiel der Adidas AG</i>. Universität Paderborn; 2015.
  apa: Menne, M. R. (2015). <i>Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine
    wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG</i>. Universität Paderborn.
  bibtex: '@book{Menne_2015, title={Verkaufsbeschränkungen auf Onlinemarktplätzen
    - Eine wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG}, publisher={Universität
    Paderborn}, author={Menne, Maria Reinhild}, year={2015} }'
  chicago: Menne, Maria Reinhild. <i>Verkaufsbeschränkungen auf Onlinemarktplätzen
    - Eine wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG</i>. Universität
    Paderborn, 2015.
  ieee: M. R. Menne, <i>Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
    Analyse am Fallbeispiel der Adidas AG</i>. Universität Paderborn, 2015.
  mla: Menne, Maria Reinhild. <i>Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine
    wettbewerbspolitische Analyse am Fallbeispiel der Adidas AG</i>. Universität Paderborn,
    2015.
  short: M.R. Menne, Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
    Analyse am Fallbeispiel der Adidas AG, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:52Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Verkaufsbeschränkungen auf Onlinemarktplätzen - Eine wettbewerbspolitische
  Analyse am Fallbeispiel der Adidas AG
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '237'
author:
- first_name: Kerstin
  full_name: Ochlast, Kerstin
  last_name: Ochlast
citation:
  ama: Ochlast K. <i>Trust Me, I Am Certified - Wie Die Zertifizierung von Produkten
    Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen</i>. Universität
    Paderborn; 2015.
  apa: Ochlast, K. (2015). <i>Trust Me, I am Certified - Wie die Zertifizierung von
    Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>.
    Universität Paderborn.
  bibtex: '@book{Ochlast_2015, title={Trust Me, I am Certified - Wie die Zertifizierung
    von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen},
    publisher={Universität Paderborn}, author={Ochlast, Kerstin}, year={2015} }'
  chicago: Ochlast, Kerstin. <i>Trust Me, I Am Certified - Wie Die Zertifizierung
    von Produkten Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen</i>.
    Universität Paderborn, 2015.
  ieee: K. Ochlast, <i>Trust Me, I am Certified - Wie die Zertifizierung von Produkten
    und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität
    Paderborn, 2015.
  mla: Ochlast, Kerstin. <i>Trust Me, I Am Certified - Wie Die Zertifizierung von
    Produkten Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen</i>.
    Universität Paderborn, 2015.
  short: K. Ochlast, Trust Me, I Am Certified - Wie Die Zertifizierung von Produkten
    Und Verkäufern Das Vertrauen von Kunden Im Onlinehandel Beeinflussen, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:55:58Z
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Trust Me, I am Certified - Wie die Zertifizierung von Produkten und Verkäufern
  das Vertrauen von Kunden im Onlinehandel beeinflussen
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
  text: We consider online leasing problems in which demands arrive over time and
    need to be served by leasing resources. We introduce a new model for these problems
    such that a resource can be leased for K different durations each incurring a
    different cost (longer leases cost less per time unit). Each demand i can be served
    anytime between its arrival ai and its deadline ai+di by a leased resource. The
    objective is to meet all deadlines while minimizing the total leasing costs. This
    model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
    in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
    where dmax and lmin denote the largest di and the shortest available lease length,
    respectively. We also extend the SetCoverLeasing problem by deadlines and give
    a competitive online algorithm which also improves on existing solutions for the
    original SetCoverLeasing problem.
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
    Demands in Online Leasing Problems. In: <i>Proceedings of the 21st Annual International
    Computing and Combinatorics Conference (COCOON)</i>. Lecture Notes in Computer
    Science. ; 2015:277--288. doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>'
  apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., &#38; Riechers,
    S. (2015). Towards Flexible Demands in Online Leasing Problems. In <i>Proceedings
    of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>
    (pp. 277--288). <a href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>
  bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
    Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
    Problems}, DOI={<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>},
    booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
    Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
    pages={277--288}, collection={Lecture Notes in Computer Science} }'
  chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
    der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
    In <i>Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)</i>, 277--288. Lecture Notes in Computer Science, 2015. <a
    href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>.
  ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
    Flexible Demands in Online Leasing Problems,” in <i>Proceedings of the 21st Annual
    International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288.
  mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
    <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON)</i>, 2015, pp. 277--288, doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>.
  short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
    Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:28:50Z
  date_updated: 2018-03-21T10:28:50Z
  file_id: '1498'
  file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
  file_size: 264482
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
  Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '18003'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
citation:
  ama: Götte T. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>.
    Universität Paderborn; 2015.
  apa: Götte, T. (2015). <i>Covering and Bridging im selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn.
  bibtex: '@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden
    Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten},
    year={2015} }'
  chicago: Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  ieee: T. Götte, <i>Covering and Bridging im selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  mla: Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  short: T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot,
    Universität Paderborn, 2015.
date_created: 2020-08-17T08:18:04Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18005'
author:
- first_name: Christian
  full_name: Korfmacher, Christian
  last_name: Korfmacher
citation:
  ama: Korfmacher C. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität
    Paderborn; 2015.
  apa: Korfmacher, C. (2015). <i>Implementierung und Analyse von Cone-DHT</i>. Universität
    Paderborn.
  bibtex: '@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT},
    publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015}
    }'
  chicago: Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>.
    Universität Paderborn, 2015.
  ieee: C. Korfmacher, <i>Implementierung und Analyse von Cone-DHT</i>. Universität
    Paderborn, 2015.
  mla: Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität
    Paderborn, 2015.
  short: C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn,
    2015.
date_created: 2020-08-17T08:19:47Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Implementierung und Analyse von Cone-DHT
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18006'
author:
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: Sundermeier J. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>.
    Universität Paderborn; 2015.
  apa: Sundermeier, J. (2015). <i>Implementierung eines selbststabilisierenden verteilten
    Stacks</i>. Universität Paderborn.
  bibtex: '@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden
    verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik},
    year={2015} }'
  chicago: Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten
    Stacks</i>. Universität Paderborn, 2015.
  ieee: J. Sundermeier, <i>Implementierung eines selbststabilisierenden verteilten
    Stacks</i>. Universität Paderborn, 2015.
  mla: Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten
    Stacks</i>. Universität Paderborn, 2015.
  short: J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks,
    Universität Paderborn, 2015.
date_created: 2020-08-17T08:20:59Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Implementierung eines selbststabilisierenden verteilten Stacks
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18024'
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
citation:
  ama: Knollmann T. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn; 2015.
  apa: Knollmann, T. (2015). <i>Implementierung einer selbststabilisierenden Datenstruktur
    für das längste gemeinsame Präfix</i>. Universität Paderborn.
  bibtex: '@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden
    Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn},
    author={Knollmann, Till}, year={2015} }'
  chicago: Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.
  ieee: T. Knollmann, <i>Implementierung einer selbststabilisierenden Datenstruktur
    für das längste gemeinsame Präfix</i>. Universität Paderborn, 2015.
  mla: Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.
  short: T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
date_created: 2020-08-18T08:37:33Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Implementierung einer selbststabilisierenden Datenstruktur für das längste
  gemeinsame Präfix
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '228'
abstract:
- lang: eng
  text: 'We investigate the pervasiveness of lying in professional contexts such as
    insurance fraud, tax evasion and untrue job applications. We argue that lying
    in professional contexts share three characterizing features: (1) the gain from
    the dishonest behavior is uncertain, (2) the harm that lying may cause to the
    other party is only indirect and (3) lies are more indirect lies by action or
    written statements. Conducted as a field experiment with a heterogenous group
    of participants during a University ‘‘Open House Day’’, our ‘‘gumball-machineexperiment’’
    provides field evidence on how preferences for lying are shaped in situations
    typically found in professional contexts which we consider to be particularly
    prone to lying behavior compared to other contexts. As a key innovation, our experimental
    design allows measuring exact levels of cheating behavior under anonymous conditions.
    We find clean evidence that cheating is prevalent across all sub groups and that
    more than 32% of the population cheats for their own gain. However, an analysis
    of the cheating rates with respect to highest educational degree and professional
    status reveals that students cheat more than non-students. This finding warrants
    a careful interpretation of generalizing laboratory findings with student subjects
    about the prevalence of cheating in the population.'
author:
- first_name: Rene
  full_name: Fahr, Rene
  id: '111'
  last_name: Fahr
- first_name: Behnud
  full_name: Mir Djawadi, Behnud
  id: '26032'
  last_name: Mir Djawadi
  orcid: 0000-0002-6271-5912
citation:
  ama: 'Fahr R, Mir Djawadi B. “…and they are really lying”: Clean Evidence on the
    Pervasiveness of Cheating in Professional Contexts from a Field Experiment. <i>Journal
    of Economic Psychology</i>. 2015:48-59. doi:<a href="https://doi.org/10.1016/j.joep.2015.03.002">10.1016/j.joep.2015.03.002</a>'
  apa: 'Fahr, R., &#38; Mir Djawadi, B. (2015). “…and they are really lying”: Clean
    Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
    Experiment. <i>Journal of Economic Psychology</i>, 48–59. <a href="https://doi.org/10.1016/j.joep.2015.03.002">https://doi.org/10.1016/j.joep.2015.03.002</a>'
  bibtex: '@article{Fahr_Mir Djawadi_2015, title={“…and they are really lying”: Clean
    Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
    Experiment.}, DOI={<a href="https://doi.org/10.1016/j.joep.2015.03.002">10.1016/j.joep.2015.03.002</a>},
    journal={Journal of Economic Psychology}, publisher={Elsevier}, author={Fahr,
    Rene and Mir Djawadi, Behnud}, year={2015}, pages={48–59} }'
  chicago: 'Fahr, Rene, and Behnud Mir Djawadi. “‘…and They Are Really Lying’: Clean
    Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
    Experiment.” <i>Journal of Economic Psychology</i>, 2015, 48–59. <a href="https://doi.org/10.1016/j.joep.2015.03.002">https://doi.org/10.1016/j.joep.2015.03.002</a>.'
  ieee: 'R. Fahr and B. Mir Djawadi, “‘…and they are really lying’: Clean Evidence
    on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.,”
    <i>Journal of Economic Psychology</i>, pp. 48–59, 2015.'
  mla: 'Fahr, Rene, and Behnud Mir Djawadi. “‘…and They Are Really Lying’: Clean Evidence
    on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.”
    <i>Journal of Economic Psychology</i>, Elsevier, 2015, pp. 48–59, doi:<a href="https://doi.org/10.1016/j.joep.2015.03.002">10.1016/j.joep.2015.03.002</a>.'
  short: R. Fahr, B. Mir Djawadi, Journal of Economic Psychology (2015) 48–59.
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:41Z
ddc:
- '040'
department:
- _id: '179'
doi: 10.1016/j.joep.2015.03.002
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:33:10Z
  date_updated: 2018-03-21T10:33:10Z
  file_id: '1505'
  file_name: 228-1-s2.0-S016748701500029X-main.pdf
  file_size: 1341791
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:33:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 48-59
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Journal of Economic Psychology
publisher: Elsevier
status: public
title: '“…and they are really lying”: Clean Evidence on the Pervasiveness of Cheating
  in Professional Contexts from a Field Experiment.'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '229'
author:
- first_name: Hannah
  full_name: Schulz, Hannah
  last_name: Schulz
citation:
  ama: Schulz H. <i>Zur Verbreitung von Informationen in sozialen Netzwerken - eine
    wirtschaftspolitische Analyse</i>. Universität Paderborn; 2015.
  apa: Schulz, H. (2015). <i>Zur Verbreitung von Informationen in sozialen Netzwerken
    - eine wirtschaftspolitische Analyse</i>. Universität Paderborn.
  bibtex: '@book{Schulz_2015, title={Zur Verbreitung von Informationen in sozialen
    Netzwerken - eine wirtschaftspolitische Analyse}, publisher={Universität Paderborn},
    author={Schulz, Hannah}, year={2015} }'
  chicago: Schulz, Hannah. <i>Zur Verbreitung von Informationen in sozialen Netzwerken
    - eine wirtschaftspolitische Analyse</i>. Universität Paderborn, 2015.
  ieee: H. Schulz, <i>Zur Verbreitung von Informationen in sozialen Netzwerken - eine
    wirtschaftspolitische Analyse</i>. Universität Paderborn, 2015.
  mla: Schulz, Hannah. <i>Zur Verbreitung von Informationen in sozialen Netzwerken
    - eine wirtschaftspolitische Analyse</i>. Universität Paderborn, 2015.
  short: H. Schulz, Zur Verbreitung von Informationen in sozialen Netzwerken - eine
    wirtschaftspolitische Analyse, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Zur Verbreitung von Informationen in sozialen Netzwerken - eine wirtschaftspolitische
  Analyse
type: bachelorsthesis
user_id: '42447'
year: '2015'
...