---
_id: '5959'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Automated Bilateral Multiple-Issue Negotiation with No Information
about Opponent. Universität Paderborn; 2018.
apa: N, N. (2018). Automated Bilateral Multiple-issue negotiation with no information
about opponent. Universität Paderborn.
bibtex: '@book{N_2018, title={Automated Bilateral Multiple-issue negotiation with
no information about opponent}, publisher={Universität Paderborn}, author={N,
N}, year={2018} }'
chicago: N, N. Automated Bilateral Multiple-Issue Negotiation with No Information
about Opponent. Universität Paderborn, 2018.
ieee: N. N, Automated Bilateral Multiple-issue negotiation with no information
about opponent. Universität Paderborn, 2018.
mla: N, N. Automated Bilateral Multiple-Issue Negotiation with No Information
about Opponent. Universität Paderborn, 2018.
short: N. N, Automated Bilateral Multiple-Issue Negotiation with No Information
about Opponent, Universität Paderborn, 2018.
date_created: 2018-11-28T11:50:46Z
date_updated: 2022-11-30T14:18:11Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Automated Bilateral Multiple-issue negotiation with no information about opponent
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5964'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie.
Universität Paderborn; 2018.
apa: N, N. (2018). Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie.
Universität Paderborn.
bibtex: '@book{N_2018, title={Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie},
publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie.
Universität Paderborn, 2018.
ieee: N. N, Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie.
Universität Paderborn, 2018.
mla: N, N. Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie.
Universität Paderborn, 2018.
short: N. N, Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie, Universität
Paderborn, 2018.
date_created: 2018-11-28T12:02:55Z
date_updated: 2022-11-30T14:19:08Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Spieltheoretischer Verhandlungsansatz in der Sozialwahltheorie
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5960'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Anreize in Bewertungssysteme. Universität Paderborn; 2018.
apa: N, N. (2018). Anreize in Bewertungssysteme. Universität Paderborn.
bibtex: '@book{N_2018, title={Anreize in Bewertungssysteme}, publisher={Universität
Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Anreize in Bewertungssysteme. Universität Paderborn, 2018.
ieee: N. N, Anreize in Bewertungssysteme. Universität Paderborn, 2018.
mla: N, N. Anreize in Bewertungssysteme. Universität Paderborn, 2018.
short: N. N, Anreize in Bewertungssysteme, Universität Paderborn, 2018.
date_created: 2018-11-28T11:53:06Z
date_updated: 2022-11-30T14:18:31Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Anreize in Bewertungssysteme
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5970'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: 'N N. Facility Location Selection: How to Select the Optimal Facility Location ?
- The Analytical Hierarchy Process. Universität Paderborn; 2018.'
apa: 'N, N. (2018). Facility Location Selection: How to select the optimal facility
location ? - The Analytical Hierarchy Process. Universität Paderborn.'
bibtex: '@book{N_2018, title={Facility Location Selection: How to select the optimal
facility location ? - The Analytical Hierarchy Process}, publisher={Universität
Paderborn}, author={N, N}, year={2018} }'
chicago: 'N, N. Facility Location Selection: How to Select the Optimal Facility
Location ? - The Analytical Hierarchy Process. Universität Paderborn, 2018.'
ieee: 'N. N, Facility Location Selection: How to select the optimal facility
location ? - The Analytical Hierarchy Process. Universität Paderborn, 2018.'
mla: 'N, N. Facility Location Selection: How to Select the Optimal Facility Location ?
- The Analytical Hierarchy Process. Universität Paderborn, 2018.'
short: 'N. N, Facility Location Selection: How to Select the Optimal Facility Location ?
- The Analytical Hierarchy Process, Universität Paderborn, 2018.'
date_created: 2018-11-28T12:11:37Z
date_updated: 2022-11-30T14:20:59Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: 'Facility Location Selection: How to select the optimal facility location ?
- The Analytical Hierarchy Process'
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5968'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?
Universität Paderborn; 2018.
apa: N, N. (2018). Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?
Universität Paderborn.
bibtex: '@book{N_2018, title={Wie werden elektronische Verhandlungen durch Präferenzen
beeinflusst?}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?
Universität Paderborn, 2018.
ieee: N. N, Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?
Universität Paderborn, 2018.
mla: N, N. Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?
Universität Paderborn, 2018.
short: N. N, Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?,
Universität Paderborn, 2018.
date_created: 2018-11-28T12:08:43Z
date_updated: 2022-11-30T14:20:16Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5966'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr.
Universität Paderborn; 2018.
apa: N, N. (2018). Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr.
Universität Paderborn.
bibtex: '@book{N_2018, title={Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr},
publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr.
Universität Paderborn, 2018.
ieee: N. N, Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr.
Universität Paderborn, 2018.
mla: N, N. Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr.
Universität Paderborn, 2018.
short: N. N, Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr, Universität
Paderborn, 2018.
date_created: 2018-11-28T12:05:53Z
date_updated: 2022-11-30T14:19:43Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5969'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Diskriminierung in sozialen Netzwerken durch Versionierung. Universität
Paderborn; 2018.
apa: N, N. (2018). Diskriminierung in sozialen Netzwerken durch Versionierung.
Universität Paderborn.
bibtex: '@book{N_2018, title={Diskriminierung in sozialen Netzwerken durch Versionierung},
publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Diskriminierung in sozialen Netzwerken durch Versionierung.
Universität Paderborn, 2018.
ieee: N. N, Diskriminierung in sozialen Netzwerken durch Versionierung. Universität
Paderborn, 2018.
mla: N, N. Diskriminierung in sozialen Netzwerken durch Versionierung. Universität
Paderborn, 2018.
short: N. N, Diskriminierung in sozialen Netzwerken durch Versionierung, Universität
Paderborn, 2018.
date_created: 2018-11-28T12:10:27Z
date_updated: 2022-11-30T14:20:37Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Diskriminierung in sozialen Netzwerken durch Versionierung
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5965'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. School Choice in Theory. Universität Paderborn; 2018.
apa: N, N. (2018). School Choice in Theory. Universität Paderborn.
bibtex: '@book{N_2018, title={School Choice in Theory}, publisher={Universität Paderborn},
author={N, N}, year={2018} }'
chicago: N, N. School Choice in Theory. Universität Paderborn, 2018.
ieee: N. N, School Choice in Theory. Universität Paderborn, 2018.
mla: N, N. School Choice in Theory. Universität Paderborn, 2018.
short: N. N, School Choice in Theory, Universität Paderborn, 2018.
date_created: 2018-11-28T12:04:07Z
date_updated: 2022-11-30T14:19:24Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: School Choice in Theory
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9924'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada.
Universität Paderborn; 2018.
apa: N, N. (2018). Punktesystem für Zuwanderung in Deutschland nach Vorbild von
Kanada. Universität Paderborn.
bibtex: '@book{N_2018, title={Punktesystem für Zuwanderung in Deutschland nach Vorbild
von Kanada}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada.
Universität Paderborn, 2018.
ieee: N. N, Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada.
Universität Paderborn, 2018.
mla: N, N. Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada.
Universität Paderborn, 2018.
short: N. N, Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada,
Universität Paderborn, 2018.
date_created: 2019-05-23T08:41:16Z
date_updated: 2022-11-30T14:23:32Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9926'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Agenda Setting in Jury Decision by Sequential Majority Voting.
Universität Paderborn; 2018.
apa: N, N. (2018). Agenda setting in jury decision by sequential majority voting.
Universität Paderborn.
bibtex: '@book{N_2018, title={Agenda setting in jury decision by sequential majority
voting}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Agenda Setting in Jury Decision by Sequential Majority Voting.
Universität Paderborn, 2018.
ieee: N. N, Agenda setting in jury decision by sequential majority voting.
Universität Paderborn, 2018.
mla: N, N. Agenda Setting in Jury Decision by Sequential Majority Voting.
Universität Paderborn, 2018.
short: N. N, Agenda Setting in Jury Decision by Sequential Majority Voting, Universität
Paderborn, 2018.
date_created: 2019-05-23T08:49:59Z
date_updated: 2022-11-30T14:23:47Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Agenda setting in jury decision by sequential majority voting
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9925'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Verbindung Terrorismusforschung und Spieltheorie. Universität Paderborn;
2018.
apa: N, N. (2018). Verbindung Terrorismusforschung und Spieltheorie. Universität
Paderborn.
bibtex: '@book{N_2018, title={Verbindung Terrorismusforschung und Spieltheorie},
publisher={Universität Paderborn}, author={N, N}, year={2018} }'
chicago: N, N. Verbindung Terrorismusforschung und Spieltheorie. Universität
Paderborn, 2018.
ieee: N. N, Verbindung Terrorismusforschung und Spieltheorie. Universität
Paderborn, 2018.
mla: N, N. Verbindung Terrorismusforschung und Spieltheorie. Universität
Paderborn, 2018.
short: N. N, Verbindung Terrorismusforschung und Spieltheorie, Universität Paderborn,
2018.
date_created: 2019-05-23T08:47:48Z
date_updated: 2022-11-30T14:24:00Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Verbindung Terrorismusforschung und Spieltheorie
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '1209'
abstract:
- lang: eng
text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
robots on a grid, in which all robots of the swarm are supposed to gather at a
previously undefined point. Special attention is paid to the strong limitation
of robot capabilities. These include in particular the lack of global control,
a global compass, global visibility and (global) communication skills. Furthermore,
all robots are identical. The robots are given only local abilities. This includes
a constant range of vision. The robots all work completely synchronously. In this
work we present and analyze three different Gathering strategies in different
robot models. We formally prove correctness and total running time: Chapter 4
focuses on minimizing the available robot capabilities. The underlying strategy
completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
aim is to optimize the total running time under using only local robot capabilities:
We additionally allow a constant-sized memory and a constant number of locally
visible statuses (lights, flags). For the strategies of both chapters we show
an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
additionally restrict connectivity and vision to an initially given chain connectivity
in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
citation:
ama: Jung D. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-271
apa: Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-271
bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
DOI={10.17619/UNIPB/1-271},
publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
chicago: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
ieee: D. Jung, Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018.
mla: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018, doi:10.17619/UNIPB/1-271.
short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2024-07-12T12:05:00Z
department:
- _id: '63'
- _id: '26'
doi: 10.17619/UNIPB/1-271
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
grant_number: '160364472'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '1112'
year: '2018'
...
---
_id: '37703'
author:
- first_name: Karen Elisabeth
full_name: Olemedo Aragon, Karen Elisabeth
last_name: Olemedo Aragon
citation:
ama: Olemedo Aragon KE. Cartel Cases in the EU Financial Derivatives Market -
The Role of Facilitating Factors.; 2018.
apa: Olemedo Aragon, K. E. (2018). Cartel Cases in the EU Financial Derivatives
Market - The Role of Facilitating Factors.
bibtex: '@book{Olemedo Aragon_2018, title={Cartel Cases in the EU Financial Derivatives
Market - The Role of Facilitating Factors}, author={Olemedo Aragon, Karen Elisabeth},
year={2018} }'
chicago: Olemedo Aragon, Karen Elisabeth. Cartel Cases in the EU Financial Derivatives
Market - The Role of Facilitating Factors, 2018.
ieee: K. E. Olemedo Aragon, Cartel Cases in the EU Financial Derivatives Market
- The Role of Facilitating Factors. 2018.
mla: Olemedo Aragon, Karen Elisabeth. Cartel Cases in the EU Financial Derivatives
Market - The Role of Facilitating Factors. 2018.
short: K.E. Olemedo Aragon, Cartel Cases in the EU Financial Derivatives Market
- The Role of Facilitating Factors, 2018.
date_created: 2023-01-20T10:42:46Z
date_updated: 2023-01-20T10:42:56Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Cartel Cases in the EU Financial Derivatives Market - The Role of Facilitating
Factors
type: mastersthesis
user_id: '37953'
year: '2018'
...
---
_id: '2851'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: 'Markarian C. Leasing with Uncertainty. In: International Conference on
Operations Research (OR). ; 2017. doi:10.1007/978-3-319-89920-6_57'
apa: Markarian, C. (2017). Leasing with Uncertainty. In International Conference
on Operations Research (OR). Berlin. https://doi.org/10.1007/978-3-319-89920-6_57
bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={10.1007/978-3-319-89920-6_57},
booktitle={International Conference on Operations Research (OR)}, author={Markarian,
Christine}, year={2017} }'
chicago: Markarian, Christine. “Leasing with Uncertainty.” In International Conference
on Operations Research (OR), 2017. https://doi.org/10.1007/978-3-319-89920-6_57.
ieee: C. Markarian, “Leasing with Uncertainty,” in International Conference on
Operations Research (OR), Berlin, 2017.
mla: Markarian, Christine. “Leasing with Uncertainty.” International Conference
on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.
short: 'C. Markarian, in: International Conference on Operations Research (OR),
2017.'
conference:
end_date: Sept 8, 2017
location: Berlin
start_date: Sept 6, 2017
date_created: 2018-05-24T08:44:43Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89920-6_57
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:16:30Z
date_updated: 2018-11-13T13:16:30Z
file_id: '5537'
file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf
file_size: 257103
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:16:30Z
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: International Conference on Operations Research (OR)
status: public
title: Leasing with Uncertainty
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '2696'
author:
- first_name: Steffen
full_name: Zimmermann, Steffen
last_name: Zimmermann
- first_name: Philipp
full_name: Herrmann, Philipp
last_name: Herrmann
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Barrie
full_name: Nault, Barrie
last_name: Nault
citation:
ama: 'Zimmermann S, Herrmann P, Kundisch D, Nault B. Decomposing the Variance of
Online Consumer Ratings and the Impact on Price and Demand. In: Workshop Theory
in Economics of Information Systems (TEIS). ; 2017.'
apa: Zimmermann, S., Herrmann, P., Kundisch, D., & Nault, B. (2017). Decomposing
the Variance of Online Consumer Ratings and the Impact on Price and Demand. In
Workshop Theory in Economics of Information Systems (TEIS). Sonoma, USA.
bibtex: '@inproceedings{Zimmermann_Herrmann_Kundisch_Nault_2017, title={Decomposing
the Variance of Online Consumer Ratings and the Impact on Price and Demand}, booktitle={Workshop
Theory in Economics of Information Systems (TEIS)}, author={Zimmermann, Steffen
and Herrmann, Philipp and Kundisch, Dennis and Nault, Barrie}, year={2017} }'
chicago: Zimmermann, Steffen, Philipp Herrmann, Dennis Kundisch, and Barrie Nault.
“Decomposing the Variance of Online Consumer Ratings and the Impact on Price and
Demand.” In Workshop Theory in Economics of Information Systems (TEIS),
2017.
ieee: S. Zimmermann, P. Herrmann, D. Kundisch, and B. Nault, “Decomposing the Variance
of Online Consumer Ratings and the Impact on Price and Demand,” in Workshop
Theory in Economics of Information Systems (TEIS), Sonoma, USA, 2017.
mla: Zimmermann, Steffen, et al. “Decomposing the Variance of Online Consumer Ratings
and the Impact on Price and Demand.” Workshop Theory in Economics of Information
Systems (TEIS), 2017.
short: 'S. Zimmermann, P. Herrmann, D. Kundisch, B. Nault, in: Workshop Theory in
Economics of Information Systems (TEIS), 2017.'
conference:
location: Sonoma, USA
name: Workshop Theory in Economics of Information Systems (TEIS)
date_created: 2018-05-08T12:50:23Z
date_updated: 2022-01-06T06:57:31Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2019-01-29T14:39:27Z
date_updated: 2019-01-29T14:39:27Z
file_id: '7243'
file_name: Rating Variance_CIST_Abstract.pdf
file_size: 83968
relation: main_file
success: 1
file_date_updated: 2019-01-29T14:39:27Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
publication: Workshop Theory in Economics of Information Systems (TEIS)
status: public
title: Decomposing the Variance of Online Consumer Ratings and the Impact on Price
and Demand
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '3307'
author:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
citation:
ama: Frick B, Kaimann D. The impact of customer reviews and advertisement efforts
on the performance of experience goods in electronic markets. Applied Economics
Letters. 2017;24(17):1237-1240. doi:10.1080/13504851.2016.1270399
apa: Frick, B., & Kaimann, D. (2017). The impact of customer reviews and advertisement
efforts on the performance of experience goods in electronic markets. Applied
Economics Letters, 24(17), 1237–1240. https://doi.org/10.1080/13504851.2016.1270399
bibtex: '@article{Frick_Kaimann_2017, title={The impact of customer reviews and
advertisement efforts on the performance of experience goods in electronic markets},
volume={24}, DOI={10.1080/13504851.2016.1270399},
number={17}, journal={Applied Economics Letters}, publisher={Taylor & Francis},
author={Frick, Bernd and Kaimann, Daniel}, year={2017}, pages={1237–1240} }'
chicago: 'Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and
Advertisement Efforts on the Performance of Experience Goods in Electronic Markets.”
Applied Economics Letters 24, no. 17 (2017): 1237–40. https://doi.org/10.1080/13504851.2016.1270399.'
ieee: B. Frick and D. Kaimann, “The impact of customer reviews and advertisement
efforts on the performance of experience goods in electronic markets,” Applied
Economics Letters, vol. 24, no. 17, pp. 1237–1240, 2017.
mla: Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and Advertisement
Efforts on the Performance of Experience Goods in Electronic Markets.” Applied
Economics Letters, vol. 24, no. 17, Taylor & Francis, 2017, pp. 1237–40,
doi:10.1080/13504851.2016.1270399.
short: B. Frick, D. Kaimann, Applied Economics Letters 24 (2017) 1237–1240.
date_created: 2018-06-22T11:25:35Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '183'
doi: 10.1080/13504851.2016.1270399
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:37:41Z
date_updated: 2018-11-02T15:37:41Z
file_id: '5308'
file_name: FrickKaimann.pdf
file_size: 700352
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:37:41Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '17'
language:
- iso: eng
page: 1237-1240
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Applied Economics Letters
publisher: Taylor & Francis
status: public
title: The impact of customer reviews and advertisement efforts on the performance
of experience goods in electronic markets
type: journal_article
user_id: '477'
volume: 24
year: '2017'
...
---
_id: '3312'
author:
- first_name: Mana
full_name: Zarindast, Mana
id: '18949'
last_name: Zarindast
citation:
ama: 'Zarindast M. The Role of EWOM in the Movie Industry: The Effect of Online
User Ratings on Box Office Sales . Universität Paderborn; 2017.'
apa: 'Zarindast, M. (2017). The role of eWOM in the movie industry: The effect
of online user ratings on box office sales . Universität Paderborn.'
bibtex: '@book{Zarindast_2017, title={The role of eWOM in the movie industry: The
effect of online user ratings on box office sales }, publisher={Universität Paderborn},
author={Zarindast, Mana}, year={2017} }'
chicago: 'Zarindast, Mana. The Role of EWOM in the Movie Industry: The Effect
of Online User Ratings on Box Office Sales . Universität Paderborn, 2017.'
ieee: 'M. Zarindast, The role of eWOM in the movie industry: The effect of online
user ratings on box office sales . Universität Paderborn, 2017.'
mla: 'Zarindast, Mana. The Role of EWOM in the Movie Industry: The Effect of
Online User Ratings on Box Office Sales . Universität Paderborn, 2017.'
short: 'M. Zarindast, The Role of EWOM in the Movie Industry: The Effect of Online
User Ratings on Box Office Sales , Universität Paderborn, 2017.'
date_created: 2018-06-22T12:09:27Z
date_updated: 2022-01-06T06:59:10Z
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
title: 'The role of eWOM in the movie industry: The effect of online user ratings
on box office sales '
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '112'
abstract:
- lang: eng
text: We study a model of selfish resource allocation that seeks to incorporate
dependencies among resources as they exist in in modern networked environments.
Our model is inspired by utility functions with constant elasticity of substitution
(CES) which is a well-studied model in economics. We consider congestion games
with different aggregation functions. In particular, we study $L_p$ norms and
analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally,
we give an almost tight characterization based on monotonicity properties to describe
the set of aggregation functions that guarantee the existence of pure Nash equilibria.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities.
In: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19'
apa: Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities.
In Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19
bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion
Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19},
booktitle={Proceedings of the 10th International Conference on Algorithms and
Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik,
Alexander}, year={2017}, pages={222--233}, collection={LNCS} }'
chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Complementarities.” In Proceedings of the 10th International Conference
on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,”
in Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC), 2017, pp. 222--233.
mla: Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings
of the 10th International Conference on Algorithms and Complexity (CIAC),
2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International
Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:58Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-57586-5_19
external_id:
arxiv:
- '1701.07304'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:37Z
date_updated: 2018-03-21T13:05:37Z
file_id: '1566'
file_name: 112-FeldottoLederSkopalik2017.pdf
file_size: 264089
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:37Z
has_accepted_license: '1'
page: 222--233
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC)
series_title: LNCS
status: public
title: Congestion Games with Complementarities
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '113'
abstract:
- lang: eng
text: We study the computation of approximate pure Nash equilibria in Shapley value
(SV) weighted congestion games, introduced in [19]. This class of games considers
weighted congestion games in which Shapley values are used as an alternative (to
proportional shares) for distributing the total cost of each resource among its
users. We focus on the interesting subclass of such games with polynomial resource
cost functions and present an algorithm that computes approximate pure Nash equilibria
with a polynomial number of strategy updates. Since computing a single strategy
update is hard, we apply sampling techniques which allow us to achieve polynomial
running time. The algorithm builds on the algorithmic ideas of [7], however, to
the best of our knowledge, this is the first algorithmic result on computation
of approximate equilibria using other than proportional shares as player costs
in this setting. We present a novel relation that approximates the Shapley value
of a player by her proportional share and vice versa. As side results, we upper
bound the approximate price of anarchy of such games and significantly improve
the best known factor for computing approximate pure Nash equilibria in weighted
congestion games of [7].
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Grammateia
full_name: Kotsialou, Grammateia
last_name: Kotsialou
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure
Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings
of the 13th International Conference on Web and Internet Economics (WINE).
; 2017. doi:10.1007/978-3-319-71924-5_14'
apa: Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In
Proceedings of the 13th International Conference on Web and Internet Economics
(WINE). https://doi.org/10.1007/978-3-319-71924-5_14
bibtex: '@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games},
DOI={10.1007/978-3-319-71924-5_14},
booktitle={Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou,
Grammateia and Skopalik, Alexander}, year={2017} }'
chicago: Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander
Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted
Congestion Games.” In Proceedings of the 13th International Conference on Web
and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
ieee: M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate
Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings
of the 13th International Conference on Web and Internet Economics (WINE),
2017.
mla: Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley
Value Weighted Congestion Games.” Proceedings of the 13th International Conference
on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
short: 'M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the
13th International Conference on Web and Internet Economics (WINE), 2017.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:59Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71924-5_14
external_id:
arxiv:
- '1710.01634'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:01:32Z
date_updated: 2018-10-31T17:01:32Z
file_id: '5231'
file_name: Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf
file_size: 279055
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:01:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)
status: public
title: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion
Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '115'
abstract:
- lang: eng
text: 'Whenever customers have to decide between different instances of the same
product, they are interested in buying the best product. In contrast, companies
are interested in reducing the construction effort (and usually as a consequence
thereof, the quality) to gain profit. The described setting is widely known as
opposed preferences in quality of the product and also applies to the context
of service-oriented computing. In general, service-oriented computing emphasizes
the construction of large software systems out of existing services, where services
are small and self-contained pieces of software that adhere to a specified interface.
Several implementations of the same interface are considered as several instances
of the same service. Thereby, customers are interested in buying the best service
implementation for their service composition wrt. to metrics, such as costs, energy,
memory consumption, or execution time. One way to ensure the service quality is
to employ certificates, which can come in different kinds: Technical certificates
proving correctness can be automatically constructed by the service provider and
again be automatically checked by the user. Digital certificates allow proof of
the integrity of a product. Other certificates might be rolled out if service
providers follow a good software construction principle, which is checked in annual
audits. Whereas all of these certificates are handled differently in service markets,
what they have in common is that they influence the buying decisions of customers.
In this paper, we review state-of-the-art developments in certification with respect
to service-oriented computing. We not only discuss how certificates are constructed
and handled in service-oriented computing but also review the effects of certificates
on the market from an economic perspective.'
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Dirk
full_name: van Straaten, Dirk
id: '10311'
last_name: van Straaten
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
citation:
ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for
Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The
Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2017:7-12.'
apa: Jakobs, M.-C., Krämer, J., van Straaten, D., & Lettmann, T. (2017). Certification
Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl
(Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION) (pp. 7–12).
bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification
Matters for Service Markets}, booktitle={The Ninth International Conferences on
Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine
and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo
De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12}
}'
chicago: Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann.
“Certification Matters for Service Markets.” In The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz
Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.
ieee: M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters
for Service Markets,” in The Ninth International Conferences on Advanced Service
Computing (SERVICE COMPUTATION), 2017, pp. 7–12.
mla: Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.”
The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus
Uhl, 2017, pp. 7–12.
short: 'M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo
De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.'
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:02Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
- _id: '179'
editor:
- first_name: Thomas Prinz
full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz
last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:04:12Z
date_updated: 2018-03-21T13:04:12Z
file_id: '1564'
file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf
file_size: 133531
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:04:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 7-12
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
publication: The Ninth International Conferences on Advanced Service Computing (SERVICE
COMPUTATION)
status: public
title: Certification Matters for Service Markets
type: conference
user_id: '477'
year: '2017'
...