---
_id: '42285'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: 'N. N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse</i>. Universität Paderborn; 2019.'
  apa: 'N., N. (2019). <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse</i>. Universität Paderborn.'
  bibtex: '@book{N._2019, title={Verhandlungen mit Intermediären in IT-Märkten: eine
    spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N., N.},
    year={2019} }'
  chicago: 'N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2019.'
  ieee: 'N. N., <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2019.'
  mla: 'N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse</i>. Universität Paderborn, 2019.'
  short: 'N. N., Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische
    Analyse, Universität Paderborn, 2019.'
date_created: 2023-02-22T10:58:10Z
date_updated: 2023-05-23T12:47:40Z
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: 'Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse'
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_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: '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: '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: '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'
...
---
_id: '3098'
abstract:
- lang: eng
  text: "One of the fundamental problems in applications of methods and results\r\nfrom
    mechanism design and implementation theory is the effective enforcement of\r\ntheoretically
    established equilibria by which social choice rules are implemented.\r\nHurwicz
    (2008) and Myerson (2009) introduce different concepts of formalizing\r\nenforcement
    of institutional rules via the introduction of legal and illegal games. In\r\nthis
    note the relation of their concepts with that of a social system defined inDebreu\r\n(1952)
    is analyzed and its potential of being instrumental for modelling institution\r\ndesign
    is discussed. The existence proof for such a system, also known as generalized\r\ngame
    or abstract economy had been the basis for the existence proof of a\r\ncompetitive
    equilibrium of an economy."
author:
- first_name: Walter
  full_name: Trockel, Walter
  last_name: Trockel
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
citation:
  ama: 'Trockel W, Haake C-J. Thoughts on Social Design. In: Laslier J-F, Moulin H,
    Sanver R, Zwicker W, eds. <i>Studies in Economic Design</i>. Vol (n.d.). Studies
    in Economic Design. Heidelberg: Springer.'
  apa: 'Trockel, W., &#38; Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F.
    Laslier, H. Moulin, R. Sanver, &#38; W. Zwicker (Eds.), <i>Studies in Economic
    Design</i> (Vol. (n.d.)). Heidelberg: Springer.'
  bibtex: '@inbook{Trockel_Haake, place={Heidelberg}, series={Studies in Economic
    Design}, title={Thoughts on Social Design}, volume={(n.d.)}, booktitle={Studies
    in Economic Design}, publisher={Springer}, author={Trockel, Walter and Haake,
    Claus-Jochen}, editor={Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi
    and Zwicker, WilliamEditors}, collection={Studies in Economic Design} }'
  chicago: 'Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.”
    In <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier, Herve Moulin,
    Remzi Sanver, and William Zwicker, Vol. (n.d.). Studies in Economic Design. Heidelberg:
    Springer, n.d.'
  ieee: 'W. Trockel and C.-J. Haake, “Thoughts on Social Design,” in <i>Studies in
    Economic Design</i>, vol. (n.d.), J.-F. Laslier, H. Moulin, R. Sanver, and W.
    Zwicker, Eds. Heidelberg: Springer.'
  mla: Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” <i>Studies
    in Economic Design</i>, edited by Jean-Francois Laslier et al., vol. (n.d.), Springer.
  short: 'W. Trockel, C.-J. Haake, in: J.-F. Laslier, H. Moulin, R. Sanver, W. Zwicker
    (Eds.), Studies in Economic Design, Springer, Heidelberg, n.d.'
date_created: 2018-06-06T17:07:28Z
date_updated: 2022-01-06T06:58:55Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
editor:
- first_name: Jean-Francois
  full_name: Laslier, Jean-Francois
  last_name: Laslier
- first_name: Herve
  full_name: Moulin, Herve
  last_name: Moulin
- first_name: Remzi
  full_name: Sanver, Remzi
  last_name: Sanver
- first_name: William
  full_name: Zwicker, William
  last_name: Zwicker
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T08:36:24Z
  date_updated: 2018-08-09T09:14:11Z
  file_id: '3857'
  file_name: WP - Thoughts on Social Design.pdf
  file_size: 141983
  relation: main_file
  title: Thoughts on Social Design
file_date_updated: 2018-08-09T09:14:11Z
has_accepted_license: '1'
language:
- iso: eng
place: Heidelberg
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Studies in Economic Design
publication_identifier:
  issn:
  - 2510-3970
publication_status: accepted
publisher: Springer
quality_controlled: '1'
series_title: Studies in Economic Design
status: public
title: Thoughts on Social Design
type: book_chapter
urn: '30987'
user_id: '477'
volume: (n.d.)
year: '2018'
...
---
_id: '8074'
author:
- first_name: Cengiz
  full_name: Aykanat, Cengiz
  last_name: Aykanat
citation:
  ama: Aykanat C. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>.
    Universität Paderborn; 2018.
  apa: Aykanat, C. (2018). <i>Sharing Economy - Chancen und Risiken aus ökonomischer
    Sicht</i>. Universität Paderborn.
  bibtex: '@book{Aykanat_2018, title={Sharing Economy - Chancen und Risiken aus ökonomischer
    Sicht}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2018}
    }'
  chicago: Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer
    Sicht</i>. Universität Paderborn, 2018.
  ieee: C. Aykanat, <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>.
    Universität Paderborn, 2018.
  mla: Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer
    Sicht</i>. Universität Paderborn, 2018.
  short: C. Aykanat, Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht,
    Universität Paderborn, 2018.
