---
_id: '29839'
abstract:
- lang: eng
text: 'The development of business models is a challenging task that can be supported
with software tools. Here, existing approaches and tools do not focus on the company’s
situation in which the development takes place (e.g., financial resources, product
type). To tackle this challenge, we used design science research to develop a
situation-specific business model development approach that contains three stages:
First, existing knowledge in terms of tasks to do (e.g., analyze competitive advantage),
and decisions to be made (e.g., social media marketing) are stored in repositories.
Second, the knowledge is used to compose a development method based on the company’s
situation. Third, the development method is enacted to develop a business model.
This demonstration paper presents a tool-support called Situational Business Model
Developer that supports all stages of our approach. We release the tool under
open-source and evaluate it with a case study on developing business models for
mobile apps.'
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Alexander
full_name: Nowosad, Alexander
last_name: Nowosad
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situational Business Model
Developer: A Tool-support for Situation-specific Business Model Development. In:
Proceedings of the 17th International Conference on Wirtschaftsinformatik.
AIS; 2022.'
apa: 'Gottschalk, S., Yigitbas, E., Nowosad, A., & Engels, G. (2022). Situational
Business Model Developer: A Tool-support for Situation-specific Business Model
Development. Proceedings of the 17th International Conference on Wirtschaftsinformatik.
17th International Conference on Wirtschaftsinformatik, Nuremberg.'
bibtex: '@inproceedings{Gottschalk_Yigitbas_Nowosad_Engels_2022, title={Situational
Business Model Developer: A Tool-support for Situation-specific Business Model
Development}, booktitle={Proceedings of the 17th International Conference on Wirtschaftsinformatik},
publisher={AIS}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad,
Alexander and Engels, Gregor}, year={2022} }'
chicago: 'Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels.
“Situational Business Model Developer: A Tool-Support for Situation-Specific Business
Model Development.” In Proceedings of the 17th International Conference on
Wirtschaftsinformatik. AIS, 2022.'
ieee: 'S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situational Business
Model Developer: A Tool-support for Situation-specific Business Model Development,”
presented at the 17th International Conference on Wirtschaftsinformatik, Nuremberg,
2022.'
mla: 'Gottschalk, Sebastian, et al. “Situational Business Model Developer: A Tool-Support
for Situation-Specific Business Model Development.” Proceedings of the 17th
International Conference on Wirtschaftsinformatik, AIS, 2022.'
short: 'S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the
17th International Conference on Wirtschaftsinformatik, AIS, 2022.'
conference:
end_date: 2022-02-23
location: Nuremberg
name: 17th International Conference on Wirtschaftsinformatik
start_date: 2022-02-21
date_created: 2022-02-15T07:20:21Z
date_updated: 2022-02-15T07:26:26Z
department:
- _id: '66'
- _id: '534'
keyword:
- Business Model Development
- Situational Method Engineering
- Tool Support
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://aisel.aisnet.org/wi2022/prototype_track/prototype_track/34/
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
publication: Proceedings of the 17th International Conference on Wirtschaftsinformatik
publisher: AIS
status: public
title: 'Situational Business Model Developer: A Tool-support for Situation-specific
Business Model Development'
type: conference
user_id: '47208'
year: '2022'
...
---
_id: '29672'
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
citation:
ama: 'Schneider SB. Network and Service Coordination: Conventional and Machine
Learning Approaches".; 2022. doi:10.17619/UNIPB/1-1276 '
apa: 'Schneider, S. B. (2022). Network and Service Coordination: Conventional
and Machine Learning Approaches". https://doi.org/10.17619/UNIPB/1-1276 '
bibtex: '@book{Schneider_2022, title={Network and Service Coordination: Conventional
and Machine Learning Approaches"}, DOI={10.17619/UNIPB/1-1276 }, author={Schneider, Stefan Balthasar}, year={2022}
}'
chicago: 'Schneider, Stefan Balthasar. Network and Service Coordination: Conventional
and Machine Learning Approaches", 2022. https://doi.org/10.17619/UNIPB/1-1276 .'
ieee: 'S. B. Schneider, Network and Service Coordination: Conventional and Machine
Learning Approaches". 2022.'
mla: 'Schneider, Stefan Balthasar. Network and Service Coordination: Conventional
and Machine Learning Approaches". 2022, doi:10.17619/UNIPB/1-1276 .'
short: 'S.B. Schneider, Network and Service Coordination: Conventional and Machine
Learning Approaches", 2022.'
date_created: 2022-01-31T07:08:47Z
date_updated: 2022-02-18T08:17:36Z
department:
- _id: '75'
doi: '10.17619/UNIPB/1-1276 '
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
status: public
supervisor:
- first_name: Karl
full_name: Holger, Karl
last_name: Holger
title: 'Network and Service Coordination: Conventional and Machine Learning Approaches"'
type: dissertation
user_id: '15504'
year: '2022'
...
---
_id: '29945'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Lucas David
full_name: Reuter, Lucas David
last_name: Reuter
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization
for Approximate Logic Synthesis . In: 2022 59th ACM/IEEE Design Automation
Conference (DAC).'
apa: Witschen, L. M., Wiersema, T., Reuter, L. D., & Platzner, M. (n.d.). Search
Space Characterization for Approximate Logic Synthesis . 2022 59th ACM/IEEE
Design Automation Conference (DAC). 2022 59th ACM/IEEE Design Automation Conference
(DAC), San Francisco, USA.
bibtex: '@inproceedings{Witschen_Wiersema_Reuter_Platzner, title={Search Space Characterization
for Approximate Logic Synthesis }, booktitle={2022 59th ACM/IEEE Design Automation
Conference (DAC)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Reuter,
Lucas David and Platzner, Marco} }'
chicago: Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco
Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In
2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.
ieee: L. M. Witschen, T. Wiersema, L. D. Reuter, and M. Platzner, “Search Space
Characterization for Approximate Logic Synthesis ,” presented at the 2022 59th
ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.
mla: Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate
Logic Synthesis .” 2022 59th ACM/IEEE Design Automation Conference (DAC).
short: 'L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE
Design Automation Conference (DAC), n.d.'
conference:
end_date: 2022-07-14
location: San Francisco, USA
name: 2022 59th ACM/IEEE Design Automation Conference (DAC)
start_date: 2022-07-10
date_created: 2022-02-22T07:51:38Z
date_updated: 2022-02-22T07:51:42Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
publication: 2022 59th ACM/IEEE Design Automation Conference (DAC)
publication_status: accepted
status: public
title: 'Search Space Characterization for Approximate Logic Synthesis '
type: conference
user_id: '49051'
year: '2022'
...
---
_id: '29865'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Matthias
full_name: Artmann, Matthias
last_name: Artmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit
Approximation Technique. In: Design, Automation and Test in Europe (DATE).'
apa: 'Witschen, L. M., Wiersema, T., Artmann, M., & Platzner, M. (n.d.). MUSCAT:
MUS-based Circuit Approximation Technique. Design, Automation and Test in Europe
(DATE). Design, Automation and Test in Europe (DATE), Online.'
bibtex: '@inproceedings{Witschen_Wiersema_Artmann_Platzner, title={MUSCAT: MUS-based
Circuit Approximation Technique}, booktitle={Design, Automation and Test in Europe
(DATE)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Artmann, Matthias
and Platzner, Marco} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco
Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In Design, Automation
and Test in Europe (DATE), n.d.'
ieee: 'L. M. Witschen, T. Wiersema, M. Artmann, and M. Platzner, “MUSCAT: MUS-based
Circuit Approximation Technique,” presented at the Design, Automation and Test
in Europe (DATE), Online.'
mla: 'Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation
Technique.” Design, Automation and Test in Europe (DATE).'
short: 'L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation
and Test in Europe (DATE), n.d.'
conference:
location: Online
name: Design, Automation and Test in Europe (DATE)
date_created: 2022-02-16T16:22:23Z
date_updated: 2022-02-22T07:52:01Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Design, Automation and Test in Europe (DATE)
publication_status: accepted
status: public
title: 'MUSCAT: MUS-based Circuit Approximation Technique'
type: conference
user_id: '49051'
year: '2022'
...
---
_id: '30152'
author:
- first_name: Rajanna
full_name: Roopa, Rajanna
last_name: Roopa
citation:
ama: Roopa R. Evaluation of Algorithms for the Node Capacitated Clique.;
2022.
apa: Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.
bibtex: '@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated
Clique}, author={Roopa, Rajanna}, year={2022} }'
chicago: Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique,
2022.
ieee: R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique.
2022.
mla: Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique.
2022.
short: R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.
date_created: 2022-02-28T07:46:23Z
date_updated: 2022-02-28T07:46:53Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Evaluation of Algorithms for the Node Capacitated Clique
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '30198'
author:
- first_name: Sebastian
full_name: Korzeczek, Sebastian
last_name: Korzeczek
citation:
ama: Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.
apa: Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.
bibtex: '@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider},
author={Korzeczek, Sebastian}, year={2022} }'
chicago: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider,
2022.
ieee: S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.
mla: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider.
2022.
short: S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.
date_created: 2022-03-03T07:47:00Z
date_updated: 2022-03-03T07:51:02Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Aufarbeitung und lmplementierung von DAG-Rider
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '30199'
author:
- first_name: Marcel
full_name: Nachtigall, Marcel
last_name: Nachtigall
citation:
ama: Nachtigall M. Hybrid Routing in Three Dimensions.; 2022.
apa: Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.
bibtex: '@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall,
Marcel}, year={2022} }'
chicago: Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.
ieee: M. Nachtigall, Hybrid Routing in Three Dimensions. 2022.
mla: Nachtigall, Marcel. Hybrid Routing in Three Dimensions. 2022.
short: M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.
date_created: 2022-03-03T07:50:45Z
date_updated: 2022-03-03T07:50:59Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Hybrid Routing in Three Dimensions
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '30236'
abstract:
- lang: eng
text: "Recent reinforcement learning approaches for continuous control in wireless
mobile networks have shown impressive\r\nresults. But due to the lack of open
and compatible simulators, authors typically create their own simulation environments
for training and evaluation. This is cumbersome and time-consuming for authors
and limits reproducibility and comparability, ultimately impeding progress in
the field.\r\n\r\nTo this end, we propose mobile-env, a simple and open platform
for training, evaluating, and comparing reinforcement learning and conventional
approaches for continuous control in mobile wireless networks. mobile-env is lightweight
and implements the common OpenAI Gym interface and additional wrappers, which
allows connecting virtually any single-agent or multi-agent reinforcement learning
framework to the environment. While mobile-env provides sensible default values
and can be used out of the box, it also has many configuration options and is
easy to extend. We therefore believe mobile-env to be a valuable platform for
driving meaningful progress in autonomous coordination of\r\nwireless mobile networks."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Stefan
full_name: Werner, Stefan
last_name: Werner
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Werner S, Khalili R, Hecker A, Karl H. mobile-env: An Open Platform
for Reinforcement Learning in Wireless Mobile Networks. In: IEEE/IFIP Network
Operations and Management Symposium (NOMS). IEEE; 2022.'
apa: 'Schneider, S. B., Werner, S., Khalili, R., Hecker, A., & Karl, H. (2022).
mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks.
IEEE/IFIP Network Operations and Management Symposium (NOMS). IEEE/IFIP
Network Operations and Management Symposium (NOMS), Budapest.'
bibtex: '@inproceedings{Schneider_Werner_Khalili_Hecker_Karl_2022, title={mobile-env:
An Open Platform for Reinforcement Learning in Wireless Mobile Networks}, booktitle={IEEE/IFIP
Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Werner, Stefan and Khalili, Ramin and Hecker, Artur and Karl,
Holger}, year={2022} }'
chicago: 'Schneider, Stefan Balthasar, Stefan Werner, Ramin Khalili, Artur Hecker,
and Holger Karl. “Mobile-Env: An Open Platform for Reinforcement Learning in Wireless
Mobile Networks.” In IEEE/IFIP Network Operations and Management Symposium
(NOMS). IEEE, 2022.'
ieee: 'S. B. Schneider, S. Werner, R. Khalili, A. Hecker, and H. Karl, “mobile-env:
An Open Platform for Reinforcement Learning in Wireless Mobile Networks,” presented
at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest,
2022.'
mla: 'Schneider, Stefan Balthasar, et al. “Mobile-Env: An Open Platform for Reinforcement
Learning in Wireless Mobile Networks.” IEEE/IFIP Network Operations and Management
Symposium (NOMS), IEEE, 2022.'
short: 'S.B. Schneider, S. Werner, R. Khalili, A. Hecker, H. Karl, in: IEEE/IFIP
Network Operations and Management Symposium (NOMS), IEEE, 2022.'
conference:
end_date: 2022-04-29
location: Budapest
name: IEEE/IFIP Network Operations and Management Symposium (NOMS)
start_date: 2022-04-25
date_created: 2022-03-10T18:28:14Z
date_updated: 2022-03-10T18:28:19Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2022-03-10T18:25:41Z
date_updated: 2022-03-10T18:25:41Z
file_id: '30237'
file_name: author_version.pdf
file_size: 223412
relation: main_file
file_date_updated: 2022-03-10T18:25:41Z
has_accepted_license: '1'
keyword:
- wireless mobile networks
- network management
- continuous control
- cognitive networks
- autonomous coordination
- reinforcement learning
- gym environment
- simulation
- open source
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: IEEE/IFIP Network Operations and Management Symposium (NOMS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile
Networks'
type: conference
user_id: '35343'
year: '2022'
...
---
_id: '30201'
author:
- first_name: Patrizia
full_name: Fanasch, Patrizia
last_name: Fanasch
citation:
ama: Fanasch P. Governance and Reputation in the Market for Experience Goods.;
2022. doi:10.17619/UNIPB/1-1292
apa: Fanasch, P. (2022). Governance and Reputation in the Market for Experience
Goods. https://doi.org/10.17619/UNIPB/1-1292
bibtex: '@book{Fanasch_2022, title={Governance and Reputation in the Market for
Experience Goods}, DOI={10.17619/UNIPB/1-1292
}, author={Fanasch, Patrizia}, year={2022} }'
chicago: Fanasch, Patrizia. Governance and Reputation in the Market for Experience
Goods, 2022. https://doi.org/10.17619/UNIPB/1-1292
.
ieee: P. Fanasch, Governance and Reputation in the Market for Experience Goods.
2022.
mla: Fanasch, Patrizia. Governance and Reputation in the Market for Experience
Goods. 2022, doi:10.17619/UNIPB/1-1292
.
short: P. Fanasch, Governance and Reputation in the Market for Experience Goods,
2022.
date_created: 2022-03-03T10:20:06Z
date_updated: 2022-03-11T06:08:40Z
department:
- _id: '183'
doi: '10.17619/UNIPB/1-1292 '
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '8'
name: 'SFB 901 - A4: SFB 901 - Subproject A4'
status: public
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
id: '16019'
last_name: Frick
title: Governance and Reputation in the Market for Experience Goods
type: dissertation
user_id: '15504'
year: '2022'
...
---
_id: '30341'
author:
- first_name: Britta
full_name: Hoyer, Britta
id: '42447'
last_name: Hoyer
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
citation:
ama: Hoyer B, van Straaten D. Anonymity and Self-Expression in Online Rating Systems
- An Experimental Analysis. Journal of Behavioral and Experimental Economics.
2022;98:101869. doi:10.1016/j.socec.2022.101869
apa: Hoyer, B., & van Straaten, D. (2022). Anonymity and Self-Expression in
Online Rating Systems - An Experimental Analysis. Journal of Behavioral and
Experimental Economics, 98, 101869. https://doi.org/10.1016/j.socec.2022.101869
bibtex: '@article{Hoyer_van Straaten_2022, title={Anonymity and Self-Expression
in Online Rating Systems - An Experimental Analysis}, volume={98}, DOI={10.1016/j.socec.2022.101869},
journal={Journal of Behavioral and Experimental Economics}, publisher={Elsevier
BV}, author={Hoyer, Britta and van Straaten, Dirk}, year={2022}, pages={101869}
}'
chicago: 'Hoyer, Britta, and Dirk van Straaten. “Anonymity and Self-Expression in
Online Rating Systems - An Experimental Analysis.” Journal of Behavioral and
Experimental Economics 98 (2022): 101869. https://doi.org/10.1016/j.socec.2022.101869.'
ieee: 'B. Hoyer and D. van Straaten, “Anonymity and Self-Expression in Online Rating
Systems - An Experimental Analysis,” Journal of Behavioral and Experimental
Economics, vol. 98, p. 101869, 2022, doi: 10.1016/j.socec.2022.101869.'
mla: Hoyer, Britta, and Dirk van Straaten. “Anonymity and Self-Expression in Online
Rating Systems - An Experimental Analysis.” Journal of Behavioral and Experimental
Economics, vol. 98, Elsevier BV, 2022, p. 101869, doi:10.1016/j.socec.2022.101869.
short: B. Hoyer, D. van Straaten, Journal of Behavioral and Experimental Economics
98 (2022) 101869.
date_created: 2022-03-16T06:24:37Z
date_updated: 2022-03-21T06:07:39Z
department:
- _id: '280'
- _id: '475'
- _id: '179'
doi: 10.1016/j.socec.2022.101869
intvolume: ' 98'
keyword:
- General Social Sciences
- Economics and Econometrics
- Applied Psychology
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/abs/pii/S2214804322000441
page: '101869'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
- _id: '8'
name: 'SFB 901 - A4: SFB 901 - Subproject A4'
publication: Journal of Behavioral and Experimental Economics
publication_identifier:
issn:
- 2214-8043
publication_status: published
publisher: Elsevier BV
status: public
title: Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis
type: journal_article
user_id: '42447'
volume: 98
year: '2022'
...
---
_id: '30868'
abstract:
- lang: eng
text: "Algorithm configuration (AC) is concerned with the automated search of the\r\nmost
suitable parameter configuration of a parametrized algorithm. There is\r\ncurrently
a wide variety of AC problem variants and methods proposed in the\r\nliterature.
Existing reviews do not take into account all derivatives of the AC\r\nproblem,
nor do they offer a complete classification scheme. To this end, we\r\nintroduce
taxonomies to describe the AC problem and features of configuration\r\nmethods,
respectively. We review existing AC literature within the lens of our\r\ntaxonomies,
outline relevant design choices of configuration approaches,\r\ncontrast methods
and problem variants against each other, and describe the\r\nstate of AC in industry.
Finally, our review provides researchers and\r\npractitioners with a look at future
research directions in the field of AC."
author:
- first_name: Elias
full_name: Schede, Elias
last_name: Schede
- first_name: Jasmin
full_name: Brandt, Jasmin
last_name: Brandt
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Viktor
full_name: Bengs, Viktor
id: '76599'
last_name: Bengs
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
citation:
ama: Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm
Configuration. arXiv:220201651. Published online 2022.
apa: Schede, E., Brandt, J., Tornede, A., Wever, M. D., Bengs, V., Hüllermeier,
E., & Tierney, K. (2022). A Survey of Methods for Automated Algorithm Configuration.
In arXiv:2202.01651.
bibtex: '@article{Schede_Brandt_Tornede_Wever_Bengs_Hüllermeier_Tierney_2022, title={A
Survey of Methods for Automated Algorithm Configuration}, journal={arXiv:2202.01651},
author={Schede, Elias and Brandt, Jasmin and Tornede, Alexander and Wever, Marcel
Dominik and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2022}
}'
chicago: Schede, Elias, Jasmin Brandt, Alexander Tornede, Marcel Dominik Wever,
Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “A Survey of Methods for Automated
Algorithm Configuration.” ArXiv:2202.01651, 2022.
ieee: E. Schede et al., “A Survey of Methods for Automated Algorithm Configuration,”
arXiv:2202.01651. 2022.
mla: Schede, Elias, et al. “A Survey of Methods for Automated Algorithm Configuration.”
ArXiv:2202.01651, 2022.
short: E. Schede, J. Brandt, A. Tornede, M.D. Wever, V. Bengs, E. Hüllermeier, K.
Tierney, ArXiv:2202.01651 (2022).
date_created: 2022-04-12T12:00:08Z
date_updated: 2022-04-12T12:01:15Z
department:
- _id: '34'
- _id: '7'
- _id: '26'
external_id:
arxiv:
- '2202.01651'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: arXiv:2202.01651
status: public
title: A Survey of Methods for Automated Algorithm Configuration
type: preprint
user_id: '38209'
year: '2022'
...
---
_id: '30971'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Hansmeier T, Platzner M. Integrating Safety Guarantees into the Learning Classifier
System XCS. In: Applications of Evolutionary Computation, EvoApplications 2022,
Proceedings. Vol 13224. Lecture Notes in Computer Science. Springer International
Publishing; 2022:386-401. doi:10.1007/978-3-031-02462-7_25'
apa: Hansmeier, T., & Platzner, M. (2022). Integrating Safety Guarantees into
the Learning Classifier System XCS. Applications of Evolutionary Computation,
EvoApplications 2022, Proceedings, 13224, 386–401. https://doi.org/10.1007/978-3-031-02462-7_25
bibtex: '@inproceedings{Hansmeier_Platzner_2022, series={Lecture Notes in Computer
Science}, title={Integrating Safety Guarantees into the Learning Classifier System
XCS}, volume={13224}, DOI={10.1007/978-3-031-02462-7_25},
booktitle={Applications of Evolutionary Computation, EvoApplications 2022, Proceedings},
publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner,
Marco}, year={2022}, pages={386–401}, collection={Lecture Notes in Computer Science}
}'
chicago: Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into
the Learning Classifier System XCS.” In Applications of Evolutionary Computation,
EvoApplications 2022, Proceedings, 13224:386–401. Lecture Notes in Computer
Science. Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-02462-7_25.
ieee: 'T. Hansmeier and M. Platzner, “Integrating Safety Guarantees into the Learning
Classifier System XCS,” in Applications of Evolutionary Computation, EvoApplications
2022, Proceedings, Madrid, 2022, vol. 13224, pp. 386–401, doi: 10.1007/978-3-031-02462-7_25.'
mla: Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into the
Learning Classifier System XCS.” Applications of Evolutionary Computation,
EvoApplications 2022, Proceedings, vol. 13224, Springer International Publishing,
2022, pp. 386–401, doi:10.1007/978-3-031-02462-7_25.
short: 'T. Hansmeier, M. Platzner, in: Applications of Evolutionary Computation,
EvoApplications 2022, Proceedings, Springer International Publishing, 2022, pp.
386–401.'
conference:
end_date: 2022-04-22
location: Madrid
name: 25th International Conference on Applications of Evolutionary Computation,
EvoApplications 2022
start_date: 2022-04-20
date_created: 2022-04-28T09:42:33Z
date_updated: 2022-04-28T10:24:18Z
department:
- _id: '78'
doi: 10.1007/978-3-031-02462-7_25
intvolume: ' 13224'
language:
- iso: eng
page: 386-401
project:
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
- _id: '1'
name: 'SFB 901: SFB 901'
publication: Applications of Evolutionary Computation, EvoApplications 2022, Proceedings
publication_identifier:
isbn:
- '9783031024610'
- '9783031024627'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Integrating Safety Guarantees into the Learning Classifier System XCS
type: conference
user_id: '49992'
volume: 13224
year: '2022'
...
---
_id: '31947'
author:
- first_name: Henning
full_name: Hillebrandt, Henning
last_name: Hillebrandt
citation:
ama: Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen.; 2022.
apa: Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in
Unit Disk Graphen.
bibtex: '@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen
in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }'
chicago: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen
in Unit Disk Graphen, 2022.
ieee: H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit
Disk Graphen. 2022.
mla: Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in
Unit Disk Graphen. 2022.
short: H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
Graphen, 2022.
date_created: 2022-06-20T06:16:32Z
date_updated: 2022-06-20T06:16:49Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2022-06-20T06:16:09Z
date_updated: 2022-06-20T06:16:09Z
file_id: '31950'
file_name: BA_Hillebrandt.pdf
file_size: 1585281
relation: main_file
success: 1
file_date_updated: 2022-06-20T06:16:09Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '17869'
author:
- first_name: Martin
full_name: Poniatowski, Martin
id: '32441'
last_name: Poniatowski
- first_name: Hedda
full_name: Lüttenberg, Hedda
id: '60612'
last_name: Lüttenberg
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: Poniatowski M, Lüttenberg H, Beverungen D, Kundisch D. Three Layers of Abstraction—A
Conceptual Framework for Theorizing digital Multi-Sided Platforms. Information
Systems and e-Business Management, Special Issue on Platform Business Models and
Platform Strategies. 2022;2:257-283.
apa: Poniatowski, M., Lüttenberg, H., Beverungen, D., & Kundisch, D. (2022).
Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided
Platforms. Information Systems and E-Business Management, Special Issue on
Platform Business Models and Platform Strategies, 2, 257–283.
bibtex: '@article{Poniatowski_Lüttenberg_Beverungen_Kundisch_2022, title={Three
Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided
Platforms}, volume={2}, journal={Information Systems and e-Business Management,
Special Issue on Platform Business Models and Platform Strategies}, author={Poniatowski,
Martin and Lüttenberg, Hedda and Beverungen, Daniel and Kundisch, Dennis}, year={2022},
pages={257–283} }'
chicago: 'Poniatowski, Martin, Hedda Lüttenberg, Daniel Beverungen, and Dennis Kundisch.
“Three Layers of Abstraction—A Conceptual Framework for Theorizing Digital Multi-Sided
Platforms.” Information Systems and E-Business Management, Special Issue on
Platform Business Models and Platform Strategies 2 (2022): 257–83.'
ieee: M. Poniatowski, H. Lüttenberg, D. Beverungen, and D. Kundisch, “Three Layers
of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms,”
Information Systems and e-Business Management, Special Issue on Platform Business
Models and Platform Strategies, vol. 2, pp. 257–283, 2022.
mla: Poniatowski, Martin, et al. “Three Layers of Abstraction—A Conceptual Framework
for Theorizing Digital Multi-Sided Platforms.” Information Systems and E-Business
Management, Special Issue on Platform Business Models and Platform Strategies,
vol. 2, 2022, pp. 257–83.
short: M. Poniatowski, H. Lüttenberg, D. Beverungen, D. Kundisch, Information Systems
and E-Business Management, Special Issue on Platform Business Models and Platform
Strategies 2 (2022) 257–283.
date_created: 2020-08-12T14:11:25Z
date_updated: 2022-06-30T13:14:30Z
department:
- _id: '276'
intvolume: ' 2'
language:
- iso: eng
page: 257 - 283
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Information Systems and e-Business Management, Special Issue on Platform
Business Models and Platform Strategies
publication_status: published
status: public
title: Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided
Platforms
type: journal_article
user_id: '16205'
volume: 2
year: '2022'
...
---
_id: '32311'
abstract:
- lang: eng
text: Testing is one of the most frequent means of quality assurance for software.
Property-based testing aims at generating test suites for checking code against
user-defined properties. Test input generation is, however, most often independent
of the property to be checked, and is instead based on random or user-defined
data generation.In this paper, we present property-driven unit testing of functions
with numerical inputs and outputs. Alike property-based testing, it allows users
to define the properties to be tested for. Contrary to property-based testing,
it also uses the property for a targeted generation of test inputs. Our approach
is a form of learning-based testing where we first of all learn a model of a given
black-box function using standard machine learning algorithms, and in a second
step use model and property for test input generation. This allows us to test
both predefined functions as well as machine learned regression models. Our experimental
evaluation shows that our property-driven approach is more effective than standard
property-based testing techniques.
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Vitaly
full_name: Melnikov, Vitaly
id: '58747'
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of
Black-Box Functions. In: Proceedings of the 10th IEEE/ACM International Conference
on Formal Methods in Software Engineering (FormaliSE). IEEE; 2022:113-123.'
apa: Sharma, A., Melnikov, V., Hüllermeier, E., & Wehrheim, H. (2022). Property-Driven
Testing of Black-Box Functions. Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 113–123.
bibtex: '@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven
Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE},
author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim,
Heike}, year={2022}, pages={113–123} }'
chicago: Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven
Testing of Black-Box Functions.” In Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 113–23.
IEEE, 2022.
ieee: A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven
Testing of Black-Box Functions,” in Proceedings of the 10th IEEE/ACM International
Conference on Formal Methods in Software Engineering (FormaliSE), 2022, pp.
113–123.
mla: Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” Proceedings
of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering
(FormaliSE), IEEE, 2022, pp. 113–23.
short: 'A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of
the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering
(FormaliSE), IEEE, 2022, pp. 113–123.'
date_created: 2022-07-01T11:18:03Z
date_updated: 2022-07-01T11:21:36Z
department:
- _id: '7'
language:
- iso: eng
page: 113-123
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
publication: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods
in Software Engineering (FormaliSE)
publisher: IEEE
status: public
title: Property-Driven Testing of Black-Box Functions
type: conference
user_id: '477'
year: '2022'
...
---
_id: '29842'
abstract:
- lang: eng
text: To build successful software products, developers continuously have to discover
what features the users really need. This discovery can be achieved with continuous
experimentation, testing different software variants with distinct user groups,
and deploying the superior variant for all users. However, existing approaches
do not focus on explicit modeling of variants and experiments, which offers advantages
such as traceability of decisions and combinability of experiments. Therefore,
our vision is the provision of model-driven continuous experimentation, which
provides the developer with a framework for structuring the experimentation process.
For that, we introduce the overall concept, apply it to the experimentation on
component-based software architectures and point out future research questions.
In particular, we show the applicability by combining feature models for modeling
the software variants, users, and experiments (i.e., model-driven) with MAPE-K
for the adaptation (i.e., continuous experimentation) and implementing the concept
based on the component-based Angular framework.
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Engels G. Model-driven Continuous Experimentation
on Component-based Software Architectures . In: Proceedings of the 18th International
Conference on Software Architecture Companion . IEEE; 2022. doi:10.1109/ICSA-C54293.2022.00011'
apa: Gottschalk, S., Yigitbas, E., & Engels, G. (2022). Model-driven Continuous
Experimentation on Component-based Software Architectures . Proceedings of
the 18th International Conference on Software Architecture Companion . 18th
International Conference on Software Architecture , Hawaii. https://doi.org/10.1109/ICSA-C54293.2022.00011
bibtex: '@inproceedings{Gottschalk_Yigitbas_Engels_2022, title={Model-driven Continuous
Experimentation on Component-based Software Architectures }, DOI={10.1109/ICSA-C54293.2022.00011},
booktitle={Proceedings of the 18th International Conference on Software Architecture
Companion }, publisher={IEEE}, author={Gottschalk, Sebastian and Yigitbas, Enes
and Engels, Gregor}, year={2022} }'
chicago: Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Driven
Continuous Experimentation on Component-Based Software Architectures .” In Proceedings
of the 18th International Conference on Software Architecture Companion .
IEEE, 2022. https://doi.org/10.1109/ICSA-C54293.2022.00011.
ieee: 'S. Gottschalk, E. Yigitbas, and G. Engels, “Model-driven Continuous Experimentation
on Component-based Software Architectures ,” presented at the 18th International
Conference on Software Architecture , Hawaii, 2022, doi: 10.1109/ICSA-C54293.2022.00011.'
mla: Gottschalk, Sebastian, et al. “Model-Driven Continuous Experimentation on Component-Based
Software Architectures .” Proceedings of the 18th International Conference
on Software Architecture Companion , IEEE, 2022, doi:10.1109/ICSA-C54293.2022.00011.
short: 'S. Gottschalk, E. Yigitbas, G. Engels, in: Proceedings of the 18th International
Conference on Software Architecture Companion , IEEE, 2022.'
conference:
end_date: 2022-03-15
location: Hawaii
name: '18th International Conference on Software Architecture '
start_date: 2022-03-12
date_created: 2022-02-15T07:32:10Z
date_updated: 2022-07-04T12:34:53Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1109/ICSA-C54293.2022.00011
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2022-07-04T12:33:18Z
date_updated: 2022-07-04T12:34:52Z
file_id: '32322'
file_name: ICSA_CR.pdf
file_size: 183185
relation: main_file
file_date_updated: 2022-07-04T12:34:52Z
has_accepted_license: '1'
keyword:
- continuous experimentation
- model-driven
- component-based software architectures
- self-adaptation
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
publication: 'Proceedings of the 18th International Conference on Software Architecture
Companion '
publisher: IEEE
status: public
title: 'Model-driven Continuous Experimentation on Component-based Software Architectures '
type: conference
user_id: '47208'
year: '2022'
...
---
_id: '32399'
author:
- first_name: Ella
full_name: Vahle, Ella
last_name: Vahle
citation:
ama: Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching.; 2022.
apa: Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching.
bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
chicago: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching, 2022.
ieee: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
mla: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '31847'
abstract:
- lang: eng
text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios,
and several variations have been studied extensively for decades. However, to
the best of our knowledge, no research has considered the problem if the servers
are not identical and requests can express which specific servers should serve
them. Therefore, we present a new model generalizing the $k$-Server Problem by
*preferences* of the requests and proceed to study it in a uniform metric space
for deterministic online algorithms (the special case of paging).\r\n\r\nIn our
model, requests can either demand to be answered by any server (*general requests*)
or by a specific one (*specific requests*). If only general requests appear, the
instance is one of the original $k$-Server Problem, and a lower bound for the
competitive ratio of $k$ applies. If only specific requests appear, a solution
with a competitive ratio of $1$ becomes trivial since there is no freedom regarding
the servers' movements. Perhaps counter-intuitively, we show that if both kinds
of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic
online algorithms in uniform metrics and present two algorithms. The first one
has an adaptive competitive ratio dependent on the frequency of specific requests.
It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when
only general or only specific requests appear (competitive ratio of $k$ and $1$,
respectively). The second has a fixed close-to-optimal worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while
the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n
\ \r\nThe two algorithms differ in only one behavioral rule for each server
that significantly influences the competitive ratio. Each server acting according
to the rule allows approaching the worst-case lower bound, while it implies an
increased lower bound for $k$-Server instances. In other words, there is a trade-off
between performing well against instances of the $k$-Server Problem and instances
containing specific requests. We also show that no deterministic online algorithm
can be optimal for both kinds of instances simultaneously."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium
on Parallelism in Algorithms and Architectures. Association for Computing
Machinery; 2022:345-356. doi:10.1145/3490148.3538595'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the
34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.
https://doi.org/10.1145/3490148.3538595
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022,
title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595},
booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={Association for Computing Machinery}, author={Castenow,
Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer
auf der Heide, Friedhelm}, year={2022}, pages={345–356} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595.
ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th
ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356,
doi: 10.1145/3490148.3538595.'
mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–356.'
date_created: 2022-06-10T09:06:42Z
date_updated: 2022-08-02T08:07:30Z
department:
- _id: '63'
doi: 10.1145/3490148.3538595
external_id:
arxiv:
- '2205.11102'
keyword:
- K-Server Problem
- Heterogeneity
- Online Caching
language:
- iso: eng
page: 345-356
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450391467'
publisher: Association for Computing Machinery
status: public
title: The k-Server with Preferences Problem
type: conference
user_id: '39241'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
full_name: Epstein, Leah
last_name: Epstein
- first_name: Alexandra
full_name: Lassota, Alexandra
last_name: Lassota
- first_name: Asaf
full_name: Levin, Asaf
last_name: Levin
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Lars
full_name: Rohwedder, Lars
last_name: Rohwedder
citation:
ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained
Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28'
apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022).
Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B.
Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
(Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2022.28
bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs},
title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28},
booktitle={39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota,
Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink,
Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs}
}'
chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder.
“Cardinality Constrained Scheduling in Online Models.” In 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and
Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28.
ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality
Constrained Scheduling in Online Models,” in 39th International Symposium on
Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille,
France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.'
mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”
39th International Symposium on Theoretical Aspects of Computer Science, STACS
2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by
Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink,
B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Benjamin
full_name: Monmege, Benjamin
last_name: Monmege
intvolume: ' 219'
language:
- iso: eng
page: 28:1–28:15
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '34103'
abstract:
- lang: eng
text: "It is well known that different algorithms perform differently well on an\r\ninstance
of an algorithmic problem, motivating algorithm selection (AS): Given\r\nan instance
of an algorithmic problem, which is the most suitable algorithm to\r\nsolve it?
As such, the AS problem has received considerable attention resulting\r\nin various
approaches - many of which either solve a regression or ranking\r\nproblem under
the hood. Although both of these formulations yield very natural\r\nways to tackle
AS, they have considerable weaknesses. On the one hand,\r\ncorrectly predicting
the performance of an algorithm on an instance is a\r\nsufficient, but not a necessary
condition to produce a correct ranking over\r\nalgorithms and in particular ranking
the best algorithm first. On the other\r\nhand, classical ranking approaches often
do not account for concrete\r\nperformance values available in the training data,
but only leverage rankings\r\ncomposed from such data. We propose HARRIS- Hybrid
rAnking and RegRessIon\r\nforeSts - a new algorithm selector leveraging special
forests, combining the\r\nstrengths of both approaches while alleviating their
weaknesses. HARRIS'\r\ndecisions are based on a forest model, whose trees are
created based on splits\r\noptimized on a hybrid ranking and regression loss function.
As our preliminary\r\nexperimental study on ASLib shows, HARRIS improves over
standard algorithm\r\nselection approaches on some scenarios showing that combining
ranking and\r\nregression in trees is indeed promising for AS."
author:
- first_name: Lukass
full_name: Fehring, Lukass
last_name: Fehring
- first_name: Jonas Manuel
full_name: Hanselle, Jonas Manuel
id: '43980'
last_name: Hanselle
orcid: 0000-0002-1231-4985
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
citation:
ama: 'Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests
for Algorithm Selection. In: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS
2022. ; 2022.'
apa: 'Fehring, L., Hanselle, J. M., & Tornede, A. (2022). HARRIS: Hybrid Ranking
and Regression Forests for Algorithm Selection. Workshop on Meta-Learning (MetaLearn
2022) @ NeurIPS 2022. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS
2022, Baltimore.'
bibtex: '@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking
and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning
(MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas
Manuel and Tornede, Alexander}, year={2022} }'
chicago: 'Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS:
Hybrid Ranking and Regression Forests for Algorithm Selection.” In Workshop
on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.'
ieee: 'L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression
Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn
2022) @ NeurIPS 2022, Baltimore, 2022.'
mla: 'Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for
Algorithm Selection.” Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS
2022, 2022.'
short: 'L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn
2022) @ NeurIPS 2022, 2022.'
conference:
location: Baltimore
name: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022
date_created: 2022-11-17T12:57:40Z
date_updated: 2022-11-17T13:00:53Z
external_id:
arxiv:
- '2210.17341'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022
status: public
title: 'HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection'
type: conference
user_id: '38209'
year: '2022'
...