---
_id: '275'
abstract:
- lang: eng
text: 'We investigate a non-cooperative game-theoretic model for the formation of
communication networks by selfish agents. Each agent aims for a central position
at minimum cost for creating edges. In particular, the general model (Fabrikant
et al., PODC''03) became popular for studying the structure of the Internet or
social networks. Despite its significance, locality in this game was first studied
only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
which came with a high efficiency loss in terms of quality of equilibria. Our
main contribution is a new and more optimistic view on locality: agents are limited
in their knowledge and actions to their local view ranges, but can probe different
strategies and finally choose the best. We study the influence of our locality
notion on the hardness of computing best responses, convergence to equilibria,
and quality of equilibria. Moreover, we compare the strength of local versus non-local
strategy changes. Our results address the gap between the original model and the
worst case locality variant. On the bright side, our efficiency results are in
line with observations from the original model, yet we have a non-constant lower
bound on the Price of Anarchy.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Pascal
full_name: Lenzner, Pascal
last_name: Lenzner
citation:
ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
In: Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21'
apa: 'Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think
Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21'
bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21},
booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
pages={248--260}, collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” In Proceedings of the 40th Conference on Mathematical
Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.'
ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260.'
mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations
of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.'
short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:27:12Z
date_updated: 2018-03-21T09:27:12Z
file_id: '1472'
file_name: 275-978-3-662-48054-0_21.pdf
file_size: 279995
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
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 40th Conference on Mathematical Foundations of Computer
Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '277'
author:
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
citation:
ama: Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn; 2015.
apa: Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn.
bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils},
year={2015} }'
chicago: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen
im Highspeed-Netzwerk. Universität Paderborn, 2015.
ieee: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
mla: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk.
Universität Paderborn, 2015.
short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:44Z
department:
- _id: '63'
- _id: '541'
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: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk
type: bachelorsthesis
user_id: '14052'
year: '2015'
...
---
_id: '17425'
author:
- first_name: 'Jan '
full_name: 'Berssenbrügge, Jan '
last_name: Berssenbrügge
- first_name: Olga
full_name: Wiederkehr, Olga
last_name: Wiederkehr
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.'
apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung
des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
343, 65–78.
bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn},
title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter
technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga
and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }'
chicago: 'Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer.
“Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer
Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der
Produktentstehung, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2015.'
ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen
Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 343, pp. 65–78.
mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented &
Virtual Reality in Der Produktentstehung, vol. 343, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 65–78.
short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.'
date_created: 2020-07-28T09:49:42Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 343'
language:
- iso: eng
page: 65-78
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer
Systeme
type: conference
user_id: '15415'
volume: 343
year: '2015'
...
---
_id: '17427'
author:
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Maria
full_name: Gerges, Maria
last_name: Gerges
- first_name: Jan
full_name: Berssenbrügge, Jan
last_name: Berssenbrügge
citation:
ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer
Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner
Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342.
Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.'
apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische
Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.
12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342, 107–120.
bibtex: '@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn},
title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem
3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and
Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }'
chicago: 'Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge.
“Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.”
In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.'
ieee: C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung
geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
2015, vol. 342, pp. 107–120.
mla: Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften
von Bauteilen Aus Dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015, pp. 107–20.
short: 'C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.'
date_created: 2020-07-28T10:23:18Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 342'
language:
- iso: eng
page: 107-120
place: Paderborn
publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell
type: conference
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17431'
citation:
ama: 'Gausemeier J, Grafe M, Meyer auf der Heide F, eds. Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR. Vol 342. 12. Paderborner Workshop Augmented & Virtual Reality
in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015.'
apa: 'Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2015). Augmented
& Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR (12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf
Instituts.'
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
title={Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping
intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, year={2015} }'
chicago: 'Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide,
eds. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen,
Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping
Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
ieee: 'J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., Augmented &
Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge;
Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR, 12. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
mla: 'Gausemeier, Jürgen, et al., editors. Augmented & Virtual Reality in
Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken,
Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2015.'
short: 'J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented & Virtual
Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions-
Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme
Mit AR/VR, 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.'
date_created: 2020-07-28T13:39:25Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
edition: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 342'
language:
- iso: eng
place: Paderborn
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden
und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter
technischer Systeme mit AR/VR'
type: book_editor
user_id: '15415'
volume: 342
year: '2015'
...
---
_id: '17657'
abstract:
- lang: eng
text: Inter-datacenter transfers of non-interactive but timely large flows over
a private (managed) network is an important problem faced by many cloud service
providers. The considered flows are non-interactive because they do not explicitly
target the end users. However, most of them must be performed on a timely basis
and are associated with a deadline. We propose to schedule these flows by a centralized
controller, which determines when to transmit each flow and which path to use.
Two scheduling models are presented in this paper. In the first, the controller
also determines the rate of each flow, while in the second bandwidth is assigned
by the network according to the TCP rules. We develop scheduling algorithms for
both models and compare their complexity and performance.
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud
Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data
Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large
Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964},
number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R.
and Polevoy, Gleb}, year={2015}, pages={1–1} }'
chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data
Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.'
ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,”
Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”
Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1,
doi:10.1109/TCC.2015.2487964.
short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.
date_created: 2020-08-06T15:20:58Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TCC.2015.2487964
extern: '1'
issue: '99'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Cloud computing
- Routing
- Schedules
- Scheduling
language:
- iso: eng
page: 1-1
publication: Cloud Computing, IEEE Transactions on
publication_identifier:
issn:
- 2168-7161
status: public
title: Inter-Datacenter Scheduling of Large Data Flows
type: journal_article
user_id: '83983'
volume: PP
year: '2015'
...
---
_id: '17658'
abstract:
- lang: eng
text: 'Abstract We study the problem of bandwidth allocation with multiple interferences.
In this problem the input consists of a set of users and a set of base stations.
Each user has a list of requests, each consisting of a base station, a frequency
demand, and a profit that may be gained by scheduling this request. The goal is
to find a maximum profit set of user requests S that satisfies the following conditions:
(i) S contains at most one request per user, (ii) the frequency sets allotted
to requests in S that correspond to the same base station are pairwise non-intersecting,
and (iii) the QoS received by any user at any frequency is reasonable according
to an interference model. In this paper we consider two variants of bandwidth
allocation with multiple interferences. In the first each request specifies a
demand that can be satisfied by any subset of frequencies that is large enough.
In the second each request specifies a specific frequency interval. Furthermore,
we consider two interference models, multiplicative and additive. We show that
these problems are extremely hard to approximate if the interferences depend on
both the interfered and the interfering base stations. On the other hand, we provide
constant factor approximation algorithms for both variants of bandwidth allocation
with multiple interferences for the case where the interferences depend only on
the interfering base stations. We also consider a restrictive special case that
is closely related to the Knapsack problem. We show that this special case is
NP-hard and that it admits an FPTAS. '
author:
- first_name: Reuven
full_name: Bar-Yehuda, Reuven
last_name: Bar-Yehuda
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Dror
full_name: Rawitz, Dror
last_name: Rawitz
citation:
ama: Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks
with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36.
doi:http://dx.doi.org/10.1016/j.dam.2015.05.013
apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2015). Bandwidth allocation
in cellular networks with multiple interferences. Discrete Applied Mathematics
, 194, 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013
bibtex: '@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in
cellular networks with multiple interferences}, volume={194}, DOI={http://dx.doi.org/10.1016/j.dam.2015.05.013},
journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda,
Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }'
chicago: 'Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation
in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics
194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.'
ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular
networks with multiple interferences,” Discrete Applied Mathematics , vol.
194, pp. 23–36, 2015.
mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with
Multiple Interferences.” Discrete Applied Mathematics , vol. 194, Elsevier,
2015, pp. 23–36, doi:http://dx.doi.org/10.1016/j.dam.2015.05.013.
short: R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015)
23–36.
date_created: 2020-08-06T15:21:15Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: http://dx.doi.org/10.1016/j.dam.2015.05.013
extern: '1'
intvolume: ' 194'
keyword:
- Local ratio
language:
- iso: eng
page: 23 - 36
publication: 'Discrete Applied Mathematics '
publication_identifier:
issn:
- 0166-218X
publisher: Elsevier
status: public
title: Bandwidth allocation in cellular networks with multiple interferences
type: journal_article
user_id: '83983'
volume: 194
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
text: We consider online leasing problems in which demands arrive over time and
need to be served by leasing resources. We introduce a new model for these problems
such that a resource can be leased for K different durations each incurring a
different cost (longer leases cost less per time unit). Each demand i can be served
anytime between its arrival ai and its deadline ai+di by a leased resource. The
objective is to meet all deadlines while minimizing the total leasing costs. This
model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
where dmax and lmin denote the largest di and the shortest available lease length,
respectively. We also extend the SetCoverLeasing problem by deadlines and give
a competitive online algorithm which also improves on existing solutions for the
original SetCoverLeasing problem.
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
Demands in Online Leasing Problems. In: Proceedings of the 21st Annual International
Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer
Science. ; 2015:277--288. doi:10.1007/978-3-319-21398-9_22'
apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers,
S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings
of the 21st Annual International Computing and Combinatorics Conference (COCOON)
(pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
Problems}, DOI={10.1007/978-3-319-21398-9_22},
booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
pages={277--288}, collection={Lecture Notes in Computer Science} }'
chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
In Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON), 277--288. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21398-9_22.
ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual
International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:50Z
date_updated: 2018-03-21T10:28:50Z
file_id: '1498'
file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
file_size: 264482
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '16449'
abstract:
- lang: eng
text: "We consider the following variant of the two dimensional gathering problem\r\nfor
swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots
on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe
grid and must keep this connectivity during the whole process of their\r\ngathering.
Connectivity means, that neighboring robots of the chain need to be\r\npositioned
at the same or neighboring points of the grid. In our model,\r\ngathering means
to keep shortening the chain until the robots are located\r\ninside a $2\\times
2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates,
no compass, no global communication or vision, \\ldots).\r\nEach robot can only
see its next constant number of left and right neighbors on\r\nthe chain. This
fixed constant is called the \\emph{viewing path length}. All\r\nits operations
and detections are restricted to this constant number of robots.\r\nOther robots,
even if located at neighboring or the same grid point cannot be\r\ndetected. Only
based on the relative positions of its detectable chain\r\nneighbors, a robot
can decide to obtain a certain state. Based on this state\r\nand their local knowledge,
the robots do local modifications to the chain by\r\nmoving to neighboring grid
points without breaking the chain. These\r\nmodifications are performed without
the knowledge whether they lead to a global\r\nprogress or not. We assume the
fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a
gathering algorithm which needs linear time. This\r\nresult generalizes the result
from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and
fixed) endpoints is considered."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: 'Andreas '
full_name: 'Cord-Landwehr, Andreas '
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering
a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.
bibtex: '@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering
a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and
Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung,
and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide,
“Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
short: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
ArXiv:1510.05454 (2015).
date_created: 2020-04-07T07:20:46Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.05454'
language:
- iso: eng
publication: arXiv:1510.05454
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16452'
abstract:
- lang: eng
text: "We consider the problem of dominating set-based virtual backbone used for\r\nrouting
in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission
ranges and are modeled using the well-established disk graphs. The\r\ncorresponding
graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set
of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly
connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is
strongly connected and each node in the graph is\r\neither in the set or has both
an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem
are of practical significance due to\r\nthe dynamic nature of ad-hoc networks.
We present a first distributed\r\napproximation algorithm, with a constant approximation
factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover
we present a\r\nsimple heuristic algorithm and conduct an extensive simulation
study showing\r\nthat our heuristic outperforms previously known approaches for
the problem."
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.
arXiv:151001866. 2015.
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2015). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks. ArXiv:1510.01866.
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks},
journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N. and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks,”
arXiv:1510.01866. 2015.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866
(2015).
date_created: 2020-04-07T12:22:48Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.01866'
language:
- iso: eng
publication: arXiv:1510.01866
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16460'
abstract:
- lang: eng
text: "Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual
online data stream of numbers and, at any point in time, the\r\ncoordinator has
to know the k nodes currently observing the largest values, for\r\na given k between
1 and n. We design and analyze an algorithm that solves this\r\nproblem while
bounding the amount of messages exchanged between the nodes and\r\nthe coordinator.
Our algorithm employs the idea of using filters which,\r\nintuitively speaking,
leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous
ones. The algorithm uses a number of messages that is\r\non expectation by a factor
of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that
sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest
value observed by any node."
author:
- first_name: Alexander
full_name: Mäcker, Alexander
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring
of Distributed Data Streams. In: Proceedings of the 29th International Parallel
and Distributed Processing Symposium (IPDPS). IEEE; 2015:357-364. doi:10.1109/IPDPS.2015.40'
apa: Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2015). Online Top-k-Position
Monitoring of Distributed Data Streams. In Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 357–364). IEEE.
https://doi.org/10.1109/IPDPS.2015.40
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online
Top-k-Position Monitoring of Distributed Data Streams}, DOI={10.1109/IPDPS.2015.40},
booktitle={Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }'
chicago: Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“Online Top-k-Position Monitoring of Distributed Data Streams.” In Proceedings
of the 29th International Parallel and Distributed Processing Symposium (IPDPS),
357–64. IEEE, 2015. https://doi.org/10.1109/IPDPS.2015.40.
ieee: A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position
Monitoring of Distributed Data Streams,” in Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS), 2015, pp. 357–364.
mla: Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed
Data Streams.” Proceedings of the 29th International Parallel and Distributed
Processing Symposium (IPDPS), IEEE, 2015, pp. 357–64, doi:10.1109/IPDPS.2015.40.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the
29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2015, pp. 357–364.'
date_created: 2020-04-08T07:02:15Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2015.40
external_id:
arxiv:
- '1410.7912'
language:
- iso: eng
page: 357-364
publication: Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Online Top-k-Position Monitoring of Distributed Data Streams
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '16391'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Degener B, Kempkes B, Kling P, Meyer auf der Heide F. Linear and Competitive
Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel
Computing. 2015:1-18. doi:10.1145/2742341
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015).
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM
Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341
bibtex: '@article{Degener_Kempkes_Kling_Meyer auf der Heide_2015, title={Linear
and Competitive Strategies for Continuous Robot Formation Problems}, DOI={10.1145/2742341},
journal={ACM Transactions on Parallel Computing}, author={Degener, Bastian and
Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2015},
pages={1–18} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “Linear and Competitive Strategies for Continuous Robot Formation Problems.”
ACM Transactions on Parallel Computing, 2015, 1–18. https://doi.org/10.1145/2742341.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Linear and
Competitive Strategies for Continuous Robot Formation Problems,” ACM Transactions
on Parallel Computing, pp. 1–18, 2015.
mla: Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous
Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015,
pp. 1–18, doi:10.1145/2742341.
short: B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, ACM Transactions
on Parallel Computing (2015) 1–18.
date_created: 2020-04-03T06:40:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/2742341
language:
- iso: eng
page: 1-18
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
status: public
title: Linear and Competitive Strategies for Continuous Robot Formation Problems
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '16397'
abstract:
- lang: eng
text: "In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe
consider the gathering of a closed chain of point-shaped, anonymous robots\r\non
a grid. The robots only have local knowledge about a constant number of\r\nneighboring
robots along the chain in both directions. Actions are performed in\r\nthe fully
synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain
one timestamp of the global clock, also visible to its direct\r\nneighbors. In
this synchronous time model, there is no limited view gathering\r\nalgorithm known
to perform better than in quadratic runtime. The configurations\r\nthat show the
quadratic lower bound are closed chains. In this paper, we\r\npresent the first
sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains
on a grid."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Andreas Cord-Landwehr, Andreas
last_name: Andreas Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case. ArXiv:
150104877. 2015.'
apa: 'Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide,
F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed
Chain Case. ArXiv: 1501.04877.'
bibtex: '@article{Abshoff_Andreas Cord-Landwehr_Jung_Meyer auf der Heide_2015, title={Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case}, journal={ArXiv:
1501.04877}, author={Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and
Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: 'Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm
Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time:
The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
ieee: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, and F. Meyer auf der Heide,
“Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case,” ArXiv: 1501.04877. 2015.'
mla: 'Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in
Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
short: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, F. Meyer auf der Heide, ArXiv:
1501.04877 (2015).'
date_created: 2020-04-03T09:36:54Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1501.04877'
language:
- iso: eng
publication: 'ArXiv: 1501.04877'
status: public
title: 'Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case'
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '20007'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Istvan
full_name: Karsai, Istvan
last_name: Karsai
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Allison
full_name: Hilbun, Allison
last_name: Hilbun
citation:
ama: 'Hamann H, Karsai I, Schmickl T, Hilbun A. The common stomach: Organizing task
allocation in wasp societies. In: Symposium on Biomathematics and Ecology:
Education and Research. ; 2014.'
apa: 'Hamann, H., Karsai, I., Schmickl, T., & Hilbun, A. (2014). The common
stomach: Organizing task allocation in wasp societies. In Symposium on Biomathematics
and Ecology: Education and Research.'
bibtex: '@inproceedings{Hamann_Karsai_Schmickl_Hilbun_2014, title={The common stomach:
Organizing task allocation in wasp societies}, booktitle={Symposium on Biomathematics
and Ecology: Education and Research}, author={Hamann, Heiko and Karsai, Istvan
and Schmickl, Thomas and Hilbun, Allison}, year={2014} }'
chicago: 'Hamann, Heiko, Istvan Karsai, Thomas Schmickl, and Allison Hilbun. “The
Common Stomach: Organizing Task Allocation in Wasp Societies.” In Symposium
on Biomathematics and Ecology: Education and Research, 2014.'
ieee: 'H. Hamann, I. Karsai, T. Schmickl, and A. Hilbun, “The common stomach: Organizing
task allocation in wasp societies,” in Symposium on Biomathematics and Ecology:
Education and Research, 2014.'
mla: 'Hamann, Heiko, et al. “The Common Stomach: Organizing Task Allocation in Wasp
Societies.” Symposium on Biomathematics and Ecology: Education and Research,
2014.'
short: 'H. Hamann, I. Karsai, T. Schmickl, A. Hilbun, in: Symposium on Biomathematics
and Ecology: Education and Research, 2014.'
date_created: 2020-10-15T13:56:46Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: 'Symposium on Biomathematics and Ecology: Education and Research'
status: public
title: 'The common stomach: Organizing task allocation in wasp societies'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20008'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
citation:
ama: 'Hamann H, Valentini G. Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing
Temporary Lock-ins. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014).
Cham; 2014. doi:10.1007/978-3-319-09952-1_15'
apa: 'Hamann, H., & Valentini, G. (2014). Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-organizing Temporary Lock-ins. In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham. https://doi.org/10.1007/978-3-319-09952-1_15'
bibtex: '@inproceedings{Hamann_Valentini_2014, place={Cham}, title={Swarm in a Fly
Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins}, DOI={10.1007/978-3-319-09952-1_15},
booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Hamann,
Heiko and Valentini, Gabriele}, year={2014} }'
chicago: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” In Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014). Cham, 2014. https://doi.org/10.1007/978-3-319-09952-1_15.'
ieee: 'H. Hamann and G. Valentini, “Swarm in a Fly Bottle: Feedback-Based Analysis
of Self-organizing Temporary Lock-ins,” in Ninth Int. Conf. on Swarm Intelligence
(ANTS 2014), 2014.'
mla: 'Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based
Analysis of Self-Organizing Temporary Lock-Ins.” Ninth Int. Conf. on Swarm
Intelligence (ANTS 2014), 2014, doi:10.1007/978-3-319-09952-1_15.'
short: 'H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS
2014), Cham, 2014.'
date_created: 2020-10-15T14:13:51Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-09952-1_15
language:
- iso: eng
place: Cham
publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
publication_identifier:
isbn:
- '9783319099514'
- '9783319099521'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary
Lock-ins'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20120'
abstract:
- lang: eng
text: A grand challenge in the field of artificial life is to find a general theory
of emergent self-organizing systems. In swarm systems most of the observed complexity
is based on motion of simple entities. Similarly, statistical mechanics focuses
on collective properties induced by the motion of many interacting particles.
In this article we apply methods from statistical mechanics to swarm systems.
We try to explain the emergent behavior of a simulated swarm by applying methods
based on the fluctuation theorem. Empirical results indicate that swarms are able
to produce negative entropy within an isolated subsystem due to frozen accidents.
Individuals of a swarm are able to locally detect fluctuations of the global entropy
measure and store them, if they are negative entropy productions. By accumulating
these stored fluctuations over time the swarm as a whole is producing negative
entropy and the system ends up in an ordered state. We claim that this indicates
the existence of an inverted fluctuation theorem for emergent self-organizing
dissipative systems. This approach bears the potential of general applicability.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: Hamann H, Schmickl T, Crailsheim K. Analysis of Swarm Behaviors Based on an
Inversion of the Fluctuation Theorem. Artificial Life. 2014;20(1):77-93.
doi:10.1162/ARTL_a_00097
apa: Hamann, H., Schmickl, T., & Crailsheim, K. (2014). Analysis of Swarm Behaviors
Based on an Inversion of the Fluctuation Theorem. Artificial Life, 20(1),
77–93. https://doi.org/10.1162/ARTL_a_00097
bibtex: '@article{Hamann_Schmickl_Crailsheim_2014, title={Analysis of Swarm Behaviors
Based on an Inversion of the Fluctuation Theorem}, volume={20}, DOI={10.1162/ARTL_a_00097},
number={1}, journal={Artificial Life}, author={Hamann, Heiko and Schmickl, Thomas
and Crailsheim, Karl}, year={2014}, pages={77–93} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Analysis of Swarm
Behaviors Based on an Inversion of the Fluctuation Theorem.” Artificial Life
20, no. 1 (2014): 77–93. https://doi.org/10.1162/ARTL_a_00097.'
ieee: H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis of Swarm Behaviors Based
on an Inversion of the Fluctuation Theorem,” Artificial Life, vol. 20,
no. 1, pp. 77–93, 2014.
mla: Hamann, Heiko, et al. “Analysis of Swarm Behaviors Based on an Inversion of
the Fluctuation Theorem.” Artificial Life, vol. 20, no. 1, 2014, pp. 77–93,
doi:10.1162/ARTL_a_00097.
short: H. Hamann, T. Schmickl, K. Crailsheim, Artificial Life 20 (2014) 77–93.
date_created: 2020-10-19T08:41:18Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1162/ARTL_a_00097
intvolume: ' 20'
issue: '1'
language:
- iso: eng
page: 77-93
publication: Artificial Life
status: public
title: Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem
type: journal_article
user_id: '15415'
volume: 20
year: '2014'
...
---
_id: '20121'
abstract:
- lang: eng
text: Collective decision making in self-organized systems is challenging because
it relies on local perception and local communication. Globally defined qualities
such as consensus time and decision accuracy are both difficult to predict and
difficult to guarantee. We present the weighted voter model which implements a
self-organized collective decision making process. We provide an ODE model, a
master equation model (numerically solved by the Gillespie algorithm), and agent-based
simulations of the proposed decision-making strategy. This set of models enables
us to investigate the system behavior in the thermodynamic limit and to investigate
finite-size effects due to random fluctuations. Based on our results, we give
minimum requirements to guarantee consensus on the optimal decision, a minimum
swarm size to guarantee a certain accuracy, and we show that the proposed approach
scales with system size and is robust to noise.
author:
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: Alessio
full_name: Lomuscio, Alessio
last_name: Lomuscio
- first_name: Paul
full_name: Scerri, Paul
last_name: Scerri
- first_name: Ana
full_name: Bazzan, Ana
last_name: Bazzan
- first_name: Michael
full_name: Huhns, Michael
last_name: Huhns
citation:
ama: 'Dorigo M, Hamann H, Valentini G, et al. Self-Organized Collective Decision
Making: The Weighted Voter Model. In: Proceedings of the 13th Int. Conf. on
Autonomous Agents and Multiagent Systems (AAMAS 2014). ; 2014.'
apa: 'Dorigo, M., Hamann, H., Valentini, G., Lomuscio, A., Scerri, P., Bazzan, A.,
& Huhns, M. (2014). Self-Organized Collective Decision Making: The Weighted
Voter Model. In Proceedings of the 13th Int. Conf. on Autonomous Agents and
Multiagent Systems (AAMAS 2014).'
bibtex: '@inproceedings{Dorigo_Hamann_Valentini_Lomuscio_Scerri_Bazzan_Huhns_2014,
title={Self-Organized Collective Decision Making: The Weighted Voter Model}, booktitle={Proceedings
of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)},
author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Lomuscio,
Alessio and Scerri, Paul and Bazzan, Ana and Huhns, Michael}, year={2014} }'
chicago: 'Dorigo, Marco, Heiko Hamann, Gabriele Valentini, Alessio Lomuscio, Paul
Scerri, Ana Bazzan, and Michael Huhns. “Self-Organized Collective Decision Making:
The Weighted Voter Model.” In Proceedings of the 13th Int. Conf. on Autonomous
Agents and Multiagent Systems (AAMAS 2014), 2014.'
ieee: 'M. Dorigo et al., “Self-Organized Collective Decision Making: The
Weighted Voter Model,” in Proceedings of the 13th Int. Conf. on Autonomous
Agents and Multiagent Systems (AAMAS 2014), 2014.'
mla: 'Dorigo, Marco, et al. “Self-Organized Collective Decision Making: The Weighted
Voter Model.” Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014), 2014.'
short: 'M. Dorigo, H. Hamann, G. Valentini, A. Lomuscio, P. Scerri, A. Bazzan, M.
Huhns, in: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014), 2014.'
date_created: 2020-10-19T08:49:05Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent
Systems (AAMAS 2014)
status: public
title: 'Self-Organized Collective Decision Making: The Weighted Voter Model'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20126'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Hamann H. Evolving Prediction Machines: Collective Behaviors Based on Minimal
Surprisal. In: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014).
; 2014:31-32. doi:10.1145/2598394.2598507'
apa: 'Hamann, H. (2014). Evolving Prediction Machines: Collective Behaviors Based
on Minimal Surprisal. In Int. Conf. on Genetic and Evolutionary Computation
(GECCO 2014) (pp. 31–32). https://doi.org/10.1145/2598394.2598507'
bibtex: '@inproceedings{Hamann_2014, title={Evolving Prediction Machines: Collective
Behaviors Based on Minimal Surprisal}, DOI={10.1145/2598394.2598507},
booktitle={Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)}, author={Hamann,
Heiko}, year={2014}, pages={31–32} }'
chicago: 'Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based
on Minimal Surprisal.” In Int. Conf. on Genetic and Evolutionary Computation
(GECCO 2014), 31–32, 2014. https://doi.org/10.1145/2598394.2598507.'
ieee: 'H. Hamann, “Evolving Prediction Machines: Collective Behaviors Based on Minimal
Surprisal,” in Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014),
2014, pp. 31–32.'
mla: 'Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based on
Minimal Surprisal.” Int. Conf. on Genetic and Evolutionary Computation (GECCO
2014), 2014, pp. 31–32, doi:10.1145/2598394.2598507.'
short: 'H. Hamann, in: Int. Conf. on Genetic and Evolutionary Computation (GECCO
2014), 2014, pp. 31–32.'
date_created: 2020-10-20T07:45:46Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1145/2598394.2598507
language:
- iso: eng
page: 31-32
publication: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)
status: public
title: 'Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20127'
author:
- first_name: Mauro
full_name: Birattari, Mauro
last_name: Birattari
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Simon
full_name: Garnier, Simon
last_name: Garnier
- first_name: Marco
full_name: Montes de Oca, Marco
last_name: Montes de Oca
- first_name: Christine
full_name: Solnon, Christine
last_name: Solnon
- first_name: Thomas
full_name: Stuetzle, Thomas
last_name: Stuetzle
- first_name: Hongli
full_name: Ding, Hongli
last_name: Ding
citation:
ama: 'Birattari M, Dorigo M, Hamann H, et al. Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014).
Vol 8667. ; 2014:262-269. doi:10.1007/978-3-319-09952-1_25'
apa: Birattari, M., Dorigo, M., Hamann, H., Garnier, S., Montes de Oca, M., Solnon,
C., … Ding, H. (2014). Sorting in Swarm Robots Using Communication-Based Cluster
Size Estimation. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
(Vol. 8667, pp. 262–269). https://doi.org/10.1007/978-3-319-09952-1_25
bibtex: '@inproceedings{Birattari_Dorigo_Hamann_Garnier_Montes de Oca_Solnon_Stuetzle_Ding_2014,
title={Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation},
volume={8667}, DOI={10.1007/978-3-319-09952-1_25},
booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Birattari,
Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca,
Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}, year={2014},
pages={262–269} }'
chicago: Birattari, Mauro, Marco Dorigo, Heiko Hamann, Simon Garnier, Marco Montes
de Oca, Christine Solnon, Thomas Stuetzle, and Hongli Ding. “Sorting in Swarm
Robots Using Communication-Based Cluster Size Estimation.” In Ninth Int. Conf.
on Swarm Intelligence (ANTS 2014), 8667:262–69, 2014. https://doi.org/10.1007/978-3-319-09952-1_25.
ieee: M. Birattari et al., “Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation,” in Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
2014, vol. 8667, pp. 262–269.
mla: Birattari, Mauro, et al. “Sorting in Swarm Robots Using Communication-Based
Cluster Size Estimation.” Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
vol. 8667, 2014, pp. 262–69, doi:10.1007/978-3-319-09952-1_25.
short: 'M. Birattari, M. Dorigo, H. Hamann, S. Garnier, M. Montes de Oca, C. Solnon,
T. Stuetzle, H. Ding, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014),
2014, pp. 262–269.'
date_created: 2020-10-20T07:54:18Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-09952-1_25
intvolume: ' 8667'
language:
- iso: eng
page: 262-269
publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)
status: public
title: Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation
type: conference
user_id: '15415'
volume: 8667
year: '2014'
...
---
_id: '20128'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Marco
full_name: Dorigo, Marco
last_name: Dorigo
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gabriele
full_name: Valentini, Gabriele
last_name: Valentini
- first_name: T.
full_name: Bartz-Beielstein, T.
last_name: Bartz-Beielstein
citation:
ama: 'Khaluf Y, Dorigo M, Hamann H, Valentini G, Bartz-Beielstein T. Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements. In: 13th International Conference on
Parallel Problem Solving from Nature (PPSN 2014). Vol 8672. Springer; 2014:181-190.
doi:10.1007/978-3-319-10762-2_18'
apa: 'Khaluf, Y., Dorigo, M., Hamann, H., Valentini, G., & Bartz-Beielstein,
T. (2014). Derivation of a Micro-Macro Link for Collective Decision-Making Systems:
Uncover Network Features Based on Drift Measurements. In 13th International
Conference on Parallel Problem Solving from Nature (PPSN 2014) (Vol. 8672,
pp. 181–190). Springer. https://doi.org/10.1007/978-3-319-10762-2_18'
bibtex: '@inbook{Khaluf_Dorigo_Hamann_Valentini_Bartz-Beielstein_2014, title={Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements}, volume={8672}, DOI={10.1007/978-3-319-10762-2_18},
booktitle={13th International Conference on Parallel Problem Solving from Nature
(PPSN 2014)}, publisher={Springer}, author={Khaluf, Yara and Dorigo, Marco and
Hamann, Heiko and Valentini, Gabriele and Bartz-Beielstein, T.}, year={2014},
pages={181–190} }'
chicago: 'Khaluf, Yara, Marco Dorigo, Heiko Hamann, Gabriele Valentini, and T. Bartz-Beielstein.
“Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover
Network Features Based on Drift Measurements.” In 13th International Conference
on Parallel Problem Solving from Nature (PPSN 2014), 8672:181–90. Springer,
2014. https://doi.org/10.1007/978-3-319-10762-2_18.'
ieee: 'Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, and T. Bartz-Beielstein, “Derivation
of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network
Features Based on Drift Measurements,” in 13th International Conference on
Parallel Problem Solving from Nature (PPSN 2014), vol. 8672, Springer, 2014,
pp. 181–190.'
mla: 'Khaluf, Yara, et al. “Derivation of a Micro-Macro Link for Collective Decision-Making
Systems: Uncover Network Features Based on Drift Measurements.” 13th International
Conference on Parallel Problem Solving from Nature (PPSN 2014), vol. 8672,
Springer, 2014, pp. 181–90, doi:10.1007/978-3-319-10762-2_18.'
short: 'Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, T. Bartz-Beielstein, in:
13th International Conference on Parallel Problem Solving from Nature (PPSN 2014),
Springer, 2014, pp. 181–190.'
date_created: 2020-10-20T08:26:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-10762-2_18
intvolume: ' 8672'
language:
- iso: eng
page: 181-190
publication: 13th International Conference on Parallel Problem Solving from Nature
(PPSN 2014)
publisher: Springer
status: public
title: 'Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover
Network Features Based on Drift Measurements'
type: book_chapter
user_id: '15415'
volume: 8672
year: '2014'
...