---
_id: '42281'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>A Bargaining Model for Relative Profit and Market Share Delegation
    Contracts</i>. Universität Paderborn; 2019.
  apa: N., N. (2019). <i>A bargaining model for relative profit and market share delegation
    contracts</i>. Universität Paderborn.
  bibtex: '@book{N._2019, title={A bargaining model for relative profit and market
    share delegation contracts}, publisher={Universität Paderborn}, author={N., N.},
    year={2019} }'
  chicago: N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation
    Contracts</i>. Universität Paderborn, 2019.
  ieee: N. N., <i>A bargaining model for relative profit and market share delegation
    contracts</i>. Universität Paderborn, 2019.
  mla: N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation
    Contracts</i>. Universität Paderborn, 2019.
  short: N. N., A Bargaining Model for Relative Profit and Market Share Delegation
    Contracts, Universität Paderborn, 2019.
date_created: 2023-02-22T10:53:58Z
date_updated: 2023-05-23T12:47:58Z
department:
- _id: '204'
- _id: '205'
- _id: '475'
- _id: '200'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
  name: 'SFB 901 - A3: SFB 901 - Subproject A3'
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: A bargaining model for relative profit and market share delegation contracts
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '41926'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>.
    Universität Paderborn; 2019.
  apa: N., N. (2019). <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten
    Kunden</i>. Universität Paderborn.
  bibtex: '@book{N._2019, title={Wettbewerb in Märkten für Dienstleitungen mit uninformierten
    Kunden}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }'
  chicago: N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten
    Kunden</i>. Universität Paderborn, 2019.
  ieee: N. N., <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>.
    Universität Paderborn, 2019.
  mla: N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>.
    Universität Paderborn, 2019.
  short: N. N., Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden,
    Universität Paderborn, 2019.
date_created: 2023-02-09T09:23:13Z
date_updated: 2023-05-23T12:48:17Z
department:
- _id: '204'
- _id: '205'
- _id: '475'
- _id: '200'
language:
- iso: ger
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
  name: 'SFB 901 - A3: SFB 901 - Subproject A3'
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '42277'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität
    Paderborn; 2019.
  apa: N., N. (2019). <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>.
    Universität Paderborn.
  bibtex: '@book{N._2019, title={Der Shapley-Wert als Index für phylogenetische Diversität},
    publisher={Universität Paderborn}, author={N., N.}, year={2019} }'
  chicago: N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>.
    Universität Paderborn, 2019.
  ieee: N. N., <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität
    Paderborn, 2019.
  mla: N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität
    Paderborn, 2019.
  short: N. N., Der Shapley-Wert als Index für phylogenetische Diversität, Universität
    Paderborn, 2019.
date_created: 2023-02-22T10:49:08Z
date_updated: 2023-05-23T12:48:10Z
department:
- _id: '204'
- _id: '205'
- _id: '475'
- _id: '200'
language:
- iso: ger
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
  name: 'SFB 901 - A3: SFB 901 - Subproject A3'
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Der Shapley-Wert als Index für phylogenetische Diversität
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '42283'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn;
    2019.
  apa: N., N. (2019). <i>Student’s school matching mechanisms in the US</i>. Universität
    Paderborn.
  bibtex: '@book{N._2019, title={Student’s school matching mechanisms in the US},
    publisher={Universität Paderborn}, author={N., N.}, year={2019} }'
  chicago: N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität
    Paderborn, 2019.
  ieee: N. N., <i>Student’s school matching mechanisms in the US</i>. Universität
    Paderborn, 2019.
  mla: N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn,
    2019.
  short: N. N., Student’s School Matching Mechanisms in the US, Universität Paderborn,
    2019.
