---
_id: '185'
author:
- first_name: Christopher
full_name: Schmidt, Christopher
last_name: Schmidt
citation:
ama: Schmidt C. Kundenbewertungen im Online-Handel – Alles Betrug? Universität
Paderborn; 2016.
apa: Schmidt, C. (2016). Kundenbewertungen im Online-Handel – Alles Betrug?
Universität Paderborn.
bibtex: '@book{Schmidt_2016, title={Kundenbewertungen im Online-Handel – Alles Betrug?},
publisher={Universität Paderborn}, author={Schmidt, Christopher}, year={2016}
}'
chicago: Schmidt, Christopher. Kundenbewertungen im Online-Handel – Alles Betrug?
Universität Paderborn, 2016.
ieee: C. Schmidt, Kundenbewertungen im Online-Handel – Alles Betrug? Universität
Paderborn, 2016.
mla: Schmidt, Christopher. Kundenbewertungen im Online-Handel – Alles Betrug?
Universität Paderborn, 2016.
short: C. Schmidt, Kundenbewertungen im Online-Handel – Alles Betrug?, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:36Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Kundenbewertungen im Online-Handel – Alles Betrug?
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '2271'
author:
- first_name: Aref
full_name: Hesso, Aref
last_name: Hesso
citation:
ama: 'Hesso A. Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung
und die Auswirkung der Reputation auf Kunden und Unternehmen. Universität
Paderborn; 2016.'
apa: 'Hesso, A. (2016). Die Rolle der Reputation: Die Entstehung, der Aufbau,
die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen.
Universität Paderborn.'
bibtex: '@book{Hesso_2016, title={Die Rolle der Reputation: Die Entstehung, der
Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen},
publisher={Universität Paderborn}, author={Hesso, Aref}, year={2016} }'
chicago: 'Hesso, Aref. Die Rolle der Reputation: Die Entstehung, der Aufbau,
die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen.
Universität Paderborn, 2016.'
ieee: 'A. Hesso, Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung
und die Auswirkung der Reputation auf Kunden und Unternehmen. Universität
Paderborn, 2016.'
mla: 'Hesso, Aref. Die Rolle der Reputation: Die Entstehung, der Aufbau, die
Messung und die Auswirkung der Reputation auf Kunden und Unternehmen. Universität
Paderborn, 2016.'
short: 'A. Hesso, Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung
und die Auswirkung der Reputation auf Kunden und Unternehmen, Universität Paderborn,
2016.'
date_created: 2018-04-10T09:56:14Z
date_updated: 2022-01-06T06:55:39Z
department:
- _id: '19'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: 'Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die
Auswirkung der Reputation auf Kunden und Unternehmen'
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '220'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
citation:
ama: Keller M. Application Deployment at Distributed Clouds. Universität
Paderborn; 2016.
apa: Keller, M. (2016). Application Deployment at Distributed Clouds. Universität
Paderborn.
bibtex: '@book{Keller_2016, title={Application Deployment at Distributed Clouds},
publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }'
chicago: Keller, Matthias. Application Deployment at Distributed Clouds.
Universität Paderborn, 2016.
ieee: M. Keller, Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
mla: Keller, Matthias. Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
short: M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:22Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:37:11Z
date_updated: 2018-03-21T10:37:11Z
file_id: '1513'
file_name: 220-Keller_PhD-Theses_01.pdf
file_size: 7467820
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:37:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Application Deployment at Distributed Clouds
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '5762'
abstract:
- lang: eng
text: "This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm
that is closely related to the over thirty-year-old idea of splay trees and evaluate
its adaption performance in the distributed scenario if different communication
patterns are provided. \r\nTo do so, the process of self-adjustment is modeled
similarly to a basic network creation game in which the nodes want to communicate
with only a certain subset of all nodes. \r\nWe show that, in general, the game
(i.e., the process of local adjustments) does not converge, and that convergence
is related to certain structures of the communication interests, which we call
conflicts. \r\nWe classify conflicts and show that for two communication scenarios
in which convergence is guaranteed, the self-adjusting tree performs well. \r\nFurthermore,
we investigate the different classes of conflicts separately and show that, for
a certain class of conflicts, the performance of the tree network is asymptotically
as good as the performance for converging instances.\r\nHowever, for the other
conflict classes, a distributed self-adjusting binary search tree adapts poorly."
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree. Journal of Graph Algorithms and Applications. 2016;20(1):79-100.
doi:10.7155/jgaa.00385
apa: Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree. Journal of Graph Algorithms and Applications,
20(1), 79–100. https://doi.org/10.7155/jgaa.00385
bibtex: '@article{Strothmann_2016, title={The Impact of Communication Patterns on
Distributed Self-Adjusting Binary Search Tree}, volume={20}, DOI={10.7155/jgaa.00385},
number={1}, journal={Journal of Graph Algorithms and Applications}, publisher={Journal
of Graph Algorithms and Applications}, author={Strothmann, Thim Frederik}, year={2016},
pages={79–100} }'
chicago: 'Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications
20, no. 1 (2016): 79–100. https://doi.org/10.7155/jgaa.00385.'
ieee: T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree,” Journal of Graph Algorithms and Applications, vol.
20, no. 1, pp. 79–100, 2016.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications,
vol. 20, no. 1, Journal of Graph Algorithms and Applications, 2016, pp. 79–100,
doi:10.7155/jgaa.00385.
short: T.F. Strothmann, Journal of Graph Algorithms and Applications 20 (2016) 79–100.
date_created: 2018-11-19T15:33:50Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.7155/jgaa.00385
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2018-11-27T11:58:08Z
date_updated: 2018-11-27T11:58:08Z
file_id: '5912'
file_name: Strothmann2016.20.1.pdf
file_size: 2324066
relation: main_file
success: 1
file_date_updated: 2018-11-27T11:58:08Z
has_accepted_license: '1'
intvolume: ' 20'
issue: '1'
language:
- iso: eng
page: 79-100
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Journal of Graph Algorithms and Applications
quality_controlled: '1'
status: public
title: The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search
Tree
type: journal_article
user_id: '477'
volume: 20
year: '2016'
...
---
_id: '4374'
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. How do different Sources of
the Variance of Online Consumer Ratings matter? In: Workshop on IS Design and
Economic Behavior (ISDEB). ; 2016.'
apa: Zimmermann, S., Herrmann, P., Kundisch, D., & Nault, B. (2016). How do
different Sources of the Variance of Online Consumer Ratings matter? In Workshop
on IS Design and Economic Behavior (ISDEB). Ilmenau, Germany.
bibtex: '@inproceedings{Zimmermann_Herrmann_Kundisch_Nault_2016, title={How do different
Sources of the Variance of Online Consumer Ratings matter?}, booktitle={Workshop
on IS Design and Economic Behavior (ISDEB)}, author={Zimmermann, Steffen and Herrmann,
Philipp and Kundisch, Dennis and Nault, Barrie}, year={2016} }'
chicago: Zimmermann, Steffen, Philipp Herrmann, Dennis Kundisch, and Barrie Nault.
“How Do Different Sources of the Variance of Online Consumer Ratings Matter?”
In Workshop on IS Design and Economic Behavior (ISDEB), 2016.
ieee: S. Zimmermann, P. Herrmann, D. Kundisch, and B. Nault, “How do different Sources
of the Variance of Online Consumer Ratings matter?,” in Workshop on IS Design
and Economic Behavior (ISDEB), Ilmenau, Germany, 2016.
mla: Zimmermann, Steffen, et al. “How Do Different Sources of the Variance of Online
Consumer Ratings Matter?” Workshop on IS Design and Economic Behavior (ISDEB),
2016.
short: 'S. Zimmermann, P. Herrmann, D. Kundisch, B. Nault, in: Workshop on IS Design
and Economic Behavior (ISDEB), 2016.'
conference:
location: Ilmenau, Germany
name: Workshop on IS Design and Economic Behavior (ISDEB)
date_created: 2018-09-10T13:02:44Z
date_updated: 2022-01-06T07:00:59Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2019-01-29T14:38:25Z
date_updated: 2019-01-29T14:38:25Z
file_id: '7242'
file_name: Rating Variance_CIST_Abstract.pdf
file_size: 83968
relation: main_file
success: 1
file_date_updated: 2019-01-29T14:38:25Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Workshop on IS Design and Economic Behavior (ISDEB)
quality_controlled: '1'
status: public
title: How do different Sources of the Variance of Online Consumer Ratings matter?
type: conference_abstract
user_id: '477'
year: '2016'
...
---
_id: '5407'
author:
- first_name: Jörn
full_name: Koepe, Jörn
last_name: Koepe
citation:
ama: Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.
apa: Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.
bibtex: '@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität
Paderborn}, author={Koepe, Jörn}, year={2016} }'
chicago: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn,
2016.
ieee: J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.
mla: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.
short: J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.
date_created: 2018-11-07T09:45:57Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
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
title: Price-Based Allocation Games
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '688'
author:
- first_name: Damian
full_name: Kutzias, Damian
last_name: Kutzias
citation:
ama: Kutzias D. Friendship Processes in Network Creation Games. Universität
Paderborn; 2016.
apa: Kutzias, D. (2016). Friendship Processes in Network Creation Games.
Universität Paderborn.
bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games},
publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }'
chicago: Kutzias, Damian. Friendship Processes in Network Creation Games.
Universität Paderborn, 2016.
ieee: D. Kutzias, Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
mla: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn,
2016.
date_created: 2017-11-14T06:50:35Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Friendship Processes in Network Creation Games
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '689'
author:
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
citation:
ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn; 2016.
apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster
Management Support. Universität Paderborn.
bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for
Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer,
Johannes Sebastian}, year={2016} }'
chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks
for Disaster Management Support. Universität Paderborn, 2016.
ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn, 2016.
mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for
Disaster Management Support. Universität Paderborn, 2016.
short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support, Universität Paderborn, 2016.
date_created: 2017-11-14T06:51:37Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Routing Algorithms on Delayed Networks for Disaster Management Support
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '1082'
author:
- first_name: Tobias
full_name: Handirk, Tobias
last_name: Handirk
citation:
ama: Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität
Paderborn; 2016.
apa: Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn.
bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken},
publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }'
chicago: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
ieee: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
mla: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität
Paderborn, 2016.
date_created: 2017-12-19T10:10:17Z
date_updated: 2022-01-06T06:50:51Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Über die Rolle von Informationen in Verkehrsnetzwerken
type: bachelorsthesis
user_id: '14052'
year: '2016'
...
---
_id: '128'
author:
- first_name: Katharina
full_name: Bernhardt, Katharina
last_name: Bernhardt
citation:
ama: Bernhardt K. Zertifikate als Qualitätssignal – Wie die Zertifizierung von
Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn; 2016.
apa: Bernhardt, K. (2016). Zertifikate als Qualitätssignal – Wie die Zertifizierung
von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn.
bibtex: '@book{Bernhardt_2016, title={Zertifikate als Qualitätssignal – Wie die
Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel
beeinflussen}, publisher={Universität Paderborn}, author={Bernhardt, Katharina},
year={2016} }'
chicago: Bernhardt, Katharina. Zertifikate als Qualitätssignal – Wie die Zertifizierung
von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn, 2016.
ieee: K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung
von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn, 2016.
mla: Bernhardt, Katharina. Zertifikate als Qualitätssignal – Wie die Zertifizierung
von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen.
Universität Paderborn, 2016.
short: K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung von
Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen,
Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:20Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und
Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '130'
author:
- first_name: Jessica
full_name: Kaczorkowski, Jessica
last_name: Kaczorkowski
citation:
ama: Kaczorkowski J. Wettbewerb im Internet - Eine wettbewerbspolitische Analyse
des E-Commerce. Universität Paderborn; 2016.
apa: Kaczorkowski, J. (2016). Wettbewerb im Internet - Eine wettbewerbspolitische
Analyse des E-Commerce. Universität Paderborn.
bibtex: '@book{Kaczorkowski_2016, title={Wettbewerb im Internet - Eine wettbewerbspolitische
Analyse des E-Commerce}, publisher={Universität Paderborn}, author={Kaczorkowski,
Jessica}, year={2016} }'
chicago: Kaczorkowski, Jessica. Wettbewerb im Internet - Eine wettbewerbspolitische
Analyse des E-Commerce. Universität Paderborn, 2016.
ieee: J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse
des E-Commerce. Universität Paderborn, 2016.
mla: Kaczorkowski, Jessica. Wettbewerb im Internet - Eine wettbewerbspolitische
Analyse des E-Commerce. Universität Paderborn, 2016.
short: J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse
des E-Commerce, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:27Z
department:
- _id: '280'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce
type: mastersthesis
user_id: '42447'
year: '2016'
...
---
_id: '154'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
citation:
ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation
Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2016.
apa: Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network
Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network
Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:23Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:52:03Z
date_updated: 2018-03-21T12:52:03Z
file_id: '1551'
file_name: 154-dissertation.pdf
file_size: 800101
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:52:03Z
has_accepted_license: '1'
intvolume: ' 353'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-942647-72-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Selfish Network Creation - On Variants of Network Creation Games
type: dissertation
user_id: '5786'
volume: 353
year: '2016'
...
---
_id: '159'
abstract:
- lang: eng
text: Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation
of bandwidth to each of the usersin a network. This allocation can be computed
by uniformlyraising the bandwidths of all users without violating capacityconstraints.
We consider an extension of these allocations byraising the bandwidth with arbitrary
and not necessarily uniformtime-depending velocities (allocation rates). These
allocationsare used in a game-theoretic context for routing choices, whichwe formalize
in progressive filling games (PFGs). We present avariety of results for equilibria
in PFGs. We show that these gamespossess pure Nash and strong equilibria. While
computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent
classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the
same source-destination pair.We characterize prices of anarchy and stability for
pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or
the same source-destination pairs. In addition, weshow that when a designer can
adjust allocation rates, it is possibleto design games with optimal strong equilibria.
Some initial resultson polynomial-time algorithms in this direction are also derived.
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling.
IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games
With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562.
https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With
Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks,
Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016},
pages={2553–2562} }'
chicago: 'Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no.
4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.'
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive
Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.
mla: Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM
Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
short: T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking
(2016) 2553–2562.
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:40Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:48:02Z
date_updated: 2018-03-21T12:48:02Z
file_id: '1547'
file_name: 159-Harks-Hoefer-Schewior-Skopalik2016.pdf
file_size: 1655309
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:48:02Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 2553 - 2562
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: IEEE/ACM Transactions on Networking
publisher: IEEE
status: public
title: Routing Games With Progressive Filling
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '149'
abstract:
- lang: eng
text: 'In this paper we consider a strategic variant of the online facility location
problem. Given is a graph in which each node serves two roles: it is a strategic
client stating requests as well as a potential location for a facility. In each
time step one client states a request which induces private costs equal to the
distance to the closest facility. Before serving, the clients may collectively
decide to open new facilities, sharing the corresponding price. Instead of optimizing
the global costs, each client acts selfishly. The prices of new facilities vary
between nodes and also change over time, but are always bounded by some fixed
value α. Both the requests as well as the facility prices are given by an online
sequence and are not known in advance.We characterize the optimal strategies of
the clients and analyze their overall performance in comparison to a centralized
offline solution. If all players optimize their own competitiveness, the global
performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
to a natural subclass of strategies improves this result to O(α). We also show
that for fixed facility costs, we can find strategies such that this bound further
improves to O(√α).'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43'
apa: Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility
Location. In Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43
bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
}'
chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
Facility Location.” In Proceedings of the 10th Annual International Conference
on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_43.
ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
in Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2016, pp. 593--607.
mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:55:43Z
date_updated: 2018-03-21T12:55:43Z
file_id: '1553'
file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
file_size: 236253
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '142'
abstract:
- lang: eng
text: For overlay networks, the ability to recover from a variety of problems like
membership changes or faults is a key element to preserve their functionality.
In recent years, various self-stabilizing overlay networks have been proposed
that have the advantage of being able to recover from any illegal state. However,
the vast majority of these networks cannot give any guarantees on its functionality
while the recovery process is going on. We are especially interested in searchability,
i.e., the functionality that search messages for a specific identifier are answered
successfully if a node with that identifier exists in the network. We investigate
overlay networks that are not only self-stabilizing but that also ensure that
monotonic searchability is maintained while the recovery process is going on,
as long as there are no corrupted messages in the system. More precisely, once
a search message from node u to another node v is successfully delivered, all
future search messages from u to v succeed as well. Monotonic searchability was
recently introduced in OPODIS 2015, in which the authors provide a solution for
a simple line topology.We present the first universal approach to maintain monotonic
searchability that is applicable to a wide range of topologies. As the base for
our approach, we introduce a set of primitives for manipulating overlay networks
that allows us to maintain searchability and show how existing protocols can be
transformed to use theses primitives.We complement this result with a generic
search protocol that together with the use of our primitives guarantees monotonic
searchability.As an additional feature, searching existing nodes with the generic
search protocol is as fast as searching a node with any other fixed routing protocol
once the topology has stabilized.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic
Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the
30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84.
doi:10.1007/978-3-662-53426-7_6'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal
Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In
Proceedings of the 30th International Symposium on Distributed Computing (DISC)
(pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards
a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks},
DOI={10.1007/978-3-662-53426-7_6},
booktitle={Proceedings of the 30th International Symposium on Distributed Computing
(DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim
Frederik}, year={2016}, pages={71--84}, collection={LNCS} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing
Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed
Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach
for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings
of the 30th International Symposium on Distributed Computing (DISC), 2016,
pp. 71--84.
mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability
in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-662-53426-7_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:59:29Z
date_updated: 2018-03-21T12:59:29Z
file_id: '1558'
file_name: 142-SchSetStrDISC16.pdf
file_size: 209638
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 71--84
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 30th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing
Overlay Networks
type: conference
user_id: '477'
year: '2016'
...
---
_id: '143'
abstract:
- lang: eng
text: 'We present an efficient parallel algorithm for the general Monotone Circuit
Value Problem (MCVP) with n gates and an underlying graph of bounded genus k.
Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP
with toroidal embedding (genus 1) is in NC when the input contains a toroidal
embedding of the circuit. In addition to extending this result from genus 1 to
any bounded genus k, and unlike the work reported by Limaye et al., we do not
require a precomputed embedding to be given. Most importantly, our results imply
that given a P-complete problem, it is possible to find an algorithm that makes
the problem fall into NC by fixing one or more parameters. Hence, we deduce the
interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete
what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work
that uses treewidth as parameter was also presented by Elberfeld et al. in [6].'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone
Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd
International Conference on Computing and Combinatorics (COCOON). LNCS. ;
2016:92-102. doi:10.1007/978-3-319-42634-1_8'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In
Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is
in NC}, DOI={10.1007/978-3-319-42634-1_8},
booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102},
collection={LNCS} }'
chicago: Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings
of the 22nd International Conference on Computing and Combinatorics (COCOON),
2016, pp. 92–102.
mla: Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON), 2016, pp. 92–102.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:57Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-42634-1_8
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:20:45Z
date_updated: 2018-11-02T14:20:45Z
file_id: '5269'
file_name: TheMonotoneCircuitValueProblem.pdf
file_size: 234587
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:20:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 92-102
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)
series_title: LNCS
status: public
title: The Monotone Circuit Value Problem with Bounded Genus Is in NC
type: conference
user_id: '477'
year: '2016'
...
---
_id: '144'
abstract:
- lang: eng
text: 'Following the direction pioneered by Fiat and Papadimitriou in their 2010
paper [12], we study the complexity of deciding the existence of mixed equilibria
for minimization games where players use valuations other than expectation to
evaluate their costs. We consider risk-averse players seeking to minimize the
sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative
and vanishes exactly when the cost incurred to a player is constant over all choices
of strategies by the other players. In a V-equilibrium, no player could unilaterally
reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if
all strategies supported in a player''s best-response mixed strategy incur the
same conditional expectation of her cost. We introduce E-strict concavity and
observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation
property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation
property, which we exploit to prove two main complexity results, the first of
their kind, for the two simplest cases of the problem:• Two strategies: Deciding
the existence of a V-equilibrium is strongly NP-hard for the restricted class
of player-specific scheduling games on two ordered links [22], when choosing R
as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum
of even moments of small order.• Two players: Deciding the existence of a V-equilibrium
is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the
risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the
concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence
of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation
property and a few additional properties for V; its proof involves a reduction
with a single parameter, which can be chosen efficiently so that each valuation
satisfies the additional properties.'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
citation:
ama: Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations.
Theoretical Computer Science. 2016;634:67-96. doi:10.1016/j.tcs.2016.04.013
apa: Monien, B., & Mavronicolas, M. (2016). The complexity of equilibria for
risk-modeling valuations. Theoretical Computer Science, 634, 67–96.
https://doi.org/10.1016/j.tcs.2016.04.013
bibtex: '@article{Monien_Mavronicolas_2016, title={The complexity of equilibria
for risk-modeling valuations}, volume={634}, DOI={10.1016/j.tcs.2016.04.013},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien,
Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }'
chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria
for Risk-Modeling Valuations.” Theoretical Computer Science 634 (2016):
67–96. https://doi.org/10.1016/j.tcs.2016.04.013.'
ieee: B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling
valuations,” Theoretical Computer Science, vol. 634, pp. 67–96, 2016.
mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for
Risk-Modeling Valuations.” Theoretical Computer Science, vol. 634, Elsevier,
2016, pp. 67–96, doi:10.1016/j.tcs.2016.04.013.
short: B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:51:59Z
ddc:
- '040'
doi: 10.1016/j.tcs.2016.04.013
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:58:42Z
date_updated: 2018-03-21T12:58:42Z
file_id: '1557'
file_name: 144-Monien_Mavronicolas-TCS2016_01.pdf
file_size: 633599
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:58:42Z
has_accepted_license: '1'
intvolume: ' 634'
language:
- iso: eng
page: 67-96
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: The complexity of equilibria for risk-modeling valuations
type: journal_article
user_id: '42447'
volume: 634
year: '2016'
...
---
_id: '145'
abstract:
- lang: eng
text: 'Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we present the peer-to-peer
system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM
comes with an extensive layer model to support various facets and protocols of
peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show
how it can be used for detailed measurements of large-scale peer-to-peer networks.
We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated, and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems. An immediate comparison
of different configurations and overlays under different aspects is possible directly
after the execution without any manual post-processing. '
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using
PeerfactSim.KOM. Concurrency and Computation: Practice and Experience.
2016;28(5):1655-1677. doi:10.1002/cpe.3716'
apa: 'Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience,
28(5), 1655–1677. https://doi.org/10.1002/cpe.3716'
bibtex: '@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716},
number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley
Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016},
pages={1655–1677} }'
chicago: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience
28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.'
ieee: 'M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems
using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, pp. 1655–1677, 2016.'
mla: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.'
short: 'M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience
28 (2016) 1655–1677.'
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1002/cpe.3716
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:57:57Z
date_updated: 2018-03-21T12:57:57Z
file_id: '1556'
file_name: 145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf
file_size: 3121363
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:57:57Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '5'
page: 1655-1677
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: 'Concurrency and Computation: Practice and Experience'
publication_status: published
publisher: Wiley Online Library
status: public
title: Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM
type: journal_article
user_id: '14052'
volume: 28
year: '2016'
...
---
_id: '131'
author:
- first_name: Annabel
full_name: Holzmann, Annabel
last_name: Holzmann
citation:
ama: Holzmann A. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn;
2016.
apa: Holzmann, A. (2016). Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren.
Universität Paderborn.
bibtex: '@book{Holzmann_2016, title={Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren},
publisher={Universität Paderborn}, author={Holzmann, Annabel}, year={2016} }'
chicago: Holzmann, Annabel. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren.
Universität Paderborn, 2016.
ieee: A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn,
2016.
mla: Holzmann, Annabel. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn,
2016.
short: A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:28Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen
zu Gesamtbewertungen zu aggregieren
type: bachelorsthesis
user_id: '477'
year: '2016'
...