Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Randomized strategy"'
Autor:
Pratap Tokekar, Deniz Ozsoyeller
We study the Symmetric Rendezvous Search Problem for a multi-robot system. There are $n>2$ robots arbitrarily located on a line. Their goal is to meet somewhere on the line as quickly as possible. The robots do not know the initial location of any of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a911055ef905ab5180888d386546996d
Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem
Autor:
Davood Shiri, F. Sibel Salman
Publikováno v:
Journal of Combinatorial Optimization. 37:848-865
In this article, we study randomized online strategies for the multi-agent k-Canadian Traveler Problem which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agent
Publikováno v:
Scopus-Elsevier
The following game is played on a weighted graph: Alice selects a matching M and Bob selects a number k. Alice’s payoff is the ratio of the weight of the k heaviest edges of M to the maximum weight of a matching of size at most k. If M guarantees a
Publikováno v:
ACM SIGMETRICS Performance Evaluation Review. 48:89-90
We consider caching networks in which the routing cost for serving a content request can be reduced by caching the requested content item in cache nodes closer to the users. We refer to the cost reduction enabled by caching as the caching gain, and t
Autor:
Souvik Roy, Soumyarup Sadhukhan
Publikováno v:
Journal of Economic Theory. 197:105131
This paper presents a unified characterization of the unanimous and strategy-proof random rules on a class of domains that are based on some prior ordering over the alternatives. It identifies a condition called top-richness so that, if a domain sati
Autor:
Kenjiro Takazawa, Yusuke Kobayashi
Publikováno v:
ANALCO
We consider the following zero-sum game related to the knapsack problem. Given an instance of the knapsack problem, Alice chooses a knapsack solution and Bob, knowing Alice's solution, chooses a cardinality k. Then, Alice obtains a payoff equal to th
Publikováno v:
Random Structures & Algorithms. 49:742-765
In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
CIÊNCIAVITAE
SIAM Journal on Control and Optimization
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
SIAM Journal on Control and Optimization
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Submitted by Alexandre Plakhov (plakhov@ua.pt) on 2019-05-22T16:26:07Z No. of bitstreams: 1 impF.pdf: 540535 bytes, checksum: de7f73e37b75f5672a61b7bd0692cd94 (MD5) Approved for entry into archive by Diana Silva (dianasilva@ua.pt) on 2019-05-23T15:08
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::477dcc1f16acd918a7f40a955bc79815
http://arxiv.org/abs/1802.09809
http://arxiv.org/abs/1802.09809
Publikováno v:
CDC
2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
Signalling of information is made feasible from one controller to another controller, in a networked control system consisting of two interconnected control systems. In this application, controller 2 of control system 2 (CS-2) has access to feedback