date_created: 2023-02-22T10:55:19Z
date_updated: 2023-05-23T12:47:52Z
department:
- _id: '204'
- _id: '205'
- _id: '475'
- _id: '200'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
  name: 'SFB 901 - A3: SFB 901 - Subproject A3'
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Student's school matching mechanisms in the US
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '2484'
abstract:
- lang: eng
  text: We study the classic bin packing problem in a fully-dynamic setting, where
    new items can arrive and old items may depart. We want algorithms with low asymptotic
    competitive ratio while repacking items sparingly between updates. Formally, each
    item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
    a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
    for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
    This is motivated by cloud storage applications, where fully-dynamic bin packing
    models the problem of data backup to minimize the number of disks used, as well
    as communication incurred in moving file backups between disks. Since the set
    of files changes over time, we could recompute a solution periodically from scratch,
    but this would give a high number of disk rewrites, incurring a high energy cost
    and possible wear and tear of the disks. In this work, we present optimal tradeoffs
    between number of bins used and number of items repacked, as well as natural extensions
    of the latter measure.
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Anupam
  full_name: Gupta, Anupam
  last_name: Gupta
- first_name: Guru
  full_name: Guruganesh, Guru
  last_name: Guruganesh
- first_name: 'Amit '
  full_name: 'Kumar, Amit '
  last_name: Kumar
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: David
  full_name: Wajc, David
  last_name: Wajc
citation:
  ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
    Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>.
    Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
    Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a
    href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>'
  apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
    S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
    I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>
    (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>'
  bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
    place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
    (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
    DOI={<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>},
    booktitle={45th International Colloquium on Automata, Languages, and Programming
    (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
    Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
    Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
    year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
    in Informatics (LIPIcs)} }'
  chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar,
    Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
    In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
    and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
    (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
    2018. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.'
  ieee: B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,”
    in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.
  mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
    <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>.
  short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
    D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018),
    Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
    51:1-51:24.'
conference:
  end_date: 2018-07-13
  location: Prag
  name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)
  start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
  full_name: Chatzigiannakis, Ioannis
  last_name: Chatzigiannakis
- first_name: Christos
  full_name: Kaklamanis, Christos
  last_name: Kaklamanis
- first_name: Dániel
  full_name: Marx, Dániel
  last_name: Marx
- first_name: Donald
  full_name: Sannella, Donald
  last_name: Sannella
external_id:
  arxiv:
  - '1711.01231'
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:58:18Z
  date_updated: 2018-10-31T16:58:18Z
  file_id: '5227'
  file_name: LIPIcs-ICALP-2018-51.pdf
  file_size: 723824
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: '       107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
  (ICALP 2018)
publication_identifier:
  isbn:
  - 978-3-95977-076-7
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2485'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities.
    In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
    Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>'
  apa: 'Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location
    with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>'
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
    Location with Mobile Facilities}, DOI={<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>},
    booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
    auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
    Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>.
  short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
  location: Wien
  name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:42:33Z
  date_updated: 2018-11-02T14:42:33Z
  file_id: '5280'
  file_name: p373-feldkord.pdf
  file_size: 1207546
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2831'
abstract:
- lang: eng
  text: 'We consider a market where final products or services are compositions of
    a number of basic services. Users are asked to evaluate the quality of the composed
    product after purchase. The quality of the basic service influences the performance
    of the composed services but cannot be observed directly. The question we pose
    is whether it is possible to use user evaluations on composed services to assess
    the quality of basic services. We discuss how to combine aggregation of evaluations
    across users and disaggregation of information on composed services to derive
    valuations for the single components. As a solution we propose to use the (weighted)
    average as aggregation device in connection with the Shapley value as disaggregation
    method, since this combination fulfills natural requirements in our context. In
    addition, we address some occurring computational issues: We give an approximate
    solution concept using only a limited number of evaluations which guarantees nearly
    optimal results with reduced running time. Lastly, we show that a slightly modified
    Shapley value and the weighted average are still applicable if the evaluation
    profiles are incomplete.'
author:
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
- first_name: Nadja
  full_name: Stroh-Maraun, Nadja
  id: '13264'
  last_name: Stroh-Maraun