date_created: 2019-02-22T09:40:39Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Sharing Economy - Chancen und Risiken aus ökonomischer Sicht
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '8075'
author:
- first_name: Tatiana
  full_name: Suvorina, Tatiana
  last_name: Suvorina
citation:
  ama: Suvorina T. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität
    Paderborn; 2018.
  apa: Suvorina, T. (2018). <i>Heterogeneity in Contests, Sources and Implicants</i>.
    Universität Paderborn.
  bibtex: '@book{Suvorina_2018, title={Heterogeneity in Contests, Sources and Implicants},
    publisher={Universität Paderborn}, author={Suvorina, Tatiana}, year={2018} }'
  chicago: Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>.
    Universität Paderborn, 2018.
  ieee: T. Suvorina, <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität
    Paderborn, 2018.
  mla: Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>.
    Universität Paderborn, 2018.
  short: T. Suvorina, Heterogeneity in Contests, Sources and Implicants, Universität
    Paderborn, 2018.
date_created: 2019-02-22T09:47:28Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Heterogeneity in Contests, Sources and Implicants
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5967'
author:
- first_name: Alexander
  full_name: Koch, Alexander
  last_name: Koch
citation:
  ama: Koch A. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>.
    Universität Paderborn; 2018.
  apa: Koch, A. (2018). <i>Reduzierung des Energieverlustes im Smart Grid mittels
    Koalitionsbildung</i>. Universität Paderborn.
  bibtex: '@book{Koch_2018, title={Reduzierung des Energieverlustes im Smart Grid
    mittels Koalitionsbildung}, publisher={Universität Paderborn}, author={Koch, Alexander},
    year={2018} }'
  chicago: Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels
    Koalitionsbildung</i>. Universität Paderborn, 2018.
  ieee: A. Koch, <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>.
    Universität Paderborn, 2018.
  mla: Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels
    Koalitionsbildung</i>. Universität Paderborn, 2018.
  short: A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung,
    Universität Paderborn, 2018.
date_created: 2018-11-28T12:07:30Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '205'
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: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung
type: bachelorsthesis
user_id: '65453'
year: '2018'
...
---
_id: '4564'
abstract:
- lang: eng
  text: "  In our model two divisions negotiate over type-dependent contracts to\r\n
    \ determine an intrafirm transfer price for an intermediate product. Since the\r\n
    \ upstream division's (seller's) costs and downstream division's (buyer's)\r\n
    \ revenues are supposed to be private information, we formally consider\r\n  cooperative
    bargaining problems under incomplete information.  This means\r\n  that the two
    divisions consider allocations of expected utility generated by\r\n  mechanisms
    that satisfy (interim) individual rationality, incentive\r\n  compatibility and/or
    ex post efficiency.  Assuming two possible types for\r\n  buyer and seller each,
    we first establish that the bargaining problem is\r\n  regular, regardless whether
    or not incentive and/or efficiency constraints\r\n  are imposed. This allows us
    to apply the generalized Nash bargaining\r\n  solution to determine fair transfer
    payments and transfer\r\n  quantities. In particular, the generalized Nash bargaining
    solution tries to\r\n  balance divisional profits, while incentive constraints
    are still in\r\n  place. In that sense a fair profit division is generated. Furthermore,
    by\r\n  means of illustrative examples we derive general properties of this solution\r\n
    \ for the transfer pricing problem and compare the model developed here with\r\n
    \ the models existing in the literature. We demonstrate that there is a\r\n  tradeoff
    between ex post efficiency and fairness.\r\n"
article_type: original
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Sonja
  full_name: Recker, Sonja
  last_name: Recker
citation:
  ama: Haake C-J, Recker S. The Generalized Nash Bargaining Solution for Transfer
    Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>.
    2018;27(6):905-932. doi:<a href="https://doi.org/10.1007/s10726-018-9592-8">10.1007/s10726-018-9592-8</a>
  apa: Haake, C.-J., &#38; Recker, S. (2018). The Generalized Nash Bargaining Solution
    for Transfer Price Negotiations under Incomplete Information. <i>Group Decision
    and Negotiation</i>, <i>27</i>(6), 905–932. <a href="https://doi.org/10.1007/s10726-018-9592-8">https://doi.org/10.1007/s10726-018-9592-8</a>
  bibtex: '@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution
    for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={<a
    href="https://doi.org/10.1007/s10726-018-9592-8">10.1007/s10726-018-9592-8</a>},
    number={6}, journal={Group Decision and Negotiation}, publisher={Springer}, author={Haake,
    Claus-Jochen and Recker, Sonja}, year={2018}, pages={905–932} }'
  chicago: 'Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining
    Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group
    Decision and Negotiation</i> 27, no. 6 (2018): 905–32. <a href="https://doi.org/10.1007/s10726-018-9592-8">https://doi.org/10.1007/s10726-018-9592-8</a>.'
  ieee: C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer
    Price Negotiations under Incomplete Information,” <i>Group Decision and Negotiation</i>,
    vol. 27, no. 6, pp. 905–932, 2018.
  mla: Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution
    for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision
    and Negotiation</i>, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:<a href="https://doi.org/10.1007/s10726-018-9592-8">10.1007/s10726-018-9592-8</a>.
  short: C.-J. Haake, S. Recker, Group Decision and Negotiation 27 (2018) 905–932.
