---
_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'
...
---
_id: '20129'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Hiroki
full_name: Sayama, Hiroki
last_name: Sayama
- first_name: John
full_name: Rieffel, John
last_name: Rieffel
- first_name: Sebastian
full_name: Risi, Sebastian
last_name: Risi
- first_name: Rene
full_name: Doursat, Rene
last_name: Doursat
- first_name: Hod
full_name: Lipson, Hod
last_name: Lipson
citation:
ama: 'Hamann H, Sayama H, Rieffel J, Risi S, Doursat R, Lipson H. Evolution of Collective
Behaviors by Minimizing Surprise. In: 14th Int. Conf. on the Synthesis and
Simulation of Living Systems (ALIFE 2014). MIT Press; 2014:344-351. doi:10.7551/978-0-262-32621-6-ch055'
apa: Hamann, H., Sayama, H., Rieffel, J., Risi, S., Doursat, R., & Lipson, H.
(2014). Evolution of Collective Behaviors by Minimizing Surprise. In 14th Int.
Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014) (pp.
344–351). MIT Press. https://doi.org/10.7551/978-0-262-32621-6-ch055
bibtex: '@inproceedings{Hamann_Sayama_Rieffel_Risi_Doursat_Lipson_2014, title={Evolution
of Collective Behaviors by Minimizing Surprise}, DOI={10.7551/978-0-262-32621-6-ch055},
booktitle={14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE
2014)}, publisher={MIT Press}, author={Hamann, Heiko and Sayama, Hiroki and Rieffel,
John and Risi, Sebastian and Doursat, Rene and Lipson, Hod}, year={2014}, pages={344–351}
}'
chicago: Hamann, Heiko, Hiroki Sayama, John Rieffel, Sebastian Risi, Rene Doursat,
and Hod Lipson. “Evolution of Collective Behaviors by Minimizing Surprise.” In
14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014),
344–51. MIT Press, 2014. https://doi.org/10.7551/978-0-262-32621-6-ch055.
ieee: H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, and H. Lipson, “Evolution
of Collective Behaviors by Minimizing Surprise,” in 14th Int. Conf. on the
Synthesis and Simulation of Living Systems (ALIFE 2014), 2014, pp. 344–351.
mla: Hamann, Heiko, et al. “Evolution of Collective Behaviors by Minimizing Surprise.”
14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014),
MIT Press, 2014, pp. 344–51, doi:10.7551/978-0-262-32621-6-ch055.
short: 'H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, H. Lipson, in: 14th
Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), MIT
Press, 2014, pp. 344–351.'
date_created: 2020-10-20T09:02:49Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.7551/978-0-262-32621-6-ch055
language:
- iso: eng
page: 344-351
publication: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE
2014)
publisher: MIT Press
status: public
title: Evolution of Collective Behaviors by Minimizing Surprise
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '20130'
author:
- first_name: Enric
full_name: Cervera, Enric
last_name: Cervera
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Mauro
full_name: Birattari, Mauro
last_name: Birattari
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Angel P. del
full_name: Pobil, Angel P. del
last_name: Pobil
- first_name: Eris
full_name: Chinellato, Eris
last_name: Chinellato
- first_name: Ester
full_name: Martinez-Martin, Ester
last_name: Martinez-Martin
- first_name: John
full_name: Hallam, John
last_name: Hallam
- first_name: Antonio
full_name: Morales, Antonio
last_name: Morales
citation:
ama: 'Cervera E, Khaluf Y, Birattari M, et al. A Swarm Robotics Approach to Task
Allocation Under Soft Deadlines and Negligible Switching Costs. In: Simulation
of Adaptive Behavior (SAB 2014). Vol 8575. ; 2014:270-279. doi:10.1007/978-3-319-08864-8_26'
apa: Cervera, E., Khaluf, Y., Birattari, M., Hamann, H., Pobil, A. P. del, Chinellato,
E., … Morales, A. (2014). A Swarm Robotics Approach to Task Allocation Under Soft
Deadlines and Negligible Switching Costs. In Simulation of Adaptive Behavior
(SAB 2014) (Vol. 8575, pp. 270–279). https://doi.org/10.1007/978-3-319-08864-8_26
bibtex: '@inproceedings{Cervera_Khaluf_Birattari_Hamann_Pobil_Chinellato_Martinez-Martin_Hallam_Morales_2014,
title={A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs}, volume={8575}, DOI={10.1007/978-3-319-08864-8_26},
booktitle={Simulation of Adaptive Behavior (SAB 2014)}, author={Cervera, Enric
and Khaluf, Yara and Birattari, Mauro and Hamann, Heiko and Pobil, Angel P. del
and Chinellato, Eris and Martinez-Martin, Ester and Hallam, John and Morales,
Antonio}, year={2014}, pages={270–279} }'
chicago: Cervera, Enric, Yara Khaluf, Mauro Birattari, Heiko Hamann, Angel P. del
Pobil, Eris Chinellato, Ester Martinez-Martin, John Hallam, and Antonio Morales.
“A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs.” In Simulation of Adaptive Behavior (SAB 2014), 8575:270–79,
2014. https://doi.org/10.1007/978-3-319-08864-8_26.
ieee: E. Cervera et al., “A Swarm Robotics Approach to Task Allocation Under
Soft Deadlines and Negligible Switching Costs,” in Simulation of Adaptive Behavior
(SAB 2014), 2014, vol. 8575, pp. 270–279.
mla: Cervera, Enric, et al. “A Swarm Robotics Approach to Task Allocation Under
Soft Deadlines and Negligible Switching Costs.” Simulation of Adaptive Behavior
(SAB 2014), vol. 8575, 2014, pp. 270–79, doi:10.1007/978-3-319-08864-8_26.
short: 'E. Cervera, Y. Khaluf, M. Birattari, H. Hamann, A.P. del Pobil, E. Chinellato,
E. Martinez-Martin, J. Hallam, A. Morales, in: Simulation of Adaptive Behavior
(SAB 2014), 2014, pp. 270–279.'
date_created: 2020-10-20T09:09:59Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-319-08864-8_26
intvolume: ' 8575'
language:
- iso: eng
page: 270-279
publication: Simulation of Adaptive Behavior (SAB 2014)
status: public
title: A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible
Switching Costs
type: conference
user_id: '15415'
volume: 8575
year: '2014'
...
---
_id: '368'
abstract:
- lang: eng
text: We consider the problem of scheduling a number of jobs on $m$ identical processors
sharing a continuously divisible resource. Each job j comes with a resource requirement
r_j \in {0,1}. The job can be processed at full speed if granted its full resource
requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
of the full speed. Our goal is to find a resource assignment that minimizes the
makespan (i.e., the latest completion time). Variants of such problems, relating
the resource assignment of jobs to their \emph{processing speeds}, have been studied
under the term discrete-continuous scheduling. Known results are either very pessimistic
or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
model. It focuses on the assignment of shared continuous resources to the processors.
The job assignment to processors and the ordering of the jobs have already been
fixed. It is shown that, even for unit size jobs, finding an optimal solution
is NP-hard if the number of processors is part of the input. Positive results
for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
of processors. Such schedules are computed by our GreedyBalance algorithm, for
which the bound is tight.
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- 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
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: 'Tim '
full_name: 'Suess, Tim '
last_name: Suess
citation:
ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
Scheduling Shared Continuous Resources on Many-Cores. In: Proceedings of the
26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2014:128-137. doi:10.1145/2612669.2612698'
apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
& Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–137. https://doi.org/10.1145/2612669.2612698
bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={10.1145/2612669.2612698},
booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
year={2014}, pages={128–137} }'
chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
Sören Riechers, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–37, 2014. https://doi.org/10.1145/2612669.2612698.
ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in Proceedings
of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2014, pp. 128–137, doi: 10.1145/2612669.2612698.'
mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:38Z
date_updated: 2018-03-20T07:17:38Z
file_id: '1403'
file_name: 368-BKMNRS14.pdf
file_size: 485767
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '370'
abstract:
- lang: eng
text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
bandwidth to each of the users in a network. This allocation can be computed by
uniformly raising the bandwidths of all users without violating capacity constraints.
We consider an extension of these allocations by raising the bandwidth with arbitrary
and not necessarily uniform time-depending velocities (allocation rates). These
allocations are used in a game-theoretic context for routing choices, which we
formalize in progressive filling games (PFGs).We present a variety of results
for equilibria in PFGs. We show that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard, there are polynomial-time
algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
when all users have the same source-destination pair. We characterize prices of
anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination pairs. In addition, we show
that when a designer can adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on polynomial-time algorithms
in this direction are also derived. '
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
In: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571'
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games
with Progressive Filling. In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
with Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
Filling,” in Proceedings of the 33rd Annual IEEE International Conference on
Computer Communications (INFOCOM’14), 2014, pp. 352–360.
mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:04Z
date_updated: 2018-03-20T07:17:04Z
file_id: '1402'
file_name: 370-HHSS14.pdf
file_size: 179583
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
full_name: Pahl, David
last_name: Pahl
citation:
ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität
Paderborn; 2014.
apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn.
bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- 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
citation:
ama: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
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 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
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 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '17659'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Mathijs M.
full_name: de Weerdt, Mathijs M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games.
In: Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for
Autonomous Agents and Multiagent Systems; 2014:861-868.'
apa: 'Polevoy, G., Trajanovski, S., & de Weerdt, M. M. (2014). Nash Equilibria
in Shared Effort Games. In Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-agent Systems (pp. 861–868). Richland, SC:
International Foundation for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_Trajanovski_de Weerdt_2014, place={Richland, SC},
series={AAMAS ’14}, title={Nash Equilibria in Shared Effort Games}, booktitle={Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
publisher={International Foundation for Autonomous Agents and Multiagent Systems},
author={Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.}, year={2014},
pages={861–868}, collection={AAMAS ’14} }'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, and Mathijs M. de Weerdt. “Nash Equilibria
in Shared Effort Games.” In Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-Agent Systems, 861–68. AAMAS ’14. Richland,
SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.'
ieee: G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared
Effort Games,” in Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-agent Systems, 2014, pp. 861–868.
mla: Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp.
861–68.
short: 'G. Polevoy, S. Trajanovski, M.M. de Weerdt, in: Proceedings of the 2014
International Conference on Autonomous Agents and Multi-Agent Systems, International
Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp.
861–868.'
date_created: 2020-08-06T15:21:26Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- competition
- equilibrium
- market
- models
- shared effort games
- simulation
language:
- iso: eng
page: 861-868
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Nash Equilibria in Shared Effort Games
type: conference
user_id: '83983'
year: '2014'
...
---
_id: '17660'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs M.
full_name: de Weerdt, Mathijs M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In:
Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent
Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous
Agents and Multiagent Systems; 2014:1741-1742.'
apa: 'Polevoy, G., & de Weerdt, M. M. (2014). Improving Human Interaction in
Crowdsensing. In Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-agent Systems (pp. 1741–1742). Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_de Weerdt_2014, place={Richland, SC}, series={AAMAS
’14}, title={Improving Human Interaction in Crowdsensing}, booktitle={Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems},
publisher={International Foundation for Autonomous Agents and Multiagent Systems},
author={Polevoy, Gleb and de Weerdt, Mathijs M.}, year={2014}, pages={1741–1742},
collection={AAMAS ’14} }'
chicago: 'Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction
in Crowdsensing.” In Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-Agent Systems, 1741–42. AAMAS ’14. Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems, 2014.'
ieee: G. Polevoy and M. M. de Weerdt, “Improving Human Interaction in Crowdsensing,”
in Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-agent Systems, 2014, pp. 1741–1742.
mla: Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.”
Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent
Systems, International Foundation for Autonomous Agents and Multiagent Systems,
2014, pp. 1741–42.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 2014 International Conference
on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous
Agents and Multiagent Systems, Richland, SC, 2014, pp. 1741–1742.'
date_created: 2020-08-06T15:21:35Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- dynamics
- emotion modeling
- negotiation
- network interaction
- shared effort game
language:
- iso: eng
page: 1741-1742
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Improving Human Interaction in Crowdsensing
type: conference
user_id: '83983'
year: '2014'
...
---
_id: '17661'
author:
- first_name: Thomas C.
full_name: King, Thomas C.
last_name: King
- first_name: Qingzhi
full_name: Liu, Qingzhi
last_name: Liu
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs
full_name: de Weerdt, Mathijs
last_name: de Weerdt
- first_name: Virginia
full_name: Dignum, Virginia
last_name: Dignum
- first_name: M. Birna
full_name: van Riemsdijk, M. Birna
last_name: van Riemsdijk
- first_name: Martijn
full_name: Warnier, Martijn
last_name: Warnier
citation:
ama: 'King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems.
AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent
Systems; 2014:1651-1652.'
apa: 'King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk,
M. B., & Warnier, M. (2014). Request Driven Social Sensing. In Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems
(pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents
and Multiagent Systems.'
bibtex: '@inproceedings{King_Liu_Polevoy_de Weerdt_Dignum_van Riemsdijk_Warnier_2014,
place={Richland, SC}, series={AAMAS ’14}, title={Request Driven Social Sensing},
booktitle={Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents
and Multiagent Systems}, author={King, Thomas C. and Liu, Qingzhi and Polevoy,
Gleb and de Weerdt, Mathijs and Dignum, Virginia and van Riemsdijk, M. Birna and
Warnier, Martijn}, year={2014}, pages={1651–1652}, collection={AAMAS ’14} }'
chicago: 'King, Thomas C., Qingzhi Liu, Gleb Polevoy, Mathijs de Weerdt, Virginia
Dignum, M. Birna van Riemsdijk, and Martijn Warnier. “Request Driven Social Sensing.”
In Proceedings of the 2014 International Conference on Autonomous Agents and
Multi-Agent Systems, 1651–52. AAMAS ’14. Richland, SC: International Foundation
for Autonomous Agents and Multiagent Systems, 2014.'
ieee: T. C. King et al., “Request Driven Social Sensing,” in Proceedings
of the 2014 International Conference on Autonomous Agents and Multi-agent Systems,
2014, pp. 1651–1652.
mla: King, Thomas C., et al. “Request Driven Social Sensing.” Proceedings of
the 2014 International Conference on Autonomous Agents and Multi-Agent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp.
1651–52.
short: 'T.C. King, Q. Liu, G. Polevoy, M. de Weerdt, V. Dignum, M.B. van Riemsdijk,
M. Warnier, in: Proceedings of the 2014 International Conference on Autonomous
Agents and Multi-Agent Systems, International Foundation for Autonomous Agents
and Multiagent Systems, Richland, SC, 2014, pp. 1651–1652.'
date_created: 2020-08-06T15:21:45Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- crowd-sensing
- crowdsourcing
- data aggregation
- game theory
- norms
- reciprocation
- self interested agents
- simulation
language:
- iso: eng
page: 1651-1652
place: Richland, SC
publication: Proceedings of the 2014 International Conference on Autonomous Agents
and Multi-agent Systems
publication_identifier:
isbn:
- 978-1-4503-2738-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '14
status: public
title: Request Driven Social Sensing
type: conference
user_id: '83983'
year: '2014'
...