citation:
  ama: 'Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations
    Using the Shapley Value. In: <i>Proceedings of the 13th Workshop on Economics
    of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a
    href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>'
  apa: Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating
    User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop
    on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6).
    Irvine, California, USA. <a href="https://doi.org/10.1145/3230654.3230659">https://doi.org/10.1145/3230654.3230659</a>
  bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
    User Evaluations Using the Shapley Value}, DOI={<a href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>},
    booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems
    and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen
    and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6}
    }'
  chicago: Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun.
    “Disaggregating User Evaluations Using the Shapley Value.” In <i>Proceedings of
    the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>,
    5:1-5:6, 2018. <a href="https://doi.org/10.1145/3230654.3230659">https://doi.org/10.1145/3230654.3230659</a>.
  ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
    User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop
    on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine,
    California, USA, 2018, pp. 5:1-5:6.
  mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
    Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems
    and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>.
  short: 'M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings
    of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon
    2018), 2018, pp. 5:1-5:6.'
conference:
  end_date: 2018-06-18
  location: Irvine, California, USA
  name: The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon
    2018)
  start_date: 2018-06-18
date_created: 2018-05-22T10:28:51Z
date_updated: 2022-01-06T06:58:01Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
- _id: '205'
- _id: '475'
doi: 10.1145/3230654.3230659
file:
- access_level: closed
  content_type: application/pdf
  creator: nmaraun
  date_created: 2018-08-15T07:30:50Z
  date_updated: 2018-08-15T07:30:50Z
  file_id: '3910'
  file_name: Disaggregating User Evaluations Using the Shapley Value.pdf
  file_size: 1450171
  relation: main_file
  success: 1
file_date_updated: 2018-08-15T07:30:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 5:1-5:6
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Proceedings of the 13th Workshop on Economics of Networks, Systems and
  Computation (NetEcon 2018)
publication_identifier:
  isbn:
  - 978-1-4503-5916-0
publication_status: published
status: public
title: Disaggregating User Evaluations Using the Shapley Value
type: conference
user_id: '14052'
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
  full_name: 'Abu-Khzam, Faisal N. '
  last_name: Abu-Khzam
- 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: Michael
  full_name: Schubert, Michael
  last_name: Schubert
citation:
  ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
    <i>Theory of Computing Systems</i>. 2018. doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>
  apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M.
    (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
    Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>
  bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
    DOI={<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>},
    journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
    Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
    Michael}, year={2018} }'
  chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
    and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
    in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>.
  ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
    <i>Theory of Computing Systems</i>, 2018.
  mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
    Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>,
    Springer, 2018, doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>.
  short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
    of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:24:32Z
  date_updated: 2018-11-02T15:24:32Z
  file_id: '5301'
  file_name: ApproximationAndHeuristicAlgor.pdf
  file_size: 1371624
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:24:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_identifier:
  unknown:
  - 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
  Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- 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: Mostafa
  full_name: Wahby, Mostafa
  last_name: Wahby
citation:
  ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive:
    Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
    In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018.
    doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>'
  apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018).
    Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online
    Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>'
  bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
    Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets}, DOI={<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>},
    booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
    Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
    year={2018} }'
  chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
    Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse
    Based on Online Connected Dominating Sets.” In <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.'
  ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
    &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>, 2018.'
  mla: 'Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern
    Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018, doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>.'
  short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
    Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:15:19Z
  date_updated: 2018-11-13T13:15:19Z
  file_id: '5536'
  file_name: LIPIcs-FUN-2018-22.pdf
  file_size: 554298
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:15:19Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
  Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2564'
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: 'Gutt D. In the Eye of the Beholder? – Empirically Decomposing Different Economic
    Implications of the Online Rating Variance. In: <i>Proceedings of the 25th European
    Conference on Information Systems (ECIS)</i>. ; 2018.'
  apa: Gutt, D. (2018). In the Eye of the Beholder? – Empirically Decomposing Different
    Economic Implications of the Online Rating Variance. In <i>Proceedings of the
    25th European Conference on Information Systems (ECIS)</i>. Portsmouth, UK.
  bibtex: '@inproceedings{Gutt_2018, title={In the Eye of the Beholder? – Empirically
    Decomposing Different Economic Implications of the Online Rating Variance}, booktitle={Proceedings
    of the 25th European Conference on Information Systems (ECIS)}, author={Gutt,
    Dominik}, year={2018} }'
  chicago: Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different
    Economic Implications of the Online Rating Variance.” In <i>Proceedings of the
    25th European Conference on Information Systems (ECIS)</i>, 2018.
  ieee: D. Gutt, “In the Eye of the Beholder? – Empirically Decomposing Different
    Economic Implications of the Online Rating Variance,” in <i>Proceedings of the
    25th European Conference on Information Systems (ECIS)</i>, Portsmouth, UK, 2018.
  mla: Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different
    Economic Implications of the Online Rating Variance.” <i>Proceedings of the 25th
    European Conference on Information Systems (ECIS)</i>, 2018.
  short: 'D. Gutt, in: Proceedings of the 25th European Conference on Information
    Systems (ECIS), 2018.'
