---
_id: '33947'
article_type: original
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031
apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved
Algorithms for Chain-Formation. Theoretical Computer Science, 939,
261–291. https://doi.org/10.1016/j.tcs.2022.10.031
bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031},
journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow,
Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, year={2023}, pages={261–291} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time
and Improved Algorithms for Chain-Formation.” Theoretical Computer Science
939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291,
2023, doi: 10.1016/j.tcs.2022.10.031.'
mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science,
vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031.
short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical
Computer Science 939 (2023) 261–291.
date_created: 2022-10-28T05:11:16Z
date_updated: 2023-01-30T09:20:09Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2022.10.031
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 939'
keyword:
- General Computer Science
- Theoretical Computer Science
language:
- iso: eng
page: 261-291
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation
type: journal_article
user_id: '38705'
volume: 939
year: '2023'
...
---
_id: '34008'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F.
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited
Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) . Vol
253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15'
apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf
der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented
Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.),
Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15
bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023,
place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15},
booktitle={Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik},
author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and
Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and
Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann,
and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , edited
by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz
International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl
– Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.'
ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf
der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility ,” in Proceedings of the 26th International Conference
on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253,
p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.'
mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International
Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar
Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023,
p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.
short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der
Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , Schloss
Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.'
conference:
end_date: 2022-12-15
location: Brussels
name: 26th International Conference on Principles of Distributed Systems (OPODIS)
start_date: 2022-12-13
date_created: 2022-11-04T09:41:30Z
date_updated: 2023-02-15T14:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.OPODIS.2022.15
editor:
- first_name: Eshcar
full_name: Hillel, Eshcar
last_name: Hillel
- first_name: Roberto
full_name: Palmieri, Roberto
last_name: Palmieri
- first_name: Etienne
full_name: Riviére, Etienne
last_name: Riviére
external_id:
arxiv:
- '2206.07567 '
intvolume: ' 253'
language:
- iso: eng
page: 15:1–15:25
place: Brussels
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 'Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) '
publication_identifier:
isbn:
- 978-3-95977-265-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with
Limited Visibility '
type: conference
user_id: '38705'
volume: 253
year: '2023'
...
---
_id: '23730'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R,
Radzik T, eds. Proceedings of the 17th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS.
Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3'
apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L.
Gasieniec, R. Klasing, & T. Radzik (Eds.), Proceedings of the 17th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
(Vol. 12961, pp. 29–44). Springer. https://doi.org/10.1007/978-3-030-89240-1_3
bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021,
series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time},
volume={12961}, DOI={10.1007/978-3-030-89240-1_3},
booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow,
Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz},
year={2021}, pages={29–44}, collection={LNCS} }'
chicago: Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”
In Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec, Ralf
Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-89240-1_3.
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Gathering a Euclidean Closed Chain of Robots in Linear Time,” in Proceedings
of the 17th International Symposium on Algorithms and Experiments for Wireless
Sensor Networks (ALGOSENSORS), Lissabon, 2021, vol. 12961, pp. 29–44, doi:
10.1007/978-3-030-89240-1_3.'
mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
Time.” Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et
al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3.
short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS),
Springer, 2021, pp. 29–44.'
conference:
end_date: 2021-09-10
location: Lissabon
name: 17th International Symposium on Algorithms and Experiments for Wireless Sensor
Networks (ALGOSENSORS) 2021
start_date: 2021-09-09
date_created: 2021-09-03T09:01:25Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1007/978-3-030-89240-1_3
editor:
- first_name: Leszek
full_name: Gasieniec, Leszek
last_name: Gasieniec
- first_name: Ralf
full_name: Klasing, Ralf
last_name: Klasing
- first_name: Tomasz
full_name: Radzik, Tomasz
last_name: Radzik
external_id:
arxiv:
- '2010.04424'
intvolume: ' 12961'
language:
- iso: eng
page: 29 - 44
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS)
publication_status: published
publisher: Springer
series_title: LNCS
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time
type: conference
user_id: '38705'
volume: 12961
year: '2021'
...
---
_id: '20185'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety,
and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture
Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5'
apa: 'Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility . In S. Devismes & N. Mittal
(Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
(Vol. 12514, pp. 60–64). Springer. https://doi.org/10.1007/978-3-030-64348-5_5'
bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020,
series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility }, volume={12514}, DOI={10.1007/978-3-030-64348-5_5},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings },
publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel
and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane and Mittal,
NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer
Science (LNCS)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain
of Disoriented & Luminous Robots with Limited Visibility .” In Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer,
2020. https://doi.org/10.1007/978-3-030-64348-5_5.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &
Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security
of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas,
USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.'
mla: 'Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A
Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.'
short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.'
date_created: 2020-10-23T08:50:28Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_5
editor:
- first_name: 'Stéphane '
full_name: 'Devismes, Stéphane '
last_name: Devismes
- first_name: Neeraj
full_name: ' Mittal, Neeraj'
last_name: ' Mittal'
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 12514'
language:
- iso: eng
page: 60-64
publication: 'Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings '
publication_identifier:
isbn:
- 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility '
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
---
_id: '16299'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jonas
full_name: Harbig, Jonas
last_name: Harbig
- 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: Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous,
Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309.
doi:10.1016/j.tcs.2020.02.018
apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide,
F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer
Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering
Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={10.1016/j.tcs.2020.02.018},
journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer,
Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2020}, pages={289–309} }'
chicago: 'Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm
Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical
Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.'
ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering
Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol.
815, pp. 289–309, 2020.
mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical
Computer Science 815 (2020) 289–309.
date_created: 2020-03-13T12:55:53Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.02.018
intvolume: ' 815'
language:
- iso: eng
page: 289-309
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: journal_article
user_id: '38705'
volume: 815
year: '2020'
...
---
_id: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '1209'
abstract:
- lang: eng
text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
robots on a grid, in which all robots of the swarm are supposed to gather at a
previously undefined point. Special attention is paid to the strong limitation
of robot capabilities. These include in particular the lack of global control,
a global compass, global visibility and (global) communication skills. Furthermore,
all robots are identical. The robots are given only local abilities. This includes
a constant range of vision. The robots all work completely synchronously. In this
work we present and analyze three different Gathering strategies in different
robot models. We formally prove correctness and total running time: Chapter 4
focuses on minimizing the available robot capabilities. The underlying strategy
completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
aim is to optimize the total running time under using only local robot capabilities:
We additionally allow a constant-sized memory and a constant number of locally
visible statuses (lights, flags). For the strategies of both chapters we show
an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
additionally restrict connectivity and vision to an initially given chain connectivity
in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
citation:
ama: Jung D. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-271
apa: Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-271
bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
DOI={10.17619/UNIPB/1-271},
publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
chicago: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
ieee: D. Jung, Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018.
mla: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018, doi:10.17619/UNIPB/1-271.
short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2024-07-12T12:05:00Z
department:
- _id: '63'
- _id: '26'
doi: 10.17619/UNIPB/1-271
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
grant_number: '160364472'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '1112'
year: '2018'
...
---
_id: '17811'
abstract:
- lang: eng
text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional
grid. A basic task for such a swarm is the gathering process: All\r\nrobots have
to gather at one (not predefined) place. A common local model for\r\nextremely
simple robots is the following: The robots do not have a common\r\ncompass, only
have a constant viewing radius, are autonomous and\r\nindistinguishable, can move
at most a constant distance in each step, cannot\r\ncommunicate, are oblivious
and do not have flags or states. The only gathering\r\nalgorithm under this robot
model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works
in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the
fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case
of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same
time and a similar local model additionally require a\r\nconstant memory, states
and \"flags\" to communicate these states to neighbors in\r\nviewing range. They
gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the
best of our knowledge) first\r\ngathering algorithm on the grid that works under
the same simple local model as\r\nthe above mentioned Euclidean plane strategy,
i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness
and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$
time model. This time bound\r\nmatches the time bound of the best known algorithm
for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots
are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such
configurations cannot be\r\nsolved."
author:
- 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: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots
on a Grid. arXiv:170203400. 2017.
apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous,
Oblivious Robots on a Grid. ArXiv:1702.03400.
bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous,
Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias
and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }'
chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering
Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
Robots on a Grid,” arXiv:1702.03400. 2017.
mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
ArXiv:1702.03400, 2017.
short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).
date_created: 2020-08-11T13:48:38Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:1702.03400
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: preprint
user_id: '15415'
year: '2017'
...
---
_id: '16347'
author:
- 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: 'Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots
on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms
for Sensor Systems - 13th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer
Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13'
apa: 'Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous,
Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro,
& Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}
(Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13'
bibtex: '@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria},
series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious
Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13},
booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer},
author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A.
and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering
Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems -
13th International Symposium on Algorithms and Experiments for Wireless Sensor
Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski,
Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer
Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.'
ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS},
2017, vol. 10718, pp. 168–181.
mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio
Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
short: 'M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski,
M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS},
Springer, Vienna, Austria, 2017, pp. 168–181.'
date_created: 2020-03-27T14:32:39Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-319-72751-6_13
editor:
- first_name: Antonio
full_name: Fernández Anta, Antonio
last_name: Fernández Anta
- first_name: Tomasz
full_name: Jurdzinski, Tomasz
last_name: Jurdzinski
- first_name: Miguel A.
full_name: Mosteiro, Miguel A.
last_name: Mosteiro
- first_name: Yanyong
full_name: Zhang, Yanyong
last_name: Zhang
intvolume: ' 10718'
language:
- iso: eng
page: 168-181
place: Vienna, Austria
publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: conference
user_id: '15415'
volume: 10718
year: '2017'
...
---
_id: '16450'
abstract:
- lang: eng
text: "In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable,
point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time
$\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given
an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem
on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is
not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal
neighbors on the grid. The\r\nlocality constraint means that no global control,
no compass, no global\r\ncommunication and only local vision is available; hence,
a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which
also limits its\r\nmovements. A robot can move to one of its eight neighboring
grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged}
to be only\r\none robot. The locality constraint is the significant challenging
issue here,\r\nsince robot movements must not harm the (only globally checkable)
swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm
-- executed by every robot -- which ensures that robots merge without\r\nbreaking
the swarm connectivity. In our model, robots can obtain a special\r\nstate, which
marks such a robot to be performing specific connectivity\r\npreserving movements
in order to allow later merge operations of the swarm.\r\nCompared to the grid,
for gathering in the Euclidean plane for the same robot\r\nand time model the
best known upper bound is $\\mathcal{O}(n^2)$."
author:
- 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: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal
Gathering on a Grid. arXiv:160203303. 2016.
apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016).
Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.
bibtex: '@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr,
Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2016} }'
chicago: Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer
auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303,
2016.
ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
Optimal Gathering on a Grid,” arXiv:1602.03303. 2016.
mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
ArXiv:1602.03303, 2016.
short: A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303
(2016).
date_created: 2020-04-07T07:20:47Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1602.03303'
language:
- iso: eng
publication: arXiv:1602.03303
status: public
title: Asymptotically Optimal Gathering on a Grid
type: preprint
user_id: '15415'
year: '2016'
...
---
_id: '16359'
abstract:
- lang: eng
text: In this paper, we solve the local gathering problem of a swarm of n indistinguishable,
point-shaped robots on a two dimensional grid in asymptotically optimal time O(n)
in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet
connected) swarm of robots, the gathering problem on the grid is to locate all
robots within a 2x2- sized area that is not known beforehand. Two robots are connected
if they are vertical or horizontal neighbors on the grid. The locality constraint
means that no global control, no compass, no global communication and only local
vision is available; hence, a robot can only see its grid neighbors up to a constant
L1-distance, which also limits its movements. A robot can move to one of its eight
neighboring grid cells and if two or more robots move to the same location they
are merged to be only one robot. The locality constraint is the significant challenging
issue here, since robot move- ments must not harm the (only globally checkable)
swarm connectivity. For solving the gathering problem, we provide a synchronous
algorithm { executed by every robot { which ensures that robots merge without
breaking the swarm con- nectivity. In our model, robots can obtain a special state,
which marks such a robot to be performing specific connec- tivity preserving movements
in order to allow later merge operations of the swarm. Compared to the grid, for
gath- ering in the Euclidean plane for the same robot and time model the best
known upper bound is O(n^2).
author:
- 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: 'Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically
Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789'
apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016).
Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312).
ACM. https://doi.org/10.1145/2935764.2935789
bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and
Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016},
pages={301–312} }'
chicago: Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer
auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.
ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 301–312.
mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
short: 'A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2016, pp. 301–312.'
date_created: 2020-04-01T12:46:35Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1145/2935764.2935789
language:
- iso: eng
page: 301-312
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: Asymptotically Optimal Gathering on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16360'
abstract:
- lang: eng
text: 'We consider the following variant of the two dimensional gathering problem
for swarms of robots: Given a swarm of n indistinguishable, point shaped robots
on a two dimensional grid. Initially, the robots form a closed chain on the grid
and must keep this connectivity during the whole process of their gathering. Connectivity
means, that neighboring robots of the chain need to be positioned at the same
or neighboring points of the grid. In our model, gathering means to keep shortening
the chain until the robots are located inside a 2*2 subgrid. Our model is completely
local (no global control, no global coordinates, no compass, no global communication
or vision, ...). Each robot can only see its next constant number of left and
right neighbors on the chain. This fixed constant is called the viewing path length.
All its operations and detections are restricted to this constant number of robots.
Other robots, even if located at neighboring or the same grid point cannot be
detected. Only based on the relative positions of its detectable chain neighbors,
a robot can decide to obtain a certain state. Based on this state and their local
knowledge, the robots do local modifications to the chain by moving to neighboring
grid points without breaking the chain. These modifications are performed without
the knowledge whether they lead to a global progress or not. We assume the fully
synchronous FSYNC model. For this problem, we present a gathering algorithm which
needs linear time. This result generalizes a result, where an open chain with
specified 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. In: Proceedings of the 30th International
Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699.
doi:10.1109/IPDPS.2016.51'
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings
of the 30th International Parallel and Distributed Processing Symposium (IPDPS)
(pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016,
title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51},
booktitle={Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr,
Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2016}, pages={689–699} }'
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.”
In Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.
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,” in Proceedings of the 30th
International Parallel and Distributed Processing Symposium (IPDPS), 2016,
pp. 689–699.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
Proceedings of the 30th International Parallel and Distributed Processing Symposium
(IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
short: 'S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
in: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), IEEE, 2016, pp. 689–699.'
date_created: 2020-04-01T12:56:43Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2016.51
language:
- iso: eng
page: 689-699
publication: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_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: '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: '452'
abstract:
- lang: eng
text: Today's networks, like the Internet, do not consist of one but a mixture of
several interconnected networks. Each has individual qualities and hence the performance
of a network node results from the networks' interplay.We introduce a new game
theoretic model capturing the interplay between a high-speed backbone network
and a low-speed general purpose network. In our model, n nodes are connected by
a static network and each node can decide individually to become a gateway node.
A gateway node pays a fixed price for its connection to the high-speed network,
but can utilize the high-speed network to gain communication distance 0 to all
other gateways. Communication distances in the low-speed network are given by
the hop distances. The effective communication distance between any two nodes
then is given by the shortest path, which is possibly improved by using gateways
as shortcuts.Every node v has the objective to minimize its communication costs,
given by the sum (SUM-game) or maximum (MAX-game) of the effective communication
distances from v to all other nodes plus a fixed price \alpha > 0, if it decides
to be a gateway. For both games and different ranges of \alpha, we study the existence
of equilibria, the price of anarchy, and convergence properties of best-response
dynamics.
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: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model
for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.'
apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief
Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).'
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }'
chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander
Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited
by Ron Lavi, 294. LNCS, 2014.'
ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement:
A Model for Multilevel Network Games,” in Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.'
mla: 'Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network
Games.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, p. 294.'
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p.
294.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:40Z
date_updated: 2018-03-16T11:24:40Z
file_id: '1343'
file_name: 452-title_multilevel-sagt.pdf
file_size: 84783
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:40Z
has_accepted_license: '1'
language:
- iso: eng
page: '294'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: 'Brief Announcement: A Model for Multilevel Network Games'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '395'
abstract:
- lang: eng
text: We consider a multilevel network game, where nodes can improvetheir communication
costs by connecting to a high-speed network.The n nodes are connected by a static
network and each node can decideindividually to become a gateway to the high-speed
network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game)
ormaximum (MAX-game) of communication distances from v to all othernodes plus
a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication
distance is 0, and gateways also improve othernodes’ distances by behaving as
shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is
Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1))
the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game,
weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1.
Given a graph with girth of at least 4α, equilibria always exist.Concerning the
dynamics, both games are not potential games. For theSUM-game, we even show that
it is not weakly acyclic.
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: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games.
In: Proceedings of the 10th International Conference on Web and Internet Economics
(WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36'
apa: Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Multilevel
Network Games. In Proceedings of the 10th International Conference on Web and
Internet Economics (WINE) (pp. 435–440). https://doi.org/10.1007/978-3-319-13129-0_36
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Multilevel Network Games}, DOI={10.1007/978-3-319-13129-0_36},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung,
Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik.
“Multilevel Network Games.” In Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
ieee: S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network
Games,” in Proceedings of the 10th International Conference on Web and Internet
Economics (WINE), 2014, pp. 435–440.
mla: Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014, pp.
435–440.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T06:59:59Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_36
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:59:20Z
date_updated: 2018-03-20T06:59:20Z
file_id: '1382'
file_name: 395-WINE2014ACJS.pdf
file_size: 161479
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:59:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-440
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Multilevel Network Games
type: conference
user_id: '15415'
year: '2014'
...