---
_id: '2480'
abstract:
- lang: eng
text: Understanding the behavior of the components of service function chains (SFCs)
in different load situations is important for efficient and automatic management
and orches- tration of services. For this purpose and for practical research in
network function virtualization in general, there is a great need for benchmarks
and experimental data. In this paper, we describe our experiments for characterizing
the relationship between resource demands of virtual network functions (VNFs)
and the expected performance of the SFC, considering the individual performance
of the VNFs as well as the interdependencies among VNFs within the SFC. We have
designed our experiments focusing on video streaming, an important application
in this context. We present examples of models for predicting the interdependence
between resource demands and performance characteristics of SFCs using support
vector regression and polynomial regression models. We also show practical evidence
from our experiments that VNFs need to be benchmarked in their final chain setup,
rather than individually, to capture important interdependencies that affect their
performance. The data gathered from our experiments is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance
Models for Service Function Chains: The Video Streaming Case. In: 4th IEEE
International Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:318--322.
doi:10.1109/NETSOFT.2018.8460029'
apa: 'Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case.
In 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 318--322). Montreal: IEEE. https://doi.org/10.1109/NETSOFT.2018.8460029'
bibtex: '@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case},
DOI={10.1109/NETSOFT.2018.8460029},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian,
Marvin and Karl, Holger}, year={2018}, pages={318--322} }'
chicago: 'Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating
Resource and Performance Models for Service Function Chains: The Video Streaming
Case.” In 4th IEEE International Conference on Network Softwarization (NetSoft
2018), 318--322. IEEE, 2018. https://doi.org/10.1109/NETSOFT.2018.8460029.'
ieee: 'S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and
Performance Models for Service Function Chains: The Video Streaming Case,” in
4th IEEE International Conference on Network Softwarization (NetSoft 2018),
Montreal, 2018, pp. 318--322.'
mla: 'Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service
Function Chains: The Video Streaming Case.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322, doi:10.1109/NETSOFT.2018.8460029.'
short: 'S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322.'
conference:
end_date: 2018-07-29
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
start_date: 2018-07-25
date_created: 2018-04-24T12:11:36Z
date_updated: 2022-01-06T06:56:37Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8460029
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:18:12Z
date_updated: 2018-12-12T15:18:12Z
file_id: '6195'
file_name: 08460029.pdf
file_size: 2211450
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-24T10:17:00Z
date_updated: 2019-01-24T10:17:00Z
file_id: '6968'
file_name: NetSoft18_RIS.pdf
file_size: 3445650
relation: main_file
file_date_updated: 2019-01-24T10:17:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 318--322
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publisher: IEEE
status: public
title: 'Generating Resource and Performance Models for Service Function Chains: The
Video Streaming Case'
type: conference
user_id: '31764'
year: '2018'
...
---
_id: '2481'
abstract:
- lang: eng
text: Network function virtualization requires scaling and placement, deciding the
number and the location of function instances. Current approaches are limited
in flexibility and practical applicability. Specifically, we study dynamic, single-step,
joint scaling and placement of network services with bidirectional flows traversing
Physical or Virtual Network Functions (VNFs) and returning to their sources. We
develop models to support stateful components and legacy network functions with
fixed locations in these network services as well as the possibility of reusing
VNFs across network services. We formalize the problem of jointly scaling and
placing such network services as a mixed- integer linear program (MILP). We show
that this problem is NP-complete and also present a heuristic algorithm to find
good solutions in short time. In an extensive evaluation with realistic scenarios,
we investigate the capabilities of the two approaches.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Schneider SB, Karl H. Scaling and Placing Bidirectional Services
with Stateful Virtual and Physical Network Functions. In: 4th IEEE International
Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:123--131.'
apa: 'Dräxler, S., Schneider, S. B., & Karl, H. (2018). Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions. In
4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 123--131). Montreal: IEEE.'
bibtex: '@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar
and Karl, Holger}, year={2018}, pages={123--131} }'
chicago: Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling
and Placing Bidirectional Services with Stateful Virtual and Physical Network
Functions.” In 4th IEEE International Conference on Network Softwarization
(NetSoft 2018), 123--131. IEEE, 2018.
ieee: S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional
Services with Stateful Virtual and Physical Network Functions,” in 4th IEEE
International Conference on Network Softwarization (NetSoft 2018), Montreal,
2018, pp. 123--131.
mla: Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful
Virtual and Physical Network Functions.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.
short: 'S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.'
conference:
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
date_created: 2018-04-24T12:14:00Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T07:40:57Z
date_updated: 2018-06-25T07:40:57Z
file_id: '3319'
file_name: RIS.pdf
file_size: 1471937
relation: main_file
file_date_updated: 2018-06-25T07:40:57Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 123--131
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publication_status: published
publisher: IEEE
status: public
title: ' Scaling and Placing Bidirectional Services with Stateful Virtual and Physical
Network Functions'
type: conference
urn: '24814'
user_id: '477'
year: '2018'
...
---
_id: '2483'
abstract:
- lang: eng
text: Understanding the behavior of distributed cloud service components in different
load situations is important for efficient and automatic management and orchestration
of these services. For this purpose and for practical research in distributed
cloud computing in general, there is need for benchmarks and experimental data.
In this paper, we describe our experiments for characterizing the relationship
between resource demands of application components and the expected performance
of applica- tions. We present initial results for predicting the interdependence
between resource demands and performance characteristics using support vector
regression and polynomial regression models. The data gathered from our experiments
is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler S, Peuster M, Illian M, Karl H. Towards Predicting Resource Demands
and Performance of Distributed Cloud Services. Wien, Darmstadt; 2018.
apa: Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Towards Predicting
Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt.
bibtex: '@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch
Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance
of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and
Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog
Computing 2018} }'
chicago: Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. Towards
Predicting Resource Demands and Performance of Distributed Cloud Services.
KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.
ieee: S. Dräxler, M. Peuster, M. Illian, and H. Karl, Towards Predicting Resource
Demands and Performance of Distributed Cloud Services. Wien, Darmstadt, 2018.
mla: Dräxler, Sevil, et al. Towards Predicting Resource Demands and Performance
of Distributed Cloud Services. 2018.
short: S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands
and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018.
date_created: 2018-04-24T12:22:40Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '000'
department:
- _id: '75'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14
oa: '1'
place: Wien, Darmstadt
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication_status: published
related_material:
link:
- relation: confirmation
url: http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843
series_title: KuVS-Fachgespräch Fog Computing 2018
status: public
title: Towards Predicting Resource Demands and Performance of Distributed Cloud Services
type: report
user_id: '31764'
year: '2018'
...
---
_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. 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018).
Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51'
apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
(Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51'
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={10.4230/LIPIcs.ICALP.2018.51},
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 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), 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. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.'
ieee: B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,”
in 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018),
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
51:1-51:24.'
conference:
end_date: 2018-07-13
location: Prag
name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018)
start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
full_name: Chatzigiannakis, Ioannis
last_name: Chatzigiannakis
- first_name: Christos
full_name: Kaklamanis, Christos
last_name: Kaklamanis
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
- first_name: Donald
full_name: Sannella, Donald
last_name: Sannella
external_id:
arxiv:
- '1711.01231'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:18Z
date_updated: 2018-10-31T16:58:18Z
file_id: '5227'
file_name: LIPIcs-ICALP-2018-51.pdf
file_size: 723824
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '16'
name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)
publication_identifier:
isbn:
- 978-3-95977-076-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2485'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities.
In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389'
apa: 'Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location
with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389'
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
Location with Mobile Facilities}, DOI={10.1145/3210377.3210389},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.
ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), Wien, 2018, pp. 373–381.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
location: Wien
name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:42:33Z
date_updated: 2018-11-02T14:42:33Z
file_id: '5280'
file_name: p373-feldkord.pdf
file_size: 1207546
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2490'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Szopinski D, Kundisch D. Business model idea generation: An exploratory study
on changing perspectives. In: 2nd Business Model Conference. ; 2018.'
apa: 'Szopinski, D., & Kundisch, D. (2018). Business model idea generation:
An exploratory study on changing perspectives. In 2nd Business Model Conference.
Florence, Italy.'
bibtex: '@inproceedings{Szopinski_Kundisch_2018, title={Business model idea generation:
An exploratory study on changing perspectives}, booktitle={2nd Business Model
Conference}, author={Szopinski, Daniel and Kundisch, Dennis}, year={2018} }'
chicago: 'Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation:
An Exploratory Study on Changing Perspectives.” In 2nd Business Model Conference,
2018.'
ieee: 'D. Szopinski and D. Kundisch, “Business model idea generation: An exploratory
study on changing perspectives,” in 2nd Business Model Conference, Florence,
Italy, 2018.'
mla: 'Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An
Exploratory Study on Changing Perspectives.” 2nd Business Model Conference,
2018.'
short: 'D. Szopinski, D. Kundisch, in: 2nd Business Model Conference, 2018.'
conference:
end_date: 2018-06-07
location: Florence, Italy
name: 2nd Business Model Conference
start_date: 2018-06-06
date_created: 2018-04-25T13:03:08Z
date_updated: 2022-01-06T06:56:40Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:24:21Z
date_updated: 2018-11-12T13:24:21Z
file_id: '5505'
file_name: BuMoCo2018_Standardization.pdf
file_size: 589100
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:24:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: 2nd Business Model Conference
status: public
title: 'Business model idea generation: An exploratory study on changing perspectives'
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '2491'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Szopinski D. How to teach business model innovation to 300+ students: An experience
report. In: 2nd Business Model Conference. ; 2018.'
apa: 'Szopinski, D. (2018). How to teach business model innovation to 300+ students:
An experience report. In 2nd Business Model Conference. Florence, Italy.'
bibtex: '@inproceedings{Szopinski_2018, title={How to teach business model innovation
to 300+ students: An experience report}, booktitle={2nd Business Model Conference},
author={Szopinski, Daniel}, year={2018} }'
chicago: 'Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students:
An Experience Report.” In 2nd Business Model Conference, 2018.'
ieee: 'D. Szopinski, “How to teach business model innovation to 300+ students: An
experience report,” in 2nd Business Model Conference, Florence, Italy,
2018.'
mla: 'Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students:
An Experience Report.” 2nd Business Model Conference, 2018.'
short: 'D. Szopinski, in: 2nd Business Model Conference, 2018.'
conference:
end_date: 2018-06-07
location: Florence, Italy
name: 2nd Business Model Conference
start_date: 2018-06-06
date_created: 2018-04-25T13:22:19Z
date_updated: 2022-01-06T06:56:41Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:24:39Z
date_updated: 2018-11-12T13:24:39Z
file_id: '5506'
file_name: BuMoCo2018_Teaching.pdf
file_size: 966252
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:24:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: 2nd Business Model Conference
status: public
title: 'How to teach business model innovation to 300+ students: An experience report'
type: conference_abstract
user_id: '477'
year: '2018'
...
---
_id: '2559'
author:
- first_name: Lukas Sebastian
full_name: Arendt, Lukas Sebastian
last_name: Arendt
citation:
ama: 'Arendt LS. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn; 2018.'
apa: 'Arendt, L. S. (2018). Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn.'
bibtex: '@book{Arendt_2018, place={Universität Paderborn}, title={Datengetriebene
Geschäftsmodelle: Ein Literaturüberblick}, author={Arendt, Lukas Sebastian}, year={2018}
}'
chicago: 'Arendt, Lukas Sebastian. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn, 2018.'
ieee: 'L. S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
Universität Paderborn, 2018.'
mla: 'Arendt, Lukas Sebastian. Datengetriebene Geschäftsmodelle: Ein Literaturüberblick.
2018.'
short: 'L.S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick, Universität
Paderborn, 2018.'
date_created: 2018-04-27T08:56:59Z
date_updated: 2022-01-06T06:57:07Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Datengetriebene Geschäftsmodelle: Ein Literaturüberblick'
type: bachelorsthesis
user_id: '16205'
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: Proceedings of the 13th Workshop on Economics
of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659'
apa: Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating
User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6).
Irvine, California, USA. https://doi.org/10.1145/3230654.3230659
bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659},
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 Proceedings of
the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018),
5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine,
California, USA, 2018, pp. 5:1-5:6.
mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
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: '2848'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
apa: Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible
Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.
https://doi.org/10.1007/s00453-018-0420-y
bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y},
number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
}'
chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5
(2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.'
ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574,
2018.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:18:16Z
date_updated: 2018-11-02T15:18:16Z
file_id: '5298'
file_name: TowardsFlexibleDemandsInOnline.pdf
file_size: 600583
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
DOI={10.1007/s00224-017-9836-z},
journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2018} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
Theory of Computing Systems, 2018.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems,
Springer, 2018, doi:10.1007/s00224-017-9836-z.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:24:32Z
date_updated: 2018-11-02T15:24:32Z
file_id: '5301'
file_name: ApproximationAndHeuristicAlgor.pdf
file_size: 1371624
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:24:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_identifier:
unknown:
- 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
citation:
ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive:
Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018.
doi:10.4230/LIPIcs.FUN.2018.22'
apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018).
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms
(FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22'
bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22},
booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
year={2018} }'
chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse
Based on Online Connected Dominating Sets.” In Ninth International Conference
on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.'
ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
& Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets,” in Ninth International Conference on Fun with Algorithms
(FUN), 2018.'
mla: 'Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern
Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference
on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.'
short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:15:19Z
date_updated: 2018-11-13T13:15:19Z
file_id: '5536'
file_name: LIPIcs-FUN-2018-22.pdf
file_size: 554298
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:15:19Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '2857'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning.
In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning. AAAI;
2018:31-39.'
apa: 'Mohr, F., Lettmann, T., Hüllermeier, E., & Wever, M. D. (2018). Programmatic
Task Network Planning. In Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning (pp. 31–39). Delft, Netherlands: AAAI.'
bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic
Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier,
Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }'
chicago: Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever.
“Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop
on Hierarchical Planning, 31–39. AAAI, 2018.
ieee: F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task
Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning, Delft, Netherlands, 2018, pp. 31–39.
mla: Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of
the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.
short: 'F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the
1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.'
conference:
end_date: 2018-06-29
location: Delft, Netherlands
name: 28th International Conference on Automated Planning and Scheduling
start_date: 2018-06-24
date_created: 2018-05-24T09:00:20Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:18:26Z
date_updated: 2018-11-06T15:18:26Z
file_id: '5384'
file_name: Mohr18ProgrammaticPlanning.pdf
file_size: 349958
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:18:26Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf
oa: '1'
page: 31-39
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning
publisher: AAAI
status: public
title: Programmatic Task Network Planning
type: conference
user_id: '315'
year: '2018'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2471'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes.
In: SCC. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:10.1109/SCC.2018.00036'
apa: 'Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). On-The-Fly Service Construction
with Prototypes. In SCC. San Francisco, CA, USA: IEEE Computer Society.
https://doi.org/10.1109/SCC.2018.00036'
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA},
title={On-The-Fly Service Construction with Prototypes}, DOI={10.1109/SCC.2018.00036},
booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2018} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service
Construction with Prototypes.” In SCC. San Francisco, CA, USA: IEEE Computer
Society, 2018. https://doi.org/10.1109/SCC.2018.00036.'
ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction
with Prototypes,” in SCC, San Francisco, CA, USA, 2018.
mla: Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” SCC,
IEEE Computer Society, 2018, doi:10.1109/SCC.2018.00036.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San
Francisco, CA, USA, 2018.'
conference:
end_date: 2018-07-07
location: San Francisco, CA, USA
name: IEEE International Conference on Services Computing, SCC 2018
start_date: 2018-07-02
date_created: 2018-04-23T11:40:20Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00036
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:15:38Z
date_updated: 2018-11-06T15:15:38Z
file_id: '5383'
file_name: 08456422.pdf
file_size: 356132
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:15:38Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ieeexplore.ieee.org/abstract/document/8456422
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: SCC
publisher: IEEE Computer Society
status: public
title: On-The-Fly Service Construction with Prototypes
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '2472'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC); 2018. doi:
10.1109/WCNC.2018.8377335'
apa: Auroux, S., & Karl, H. (2018). Distributed Placement of Virtualized Control
Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC). https://doi.org/
10.1109/WCNC.2018.8377335
bibtex: '@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks}, DOI={ 10.1109/WCNC.2018.8377335}, publisher={Proc. of
IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux,
Sébastien and Karl, Holger}, year={2018} }'
chicago: Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018. https://doi.org/
10.1109/WCNC.2018.8377335.
ieee: S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications
in Mobile Backhaul Networks,” 2018.
mla: Auroux, Sébastien, and Holger Karl. Distributed Placement of Virtualized
Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018, doi:
10.1109/WCNC.2018.8377335.
short: 'S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC), 2018.'
date_created: 2018-04-24T08:04:28Z
date_updated: 2022-01-06T06:56:33Z
ddc:
- '000'
department:
- _id: '75'
doi: ' 10.1109/WCNC.2018.8377335'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-24T08:04:02Z
date_updated: 2018-04-24T08:04:02Z
file_id: '2473'
file_name: p2262-auroux.pdf
file_size: 371352
relation: main_file
success: 1
file_date_updated: 2018-04-24T08:04:02Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: Distributed Placement of Virtualized Control Applications in Mobile Backhaul
Networks
type: conference
user_id: '126'
year: '2018'
...
---
_id: '2564'
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
citation:
ama: 'Gutt D. In the Eye of the Beholder? – Empirically Decomposing Different Economic
Implications of the Online Rating Variance. In: Proceedings of the 25th European
Conference on Information Systems (ECIS). ; 2018.'
apa: Gutt, D. (2018). In the Eye of the Beholder? – Empirically Decomposing Different
Economic Implications of the Online Rating Variance. In Proceedings of the
25th European Conference on Information Systems (ECIS). Portsmouth, UK.
bibtex: '@inproceedings{Gutt_2018, title={In the Eye of the Beholder? – Empirically
Decomposing Different Economic Implications of the Online Rating Variance}, booktitle={Proceedings
of the 25th European Conference on Information Systems (ECIS)}, author={Gutt,
Dominik}, year={2018} }'
chicago: Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different
Economic Implications of the Online Rating Variance.” In Proceedings of the
25th European Conference on Information Systems (ECIS), 2018.
ieee: D. Gutt, “In the Eye of the Beholder? – Empirically Decomposing Different
Economic Implications of the Online Rating Variance,” in Proceedings of the
25th European Conference on Information Systems (ECIS), Portsmouth, UK, 2018.
mla: Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different
Economic Implications of the Online Rating Variance.” Proceedings of the 25th
European Conference on Information Systems (ECIS), 2018.
short: 'D. Gutt, in: Proceedings of the 25th European Conference on Information
Systems (ECIS), 2018.'
conference:
end_date: 2018-06-28
location: Portsmouth, UK
name: 25th European Conference on Information Systems (ECIS)
start_date: 2018-06-23
date_created: 2018-05-02T13:10:34Z
date_updated: 2022-01-06T06:57:08Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T09:56:27Z
date_updated: 2018-11-12T09:56:27Z
file_id: '5475'
file_name: 1359-doc.pdf
file_size: 553078
relation: main_file
success: 1
file_date_updated: 2018-11-12T09:56:27Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Proceedings of the 25th European Conference on Information Systems (ECIS)
publication_status: published
status: public
title: In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications
of the Online Rating Variance
type: conference
user_id: '16205'
year: '2018'
...
---
_id: '2565'
abstract:
- lang: eng
text: This note deals with agreeability in nontransferable utility (NTU) differential
games. We introduce state feedback Pareto weights to enrich the set of efficient
cooperative solutions. The framework is particularly useful if constant weights
fail to support agreeability, but cooperation is desired nonetheless. The concept
is applied to an adverting differential game.
author:
- first_name: Simon
full_name: Hoof, Simon
id: '59676'
last_name: Hoof
citation:
ama: Hoof S. Feedback Pareto Weights in Cooperative NTU Differential Games.
Vol 112. CIE Working Paper Series, Paderborn University; 2018.
apa: Hoof, S. (2018). Feedback Pareto weights in cooperative NTU differential
games (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. Feedback Pareto Weights in Cooperative NTU Differential
Games. Vol. 112. Working Papers CIE. CIE Working Paper Series, Paderborn University,
2018.
ieee: S. Hoof, Feedback Pareto weights in cooperative NTU differential games,
vol. 112. CIE Working Paper Series, Paderborn University, 2018.
mla: Hoof, Simon. Feedback Pareto Weights in Cooperative NTU Differential Games.
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. Economics Letters. 2018;170:39-41. doi:10.1016/j.econlet.2018.05.033
apa: Haake, C.-J., & Stroh-Maraun, N. (2018). Outcome Equivalence in School
Choice with Reciprocal Preferences. Economics Letters, 170, 39–41.
https://doi.org/10.1016/j.econlet.2018.05.033
bibtex: '@article{Haake_Stroh-Maraun_2018, title={Outcome Equivalence in School
Choice with Reciprocal Preferences}, volume={170}, DOI={10.1016/j.econlet.2018.05.033},
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.” Economics Letters 170 (2018): 39–41.
https://doi.org/10.1016/j.econlet.2018.05.033.'
ieee: C.-J. Haake and N. Stroh-Maraun, “Outcome Equivalence in School Choice with
Reciprocal Preferences,” Economics Letters, vol. 170, pp. 39–41, 2018.
mla: Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School
Choice with Reciprocal Preferences.” Economics Letters, vol. 170, Elsevier,
2018, pp. 39–41, doi:10.1016/j.econlet.2018.05.033.
short: C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.
date_created: 2018-05-03T07:53:56Z
date_updated: 2022-01-06T06:57:09Z
ddc:
- '040'
department:
- _id: '205'
doi: 10.1016/j.econlet.2018.05.033
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T08:08:17Z
date_updated: 2018-08-09T09:15:07Z
file_id: '3854'
file_name: 1-s2.0-S016517651830212X-main.pdf
file_size: 261888
relation: main_file
title: Outcome equivalence in school choice with reciprocal preferences
file_date_updated: 2018-08-09T09:15:07Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
page: 39 - 41
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Economics Letters
publication_status: published
publisher: Elsevier
status: public
title: Outcome Equivalence in School Choice with Reciprocal Preferences
type: journal_article
urn: '25669'
user_id: '477'
volume: 170
year: '2018'
...
---
_id: '2660'
author:
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring
the Relationship Between Offline Locations and Online Rating Behavior. In: Conference
Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research
(SCECR). ; 2018.'
apa: Neumann, J., Gutt, D., & Kundisch, D. (2018). The Traveling Reviewer Problem
- Exploring the Relationship Between Offline Locations and Online Rating Behavior.
In Conference Abstracts of the Symposium on Statistical Challenges in Electronic
Commerce Research (SCECR). Rotterdam, Netherland.
bibtex: '@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer
Problem - Exploring the Relationship Between Offline Locations and Online Rating
Behavior}, booktitle={Conference Abstracts of the Symposium on Statistical Challenges
in Electronic Commerce Research (SCECR)}, author={Neumann, Jürgen and Gutt, Dominik
and Kundisch, Dennis}, year={2018} }'
chicago: Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer
Problem - Exploring the Relationship Between Offline Locations and Online Rating
Behavior.” In Conference Abstracts of the Symposium on Statistical Challenges
in Electronic Commerce Research (SCECR), 2018.
ieee: J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring
the Relationship Between Offline Locations and Online Rating Behavior,” in Conference
Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research
(SCECR), Rotterdam, Netherland, 2018.
mla: Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship
Between Offline Locations and Online Rating Behavior.” Conference Abstracts
of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR),
2018.
short: 'J. Neumann, D. Gutt, D. Kundisch, in: Conference Abstracts of the Symposium
on Statistical Challenges in Electronic Commerce Research (SCECR), 2018.'
conference:
location: Rotterdam, Netherland
name: Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)
date_created: 2018-05-04T12:39:06Z
date_updated: 2022-01-06T06:57:23Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T10:37:12Z
date_updated: 2018-11-12T10:37:12Z
file_id: '5491'
file_name: WP_TRP.pdf
file_size: 694342
relation: main_file
success: 1
file_date_updated: 2018-11-12T10:37:12Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Conference Abstracts of the Symposium on Statistical Challenges in Electronic
Commerce Research (SCECR)
status: public
title: The Traveling Reviewer Problem - Exploring the Relationship Between Offline
Locations and Online Rating Behavior
type: conference_abstract
user_id: '477'
year: '2018'
...