conference:
  end_date: 2018-06-28
  location: Portsmouth, UK
  name: 25th European Conference on Information Systems (ECIS)
  start_date: 2018-06-23
date_created: 2018-05-02T13:10:34Z
date_updated: 2022-01-06T06:57:08Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T09:56:27Z
  date_updated: 2018-11-12T09:56:27Z
  file_id: '5475'
  file_name: 1359-doc.pdf
  file_size: 553078
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T09:56:27Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Proceedings of the 25th European Conference on Information Systems (ECIS)
publication_status: published
status: public
title: In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications
  of the Online Rating Variance
type: conference
user_id: '16205'
year: '2018'
...
---
_id: '2565'
abstract:
- lang: eng
  text: This note deals with agreeability in nontransferable utility (NTU) differential
    games. We introduce state feedback Pareto weights to enrich the set of efficient
    cooperative solutions. The framework is particularly useful if constant weights
    fail to support agreeability, but cooperation is desired nonetheless. The concept
    is applied to an adverting differential game.
author:
- first_name: Simon
  full_name: Hoof, Simon
  id: '59676'
  last_name: Hoof
citation:
  ama: Hoof S. <i>Feedback Pareto Weights in Cooperative NTU Differential Games</i>.
    Vol 112. CIE Working Paper Series, Paderborn University; 2018.
  apa: Hoof, S. (2018). <i>Feedback Pareto weights in cooperative NTU differential
    games</i> (Vol. 112). CIE Working Paper Series, Paderborn University.
  bibtex: '@book{Hoof_2018, series={Working Papers CIE}, title={Feedback Pareto weights
    in cooperative NTU differential games}, volume={112}, publisher={CIE Working Paper
    Series, Paderborn University}, author={Hoof, Simon}, year={2018}, collection={Working
    Papers CIE} }'
  chicago: Hoof, Simon. <i>Feedback Pareto Weights in Cooperative NTU Differential
    Games</i>. Vol. 112. Working Papers CIE. CIE Working Paper Series, Paderborn University,
    2018.
  ieee: S. Hoof, <i>Feedback Pareto weights in cooperative NTU differential games</i>,
    vol. 112. CIE Working Paper Series, Paderborn University, 2018.
  mla: Hoof, Simon. <i>Feedback Pareto Weights in Cooperative NTU Differential Games</i>.
    Vol. 112, CIE Working Paper Series, Paderborn University, 2018.
  short: S. Hoof, Feedback Pareto Weights in Cooperative NTU Differential Games, CIE
    Working Paper Series, Paderborn University, 2018.
date_created: 2018-05-03T07:50:57Z
date_updated: 2022-01-06T06:57:09Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2018-09-13T07:29:48Z
  date_updated: 2018-09-13T07:29:48Z
  file_id: '4382'
  file_name: WP - Feedback Pareto weights in cooperative NTU differential games.pdf
  file_size: 263766
  relation: main_file
  success: 1
file_date_updated: 2018-09-13T07:29:48Z
has_accepted_license: '1'
intvolume: '       112'
keyword:
- NTU differential games
- variable Pareto weights
- agreeability
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: Feedback Pareto weights in cooperative NTU differential games
type: working_paper
user_id: '65453'
volume: 112
year: '2018'
...
---
_id: '2566'
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
  id: '20801'
  last_name: Haake
- first_name: Nadja
  full_name: Stroh-Maraun, Nadja
  id: '13264'
  last_name: Stroh-Maraun
