FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2511862451> ?p ?o ?g. }

• W2511862451 abstract "Communication is a powerful tool that enables the operation of a variety of old and new systems, such as mobile networks, trade, and human relationships to name a few. Such systems consist of many actors that, in one way or another, communicate with each other to reach a common goal. In this dissertation, we study two rather different examples of such multi-agent systems, namely, we explore the realm of recommendation algorithms and networks of primitive models of computation. In the case of recommendation algorithms, the agents are able to share their preferences on some items via a centralized entity that keeps track of the sharing history. The goal is to utilize the sharing history so that the agents can learn which items they could potentially like. In the case that the agents have many preferences in common, learning the preferences can be helpful in finding good items for the agents. However, if the agents do not have any preferences in common, it is hard to utilize the sharing information. With this in mind, we propose a new scheme for competitive analysis of recommendation algorithms, where we compare our online algorithms to offline algorithms, that have limited information about the input. In addition, we propose an online algorithm that finds a good item for every agent in the system that has, up to a polylogarithmic factor, an optimal competitive ratio in terms of our new scheme. In the second part of the dissertation, we focus on the Stone Age model of computation, where the agents are modeled by finite state machines. First, we study the computation of a maximal independent set (MIS) motived by observations from biology, where cells are known to solve this problem. We extend the study to arbitrary networks, where the nodes are subject to crash failures. We propose a distributed algorithm that is, on top of solving the MIS problem in the presence of failures, able to contain the effects of the failures from the nodes of the network that are not directly connected to the failed nodes. Second, we study the Ants Nearby Treasure Search (ANTS) problem in a similar model, where the agents are mobile. Our problem setting is motivated by the foraging behavior of real world ants and the goal of our agents is to locate a treasure hidden in an infinite grid. The agents are faced by two different challenges in the environment. One of the challenges is unexpected deaths (failures) of the agents, which require the agents to replace the dead agents to ensure that the treasure is eventually discovered. The other challenge considers obstructions, that is, the agents have to adapt to arbitrary obstacles in the environment. We show that by means of cooperation, the agents are able to deal with both challenges and only require a small overhead in the time complexity or in the number of agents required to solve the task." @default.
• W2511862451 created "2016-09-16" @default.
• W2511862451 creator A5064067007 @default.
• W2511862451 date "2015-01-01" @default.
• W2511862451 modified "2023-09-23" @default.
• W2511862451 title "Collaboration in Multi-Agent Systems: Adaptivity and Active Learning" @default.
• W2511862451 cites W1501097462 @default.
• W2511862451 cites W1509021917 @default.
• W2511862451 cites W1554813885 @default.
• W2511862451 cites W1557019699 @default.
• W2511862451 cites W1564744283 @default.
• W2511862451 cites W1568961751 @default.
• W2511862451 cites W1595409123 @default.
• W2511862451 cites W1605455774 @default.
• W2511862451 cites W1654156573 @default.
• W2511862451 cites W1844529830 @default.
• W2511862451 cites W1854885336 @default.
• W2511862451 cites W1884093760 @default.
• W2511862451 cites W1892691276 @default.
• W2511862451 cites W1964089073 @default.
• W2511862451 cites W1975394562 @default.
• W2511862451 cites W1978007997 @default.
• W2511862451 cites W1979173175 @default.
• W2511862451 cites W1982478013 @default.
• W2511862451 cites W1984448842 @default.
• W2511862451 cites W1984727163 @default.
• W2511862451 cites W1989793404 @default.
• W2511862451 cites W1989938746 @default.
• W2511862451 cites W1997216056 @default.
• W2511862451 cites W1997707549 @default.
• W2511862451 cites W1998643836 @default.
• W2511862451 cites W1999812311 @default.
• W2511862451 cites W2006786627 @default.
• W2511862451 cites W2008110774 @default.
• W2511862451 cites W2011039300 @default.
• W2511862451 cites W2017617294 @default.
• W2511862451 cites W2019729116 @default.
• W2511862451 cites W2023146810 @default.
• W2511862451 cites W2025624833 @default.
• W2511862451 cites W2026501144 @default.
• W2511862451 cites W2029568832 @default.
• W2511862451 cites W2031556125 @default.
• W2511862451 cites W2036425745 @default.
• W2511862451 cites W2051006450 @default.
• W2511862451 cites W2052474723 @default.
• W2511862451 cites W2053831174 @default.
• W2511862451 cites W2054910423 @default.
• W2511862451 cites W2061084197 @default.
• W2511862451 cites W2067661972 @default.
• W2511862451 cites W2075340384 @default.
• W2511862451 cites W2077339343 @default.
• W2511862451 cites W2077944048 @default.
• W2511862451 cites W2081254453 @default.
• W2511862451 cites W2086958729 @default.
• W2511862451 cites W2100061495 @default.
• W2511862451 cites W2102334337 @default.
• W2511862451 cites W2108704847 @default.
• W2511862451 cites W2117692326 @default.
• W2511862451 cites W2119075501 @default.
• W2511862451 cites W2121523192 @default.
• W2511862451 cites W2122230781 @default.
• W2511862451 cites W2122313242 @default.
• W2511862451 cites W2126550620 @default.
• W2511862451 cites W2134331592 @default.
• W2511862451 cites W2141074723 @default.
• W2511862451 cites W2148190105 @default.
• W2511862451 cites W2149735608 @default.
• W2511862451 cites W2149888497 @default.
• W2511862451 cites W2154368141 @default.
• W2511862451 cites W2156184725 @default.
• W2511862451 cites W2158711252 @default.
• W2511862451 cites W2162438988 @default.
• W2511862451 cites W2163662782 @default.
• W2511862451 cites W2165441947 @default.
• W2511862451 cites W2167825792 @default.
• W2511862451 cites W2177283464 @default.
• W2511862451 cites W2401610261 @default.
• W2511862451 cites W2568091325 @default.
• W2511862451 cites W2706788079 @default.
• W2511862451 cites W2914876264 @default.
• W2511862451 cites W2953271509 @default.
• W2511862451 cites W2962795549 @default.
• W2511862451 cites W3149604617 @default.
• W2511862451 cites W324003786 @default.
• W2511862451 cites W2002252750 @default.
• W2511862451 doi "https://doi.org/10.3929/ethz-a-010513480" @default.
• W2511862451 hasPublicationYear "2015" @default.
• W2511862451 type Work @default.
• W2511862451 sameAs 2511862451 @default.
• W2511862451 citedByCount "0" @default.
• W2511862451 crossrefType "journal-article" @default.
• W2511862451 hasAuthorship W2511862451A5064067007 @default.
• W2511862451 hasConcept C102408133 @default.
• W2511862451 hasConcept C119857082 @default.
• W2511862451 hasConcept C120665830 @default.
• W2511862451 hasConcept C121332964 @default.
• W2511862451 hasConcept C134306372 @default.
• W2511862451 hasConcept C136197465 @default.
• W2511862451 hasConcept C154945302 @default.
• W2511862451 hasConcept C17744445 @default.

• next