date_created: 2018-10-02T07:15:26Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s10726-018-9592-8
file:
- access_level: closed
  content_type: application/pdf
  creator: stela
  date_created: 2018-10-31T07:43:31Z
  date_updated: 2018-10-31T07:43:31Z
  file_id: '5107'
  file_name: The Generalized Nash Bargaining Solution for Transfer Price Negotiations
    Under Incomplete Information.pdf
  file_size: 636521
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T07:43:31Z
has_accepted_license: '1'
intvolume: '        27'
issue: '6'
jel:
- C78
language:
- iso: eng
page: 905-932
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Group Decision and Negotiation
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: The Generalized Nash Bargaining Solution for Transfer Price Negotiations under
  Incomplete Information
type: journal_article
user_id: '477'
volume: 27
year: '2018'
...
---
_id: '4797'
author:
- first_name: Xing
  full_name: Wu, Xing
  id: '47829'
  last_name: Wu
citation:
  ama: Wu X. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn;
    2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-358">10.17619/UNIPB/1-358</a>
  apa: Wu, X. (2018). <i>Essays on Competition in Health Care Markets</i>. Universität
    Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-358">https://doi.org/10.17619/UNIPB/1-358</a>
  bibtex: '@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={<a
    href="https://doi.org/10.17619/UNIPB/1-358">10.17619/UNIPB/1-358</a>}, publisher={Universität
    Paderborn}, author={Wu, Xing}, year={2018} }'
  chicago: Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität
    Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-358">https://doi.org/10.17619/UNIPB/1-358</a>.
  ieee: X. Wu, <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn,
    2018.
  mla: Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität
    Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-358">10.17619/UNIPB/1-358</a>.
  short: X. Wu, Essays on Competition in Health Care Markets, Universität Paderborn,
    2018.
date_created: 2018-10-23T08:13:11Z
date_updated: 2022-01-06T07:01:23Z
ddc:
- '330'
department:
- _id: '280'
doi: 10.17619/UNIPB/1-358
file:
- access_level: closed
  content_type: application/pdf
  creator: xwu
  date_created: 2018-11-06T14:23:51Z
  date_updated: 2018-11-06T14:23:51Z
  file_id: '5381'
  file_name: Xing Wu_Essays on Competition in Health Care Markets.pdf
  file_size: 893726
  relation: main_file
file_date_updated: 2018-11-06T14:23:51Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Essays on Competition in Health Care Markets
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '4802'
author:
- first_name: Yasemen
  full_name: Akcay, Yasemen
  last_name: Akcay
citation:
  ama: Akcay Y. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>.
    Universität Paderborn; 2018.
  apa: Akcay, Y. (2018). <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation
    und Wettbewerb</i>. Universität Paderborn.
  bibtex: '@book{Akcay_2018, title={Entrepreneurship - Zu den Wechselwirkungen von
    Innovation und Wettbewerb}, publisher={Universität Paderborn}, author={Akcay,
    Yasemen}, year={2018} }'
  chicago: Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation
    Und Wettbewerb</i>. Universität Paderborn, 2018.
  ieee: Y. Akcay, <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und
    Wettbewerb</i>. Universität Paderborn, 2018.
  mla: Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation
    Und Wettbewerb</i>. Universität Paderborn, 2018.
  short: Y. Akcay, Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb,
    Universität Paderborn, 2018.
date_created: 2018-10-24T06:41:13Z
date_updated: 2022-01-06T07:01:24Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '4804'
author:
- first_name: Emre
  full_name: Görken, Emre
  last_name: Görken
citation:
  ama: Görken E. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten
    von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität
    Paderborn; 2018.
  apa: Görken, E. (2018). <i>Neurowissenschaftliche und verhaltensökonomische Determinaten
    von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität
    Paderborn.
  bibtex: '@book{Görken_2018, title={Neurowissenschaftliche und verhaltensökonomische
    Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern},
    publisher={Universität Paderborn}, author={Görken, Emre}, year={2018} }'
  chicago: Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten
    von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität
    Paderborn, 2018.
  ieee: E. Görken, <i>Neurowissenschaftliche und verhaltensökonomische Determinaten
    von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität
    Paderborn, 2018.
  mla: Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten
    von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität
    Paderborn, 2018.
  short: E. Görken, Neurowissenschaftliche Und Verhaltensökonomische Determinaten
    von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern, Universität
    Paderborn, 2018.
date_created: 2018-10-24T07:05:18Z
date_updated: 2022-01-06T07:01:24Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten
  bei Such-, Erfahrungs- und Vertrauensgütern
type: mastersthesis
user_id: '477'
year: '2018'
...