citation:
  ama: Haake C-J, Stroh-Maraun N. Outcome Equivalence in School Choice with Reciprocal
    Preferences. <i>Economics Letters</i>. 2018;170:39-41. doi:<a href="https://doi.org/10.1016/j.econlet.2018.05.033">10.1016/j.econlet.2018.05.033</a>
  apa: Haake, C.-J., &#38; Stroh-Maraun, N. (2018). Outcome Equivalence in School
    Choice with Reciprocal Preferences. <i>Economics Letters</i>, <i>170</i>, 39–41.
    <a href="https://doi.org/10.1016/j.econlet.2018.05.033">https://doi.org/10.1016/j.econlet.2018.05.033</a>
  bibtex: '@article{Haake_Stroh-Maraun_2018, title={Outcome Equivalence in School
    Choice with Reciprocal Preferences}, volume={170}, DOI={<a href="https://doi.org/10.1016/j.econlet.2018.05.033">10.1016/j.econlet.2018.05.033</a>},
    journal={Economics Letters}, publisher={Elsevier}, author={Haake, Claus-Jochen
    and Stroh-Maraun, Nadja}, year={2018}, pages={39–41} }'
  chicago: 'Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School
    Choice with Reciprocal Preferences.” <i>Economics Letters</i> 170 (2018): 39–41.
    <a href="https://doi.org/10.1016/j.econlet.2018.05.033">https://doi.org/10.1016/j.econlet.2018.05.033</a>.'
  ieee: C.-J. Haake and N. Stroh-Maraun, “Outcome Equivalence in School Choice with
    Reciprocal Preferences,” <i>Economics Letters</i>, vol. 170, pp. 39–41, 2018.
  mla: Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School
    Choice with Reciprocal Preferences.” <i>Economics Letters</i>, vol. 170, Elsevier,
    2018, pp. 39–41, doi:<a href="https://doi.org/10.1016/j.econlet.2018.05.033">10.1016/j.econlet.2018.05.033</a>.
  short: C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.
date_created: 2018-05-03T07:53:56Z
date_updated: 2022-01-06T06:57:09Z
ddc:
- '040'
department:
- _id: '205'
doi: 10.1016/j.econlet.2018.05.033
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T08:08:17Z
  date_updated: 2018-08-09T09:15:07Z
  file_id: '3854'
  file_name: 1-s2.0-S016517651830212X-main.pdf
  file_size: 261888
  relation: main_file
  title: Outcome equivalence in school choice with reciprocal preferences
file_date_updated: 2018-08-09T09:15:07Z
has_accepted_license: '1'
intvolume: '       170'
language:
- iso: eng
page: 39 - 41
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Economics Letters
publication_status: published
publisher: Elsevier
status: public
title: Outcome Equivalence in School Choice with Reciprocal Preferences
type: journal_article
urn: '25669'
user_id: '477'
volume: 170
year: '2018'
...
---
_id: '2660'
author:
- first_name: Jürgen
  full_name: Neumann, Jürgen
  id: '32456'
  last_name: Neumann
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring
    the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Conference
    Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research
    (SCECR)</i>. ; 2018.'
  apa: Neumann, J., Gutt, D., &#38; Kundisch, D. (2018). The Traveling Reviewer Problem
    - Exploring the Relationship Between Offline Locations and Online Rating Behavior.
    In <i>Conference Abstracts of the Symposium on Statistical Challenges in Electronic
    Commerce Research (SCECR)</i>. Rotterdam, Netherland.
  bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer
    Problem - Exploring the Relationship Between Offline Locations and Online Rating
    Behavior}, booktitle={Conference Abstracts of the Symposium on Statistical Challenges
    in Electronic Commerce Research (SCECR)}, author={Neumann, Jürgen and Gutt, Dominik
    and Kundisch, Dennis}, year={2018} }'
  chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
    Problem - Exploring the Relationship Between Offline Locations and Online Rating
    Behavior.” In <i>Conference Abstracts of the Symposium on Statistical Challenges
    in Electronic Commerce Research (SCECR)</i>, 2018.
  ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring
    the Relationship Between Offline Locations and Online Rating Behavior,” in <i>Conference
    Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research
    (SCECR)</i>, Rotterdam, Netherland, 2018.
  mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship
    Between Offline Locations and Online Rating Behavior.” <i>Conference Abstracts
    of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</i>,
    2018.
  short: 'J. Neumann, D. Gutt, D. Kundisch, in: Conference Abstracts of the Symposium
    on Statistical Challenges in Electronic Commerce Research (SCECR), 2018.'
