---
_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. Studies in Economic Design. Vol (n.d.). Studies
in Economic Design. Heidelberg: Springer.'
apa: 'Trockel, W., & Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F.
Laslier, H. Moulin, R. Sanver, & W. Zwicker (Eds.), Studies in Economic
Design (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 Studies in Economic Design, 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 Studies in
Economic Design, 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.” Studies
in Economic Design, 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: '2712'
author:
- first_name: Darius
full_name: Schlangenotto, Darius
last_name: Schlangenotto
citation:
ama: Schlangenotto D. Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-312
apa: Schlangenotto, D. (2018). Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-312
bibtex: '@book{Schlangenotto_2018, title={Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer}, DOI={10.17619/UNIPB/1-312},
publisher={Universität Paderborn}, author={Schlangenotto, Darius}, year={2018}
}'
chicago: Schlangenotto, Darius. Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-312.
ieee: D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018.
mla: Schlangenotto, Darius. Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-312.
short: D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer, Universität Paderborn, 2018.
date_created: 2018-05-09T08:34:14Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '276'
doi: 10.17619/UNIPB/1-312
language:
- iso: eng
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: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar
Retailer
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
citation:
ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
Programmable Matter}, DOI={10.17619/UNIPB/1-265},
publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.
ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn, 2018.
mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1163'
abstract:
- lang: eng
text: "In this paper we present two major results:\r\nFirst, we introduce the first
self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
every subscriber of a topic will eventually know all of the publications that
have been issued so far for that topic. The communication work needed to processes
a subscribe or unsubscribe operation is just a constant in a legitimate state,
and the communication work of checking whether the system is still in a legitimate
state is just a constant on expectation for the supervisor as well as any process
in the system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114'
apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing
Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE.
https://doi.org/10.1109/IPDPS.2018.00114'
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
}'
chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings
of the 32nd IEEE International Parallel & Distributed Processing Symposium
(IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.
ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.
mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS),
IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
arxiv:
- '1710.08128'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:25:37Z
date_updated: 2018-10-31T13:25:37Z
file_id: '5211'
file_name: 08425258.pdf
file_size: 239559
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
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: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1164'
abstract:
- lang: eng
text: "We propose a distributed protocol for a queue, called Skueue, which spreads
its data fairly onto multiple processes, avoiding bottlenecks in high throughput
scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
is achieved by aggregating multiple requests to a batch, which can then be processed
in a distributed fashion without hurting the queue semantics.\r\nOperations in
Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
under a high rate of incoming requests."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113'
apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable
and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS). Vancouver:
IEEE. https://doi.org/10.1109/IPDPS.2018.00113'
bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Scheideler, Christian and Setzer, Alexander}, year={2018} }'
chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS).
IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.'
ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.'
mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
Distributed Queue.” Proceedings of the 32nd IEEE International Parallel &
Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.'
short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
arxiv:
- '1802.07504'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:29:26Z
date_updated: 2018-10-31T13:29:26Z
file_id: '5212'
file_name: 08425257.pdf
file_size: 218420
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:29:26Z
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: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
year: '2018'
...
---
_id: '18030'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn;
2018.
apa: N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn.
bibtex: '@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={N., N.}, year={2018} }'
chicago: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn, 2018.
ieee: N. N., Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn,
2018.
short: N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.
date_created: 2020-08-18T08:44:22Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '18033'
author:
- first_name: Robin
full_name: Wulfes, Robin
last_name: Wulfes
citation:
ama: Wulfes R. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn; 2018.
apa: Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn.
bibtex: '@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken},
publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }'
chicago: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
ieee: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
mla: Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken.
Universität Paderborn, 2018.
short: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität
Paderborn, 2018.
date_created: 2020-08-18T08:46:50Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '8074'
author:
- first_name: Cengiz
full_name: Aykanat, Cengiz
last_name: Aykanat
citation:
ama: Aykanat C. Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht.
Universität Paderborn; 2018.
apa: Aykanat, C. (2018). Sharing Economy - Chancen und Risiken aus ökonomischer
Sicht. 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. Sharing Economy - Chancen Und Risiken Aus Ökonomischer
Sicht. Universität Paderborn, 2018.
ieee: C. Aykanat, Sharing Economy - Chancen und Risiken aus ökonomischer Sicht.
Universität Paderborn, 2018.
mla: Aykanat, Cengiz. Sharing Economy - Chancen Und Risiken Aus Ökonomischer
Sicht. 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. Heterogeneity in Contests, Sources and Implicants. Universität
Paderborn; 2018.
apa: Suvorina, T. (2018). Heterogeneity in Contests, Sources and Implicants.
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. Heterogeneity in Contests, Sources and Implicants.
Universität Paderborn, 2018.
ieee: T. Suvorina, Heterogeneity in Contests, Sources and Implicants. Universität
Paderborn, 2018.
mla: Suvorina, Tatiana. Heterogeneity in Contests, Sources and Implicants.
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: '5772'
author:
- first_name: Patrizia
full_name: Fanasch, Patrizia
last_name: Fanasch
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
citation:
ama: Fanasch P, Frick B. What Makes Cooperatives Successful? Identifying the Determinants
of Their Organizational Performance. Journal of Wine Economics. 2018:1-27.
doi:10.1017/jwe.2018.28
apa: Fanasch, P., & Frick, B. (2018). What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance. Journal of Wine Economics,
1–27. https://doi.org/10.1017/jwe.2018.28
bibtex: '@article{Fanasch_Frick_2018, title={What Makes Cooperatives Successful?
Identifying the Determinants of Their Organizational Performance}, DOI={10.1017/jwe.2018.28},
journal={Journal of Wine Economics}, publisher={Cambridge University Press (CUP)},
author={Fanasch, Patrizia and Frick, Bernd}, year={2018}, pages={1–27} }'
chicago: Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful?
Identifying the Determinants of Their Organizational Performance.” Journal
of Wine Economics, 2018, 1–27. https://doi.org/10.1017/jwe.2018.28.
ieee: P. Fanasch and B. Frick, “What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance,” Journal of Wine Economics,
pp. 1–27, 2018.
mla: Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying
the Determinants of Their Organizational Performance.” Journal of Wine Economics,
Cambridge University Press (CUP), 2018, pp. 1–27, doi:10.1017/jwe.2018.28.
short: P. Fanasch, B. Frick, Journal of Wine Economics (2018) 1–27.
date_created: 2018-11-21T09:45:21Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '330'
department:
- _id: '183'
doi: 10.1017/jwe.2018.28
file:
- access_level: closed
content_type: application/pdf
creator: bhoyer
date_created: 2018-11-21T09:46:42Z
date_updated: 2018-11-21T09:46:42Z
file_id: '5773'
file_name: fanasch_frick_jwe_2018.pdf
file_size: 291759
relation: main_file
file_date_updated: 2018-11-21T09:46:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-27
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Journal of Wine Economics
publication_identifier:
issn:
- 1931-4361
- 1931-437X
publication_status: epub_ahead
publisher: Cambridge University Press (CUP)
status: public
title: What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational
Performance
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '5967'
author:
- first_name: Alexander
full_name: Koch, Alexander
last_name: Koch
citation:
ama: Koch A. Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung.
Universität Paderborn; 2018.
apa: Koch, A. (2018). Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. 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. Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. Universität Paderborn, 2018.
ieee: A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung.
Universität Paderborn, 2018.
mla: Koch, Alexander. Reduzierung des Energieverlustes im Smart Grid mittels
Koalitionsbildung. 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: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004
apa: Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.
https://doi.org/10.1016/j.tcs.2018.11.004
bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004},
journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
}'
chicago: 'Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018):
1. https://doi.org/10.1016/j.tcs.2018.11.004.'
ieee: C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.
mla: Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018,
p. 1, doi:10.1016/j.tcs.2018.11.004.
short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2019-01-11T10:20:16Z
date_updated: 2019-01-11T10:20:16Z
file_id: '6620'
file_name: Preface.pdf
file_size: 112676
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: ' 751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
text: "While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on self-stabilization
for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
networks, it should not be taken for granted that a distributed data structure
remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
structure has a wide area of applications including string matching problems while
offering low overhead and efficient operations when embedded on top of a distributed
hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
|x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
is the number of bits needed for storing all keys."
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes
of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1'
apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1'
bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
year={2018}, collection={Lecture Notes of Computer Science} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi
and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_1.
ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
in Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr
Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
of the 20th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
end_date: 2018-11-07
location: Tokyo
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
full_name: Izumi, Taisuke
last_name: Izumi
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
external_id:
arxiv:
- '1809.04923'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:38:37Z
date_updated: 2018-11-02T14:38:37Z
file_id: '5277'
file_name: ASelf-stabilizingHashedPatrici.pdf
file_size: 500005
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: ' 11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
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: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4520'
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: Workshop
on IS Design and Economic Behavior (ISDEB). ; 2018.'
apa: Neumann, J., Gutt, D., & Kundisch, D. (2018). The Traveling Reviewer Problem
- Exploring the Relationship Between Offline Locations and Online Rating Behavior.
In Workshop on IS Design and Economic Behavior (ISDEB). Lüneburg, Germany.
bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer
Problem - Exploring the Relationship Between Offline Locations and Online Rating
Behavior}, booktitle={Workshop on IS Design and Economic Behavior (ISDEB)}, 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 Workshop on IS Design and Economic Behavior (ISDEB), 2018.
ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring
the Relationship Between Offline Locations and Online Rating Behavior,” in Workshop
on IS Design and Economic Behavior (ISDEB), Lüneburg, Germany, 2018.
mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship
Between Offline Locations and Online Rating Behavior.” Workshop on IS Design
and Economic Behavior (ISDEB), 2018.
short: 'J. Neumann, D. Gutt, D. Kundisch, in: Workshop on IS Design and Economic
Behavior (ISDEB), 2018.'
conference:
location: Lüneburg, Germany
name: Workshop on IS Design and Economic Behavior (ISDEB)
date_created: 2018-09-19T14:41:49Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T10:36:41Z
date_updated: 2018-11-12T10:36:41Z
file_id: '5490'
file_name: WP_TRP.pdf
file_size: 694342
relation: main_file
success: 1
file_date_updated: 2018-11-12T10:36:41Z
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: Workshop on IS Design and Economic Behavior (ISDEB)
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: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
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: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
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. Group Decision and Negotiation.
2018;27(6):905-932. doi:10.1007/s10726-018-9592-8
apa: Haake, C.-J., & Recker, S. (2018). The Generalized Nash Bargaining Solution
for Transfer Price Negotiations under Incomplete Information. Group Decision
and Negotiation, 27(6), 905–932. https://doi.org/10.1007/s10726-018-9592-8
bibtex: '@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution
for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={10.1007/s10726-018-9592-8},
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.” Group
Decision and Negotiation 27, no. 6 (2018): 905–32. https://doi.org/10.1007/s10726-018-9592-8.'
ieee: C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer
Price Negotiations under Incomplete Information,” Group Decision and Negotiation,
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.” Group Decision
and Negotiation, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:10.1007/s10726-018-9592-8.
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: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
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: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4797'
author:
- first_name: Xing
full_name: Wu, Xing
id: '47829'
last_name: Wu
citation:
ama: Wu X. Essays on Competition in Health Care Markets. Universität Paderborn;
2018. doi:10.17619/UNIPB/1-358
apa: Wu, X. (2018). Essays on Competition in Health Care Markets. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-358
bibtex: '@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={10.17619/UNIPB/1-358}, publisher={Universität
Paderborn}, author={Wu, Xing}, year={2018} }'
chicago: Wu, Xing. Essays on Competition in Health Care Markets. Universität
Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-358.
ieee: X. Wu, Essays on Competition in Health Care Markets. Universität Paderborn,
2018.
mla: Wu, Xing. Essays on Competition in Health Care Markets. Universität
Paderborn, 2018, doi:10.17619/UNIPB/1-358.
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. Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb.
Universität Paderborn; 2018.
apa: Akcay, Y. (2018). Entrepreneurship - Zu den Wechselwirkungen von Innovation
und Wettbewerb. 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. Entrepreneurship - Zu Den Wechselwirkungen von Innovation
Und Wettbewerb. Universität Paderborn, 2018.
ieee: Y. Akcay, Entrepreneurship - Zu den Wechselwirkungen von Innovation und
Wettbewerb. Universität Paderborn, 2018.
mla: Akcay, Yasemen. Entrepreneurship - Zu Den Wechselwirkungen von Innovation
Und Wettbewerb. 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. Neurowissenschaftliche Und Verhaltensökonomische Determinaten
von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. Universität
Paderborn; 2018.
apa: Görken, E. (2018). Neurowissenschaftliche und verhaltensökonomische Determinaten
von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern. 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. Neurowissenschaftliche Und Verhaltensökonomische Determinaten
von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. Universität
Paderborn, 2018.
ieee: E. Görken, Neurowissenschaftliche und verhaltensökonomische Determinaten
von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern. Universität
Paderborn, 2018.
mla: Görken, Emre. Neurowissenschaftliche Und Verhaltensökonomische Determinaten
von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. 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'
...