conference:
  location: Rotterdam, Netherland
  name: Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)
date_created: 2018-05-04T12:39:06Z
date_updated: 2022-01-06T06:57:23Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: d0mi
  date_created: 2018-11-12T10:37:12Z
  date_updated: 2018-11-12T10:37:12Z
  file_id: '5491'
  file_name: WP_TRP.pdf
  file_size: 694342
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T10:37:12Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publication: Conference Abstracts of the Symposium on Statistical Challenges in Electronic
  Commerce Research (SCECR)
status: public
title: The Traveling Reviewer Problem - Exploring the Relationship Between Offline
  Locations and Online Rating Behavior
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '3313'
author:
- first_name: Alexandra
  full_name: Maurer, Alexandra
  last_name: Maurer
citation:
  ama: 'Maurer A. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>.
    Universität Paderborn; 2018.'
  apa: 'Maurer, A. (2018). <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische
    Analyse</i>. Universität Paderborn.'
  bibtex: '@book{Maurer_2018, title={Kundenbewertungen und Produktnachfrage: Eine
    ökonomische Analyse}, publisher={Universität Paderborn}, author={Maurer, Alexandra},
    year={2018} }'
  chicago: 'Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische
    Analyse</i>. Universität Paderborn, 2018.'
  ieee: 'A. Maurer, <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>.
    Universität Paderborn, 2018.'
  mla: 'Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische
    Analyse</i>. Universität Paderborn, 2018.'
  short: 'A. Maurer, Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse,
    Universität Paderborn, 2018.'
date_created: 2018-06-22T12:19:02Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: 'Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse'
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '3314'
author:
- first_name: Luisa Juliane
  full_name: Michels, Luisa Juliane
  last_name: Michels
citation:
  ama: Michels LJ. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität
    Paderborn; 2018.
  apa: Michels, L. J. (2018). <i>The Segmentation of Video-On-Demand Consumers</i>.
    Universität Paderborn.
  bibtex: '@book{Michels_2018, title={The Segmentation of Video-On-Demand Consumers},
    publisher={Universität Paderborn}, author={Michels, Luisa Juliane}, year={2018}
    }'
  chicago: Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>.
    Universität Paderborn, 2018.
  ieee: L. J. Michels, <i>The Segmentation of Video-On-Demand Consumers</i>. Universität
    Paderborn, 2018.
  mla: Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>.
    Universität Paderborn, 2018.
  short: L.J. Michels, The Segmentation of Video-On-Demand Consumers, Universität
    Paderborn, 2018.
date_created: 2018-06-22T12:20:47Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
- first_name: Daniel
  full_name: Kaimann, Daniel
  id: '18949'
  last_name: Kaimann
title: The Segmentation of Video-On-Demand Consumers
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '3315'
author:
- first_name: Miriam
  full_name: Walter, Miriam
  last_name: Walter
citation:
  ama: Walter M. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy
    </i>. Universität Paderborn; 2018.
  apa: Walter, M. (2018). <i>Sentiment Analysis of User-generated Ratings in the Sharing
    Economy </i>. Universität Paderborn.
  bibtex: '@book{Walter_2018, title={Sentiment Analysis of User-generated Ratings
    in the Sharing Economy }, publisher={Universität Paderborn}, author={Walter, Miriam},
    year={2018} }'
  chicago: Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the
    Sharing Economy </i>. Universität Paderborn, 2018.
  ieee: M. Walter, <i>Sentiment Analysis of User-generated Ratings in the Sharing
    Economy </i>. Universität Paderborn, 2018.
  mla: Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the Sharing
    Economy </i>. Universität Paderborn, 2018.
  short: M. Walter, Sentiment Analysis of User-Generated Ratings in the Sharing Economy
    , Universität Paderborn, 2018.
date_created: 2018-06-22T12:22:31Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
- first_name: Daniel
  full_name: Kaimann, Daniel
  last_name: Kaimann
title: 'Sentiment Analysis of User-generated Ratings in the Sharing Economy '
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '3316'
author:
- first_name: Hanna
  full_name: Korn, Hanna
  last_name: Korn
citation:
  ama: 'Korn H. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from
    the German Restaurant Industry</i>. Universität Paderborn; 2018.'
  apa: 'Korn, H. (2018). <i>Restaurant reputation and meal prices: empricial evidence
    from the German restaurant industry</i>. Universität Paderborn.'
  bibtex: '@book{Korn_2018, title={Restaurant reputation and meal prices: empricial
    evidence from the German restaurant industry}, publisher={Universität Paderborn},
    author={Korn, Hanna}, year={2018} }'
  chicago: 'Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence
    from the German Restaurant Industry</i>. Universität Paderborn, 2018.'
  ieee: 'H. Korn, <i>Restaurant reputation and meal prices: empricial evidence from
    the German restaurant industry</i>. Universität Paderborn, 2018.'
  mla: 'Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence
    from the German Restaurant Industry</i>. Universität Paderborn, 2018.'
  short: 'H. Korn, Restaurant Reputation and Meal Prices: Empricial Evidence from
    the German Restaurant Industry, Universität Paderborn, 2018.'
date_created: 2018-06-22T12:24:16Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: 'Restaurant reputation and meal prices: empricial evidence from the German
  restaurant industry'
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '3742'
author:
- first_name: Simon
  full_name: Hoof, Simon
  id: '59676'
  last_name: Hoof
citation:
  ama: 'Hoof S. Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining
    Solution. In: <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>.
    Cham: Springer International Publishing; 2018:13-23. doi:<a href="https://doi.org/10.1007/978-3-319-92988-0_2">10.1007/978-3-319-92988-0_2</a>'
  apa: 'Hoof, S. (2018). Dynamic Voluntary Provision of Public Goods: The Recursive
    Nash Bargaining Solution. In <i>Static &#38; Dynamic Game Theory: Foundations
    &#38; Applications</i> (pp. 13–23). Cham: Springer International Publishing. <a
    href="https://doi.org/10.1007/978-3-319-92988-0_2">https://doi.org/10.1007/978-3-319-92988-0_2</a>'
  bibtex: '@inbook{Hoof_2018, place={Cham}, title={Dynamic Voluntary Provision of
    Public Goods: The Recursive Nash Bargaining Solution}, DOI={<a href="https://doi.org/10.1007/978-3-319-92988-0_2">10.1007/978-3-319-92988-0_2</a>},
    booktitle={Static &#38; Dynamic Game Theory: Foundations &#38; Applications},
    publisher={Springer International Publishing}, author={Hoof, Simon}, year={2018},
    pages={13–23} }'
  chicago: 'Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive
    Nash Bargaining Solution.” In <i>Static &#38; Dynamic Game Theory: Foundations
    &#38; Applications</i>, 13–23. Cham: Springer International Publishing, 2018.
    <a href="https://doi.org/10.1007/978-3-319-92988-0_2">https://doi.org/10.1007/978-3-319-92988-0_2</a>.'
  ieee: 'S. Hoof, “Dynamic Voluntary Provision of Public Goods: The Recursive Nash
    Bargaining Solution,” in <i>Static &#38; Dynamic Game Theory: Foundations &#38;
    Applications</i>, Cham: Springer International Publishing, 2018, pp. 13–23.'
  mla: 'Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash
    Bargaining Solution.” <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>,
    Springer International Publishing, 2018, pp. 13–23, doi:<a href="https://doi.org/10.1007/978-3-319-92988-0_2">10.1007/978-3-319-92988-0_2</a>.'
  short: 'S. Hoof, in: Static &#38; Dynamic Game Theory: Foundations &#38; Applications,
    Springer International Publishing, Cham, 2018, pp. 13–23.'
date_created: 2018-08-01T09:51:57Z
date_updated: 2022-01-06T06:59:34Z
ddc:
- '000'
department:
- _id: '205'
doi: 10.1007/978-3-319-92988-0_2
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T16:10:34Z
  date_updated: 2018-11-02T16:10:34Z
  file_id: '5325'
  file_name: Hoof2018_Chapter_DynamicVoluntaryProvisionOfPub.pdf
  file_size: 199568
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T16:10:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 13-23
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: 'Static & Dynamic Game Theory: Foundations & Applications'
publication_identifier:
  isbn:
  - '9783319929873'
  - '9783319929880'
  issn:
  - 2363-8516
  - 2363-8524
publication_status: published
publisher: Springer International Publishing
status: public
title: 'Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining
  Solution'
type: book_chapter
user_id: '477'
year: '2018'
...
---
_id: '3851'
author:
- first_name: Samuel
  full_name: Koop, Samuel
  last_name: Koop
citation:
  ama: Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn;
    2018.
  apa: Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn.
  bibtex: '@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität
    Paderborn}, author={Koop, Samuel}, year={2018} }'
  chicago: Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn, 2018.
  ieee: S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn,
    2018.
  mla: Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn, 2018.
  short: S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn,
    2018.
date_created: 2018-08-08T11:56:37Z
date_updated: 2022-01-06T06:59:45Z
department:
- _id: '541'
- _id: '63'
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: Congestion Games mit gewichteten Strategien
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '2933'
abstract:
- lang: eng
  text: We establish axioms under which a bargaining solution can be found by the
    maximization of the CES function and is unique up to specification of the distribution
    and elasticity parameters. This solution is referred to as the CES solution which
    includes the NASH and egalitarian solutions as special cases. Next, we consider
    a normalization of the CES function and establish axioms, under which a bargaining
    solution can be found by the maximization of the normalized CES and is unique
    up to the specifications of the distribution and its substitution parameters.
    We refer to this solution as the normalized CES solution, which includes the Nash
    and Kalai-Smorodinsky solutions as special cases. Our paper contributes to bargaining
    theory by establishing unified characterizations of existing as well as a great
    variety of new bargaining solutions.
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Cheng-Zhong
  full_name: Qin, Cheng-Zhong
  last_name: Qin
citation:
  ama: 'Haake C-J, Qin C-Z. <i>On Unification of Solutions to the Bargaining Problem</i>.
    Vol 113. Paderborn University: CIE Working Paper Series, Paderborn University;
    2018.'
  apa: 'Haake, C.-J., &#38; Qin, C.-Z. (2018). <i>On unification of solutions to the
    bargaining problem</i> (Vol. 113). Paderborn University: CIE Working Paper Series,
    Paderborn University.'
  bibtex: '@book{Haake_Qin_2018, place={Paderborn University}, series={Working Papers
    CIE}, title={On unification of solutions to the bargaining problem}, volume={113},
    publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen
    and Qin, Cheng-Zhong}, year={2018}, collection={Working Papers CIE} }'
  chicago: 'Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions
    to the Bargaining Problem</i>. Vol. 113. Working Papers CIE. Paderborn University:
    CIE Working Paper Series, Paderborn University, 2018.'
  ieee: 'C.-J. Haake and C.-Z. Qin, <i>On unification of solutions to the bargaining
    problem</i>, vol. 113. Paderborn University: CIE Working Paper Series, Paderborn
    University, 2018.'
  mla: Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions to
    the Bargaining Problem</i>. Vol. 113, CIE Working Paper Series, Paderborn University,
    2018.
  short: C.-J. Haake, C.-Z. Qin, On Unification of Solutions to the Bargaining Problem,
    CIE Working Paper Series, Paderborn University, Paderborn University, 2018.
date_created: 2018-05-28T07:00:28Z
date_updated: 2022-01-06T06:58:48Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T08:15:31Z
  date_updated: 2018-08-09T09:14:52Z
  file_id: '3855'
  file_name: On unification of solutions to the bargaining problem.pdf
  file_size: 469001
  relation: main_file
  title: On unification of solutions to the bargaining problem
file_date_updated: 2018-08-09T09:14:52Z
has_accepted_license: '1'
intvolume: '       113'
keyword:
- Bargaining problem
- CES Function
- Normalized CES Function
- Nash solution
- Kalai-Smorodinsky Solution
- Egalitarian Solution.
language:
- iso: eng
place: Paderborn University
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: On unification of solutions to the bargaining problem
type: working_paper
urn: '29332'
user_id: '65453'
volume: 113
year: '2018'
...