Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Steve Alpern"'
Publikováno v:
Operations Research. 70:129-140
Patrolling games were introduced by Alpern, Morton, and Papadaki in 2011 to model the adversarial problem where a mobile Patroller can thwart an attack at some location only by visiting it during the attack period, which has a prescribed integer dura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d68cf2c52d08dc09f2fe8ec5c01552e
https://doi.org/10.1287/opre.2021.2152
https://doi.org/10.1287/opre.2021.2152
We consider a new type of asymmetric rendezvous search problem in which player II needs to give player I a ‘gift’ which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cb45d909ddb872f31250b6fb5b18854
http://wrap.warwick.ac.uk/152722/7/WRAP-search-rescue-rendezvous-Alpern-2021.pdf
http://wrap.warwick.ac.uk/152722/7/WRAP-search-rescue-rendezvous-Alpern-2021.pdf
Autor:
Steve Alpern, V. S. Prasad
This 2000 book provides a self-contained introduction to typical properties of homeomorphisms. Examples of properties of homeomorphisms considered include transitivity, chaos and ergodicity. A key idea here is the interrelation between typical proper
Publikováno v:
Aequationes mathematicae. 95:67-74
Consider an odd-sized jury, which determines a majority verdict between two equiprobable states of Nature. If each juror independently receives a binary signal identifying the correct state with identical probability p, then the probability of a corr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b699e6373224541b1431bb34a53c3c0
https://doi.org/10.1007/s00010-020-00750-1
https://doi.org/10.1007/s00010-020-00750-1
Autor:
Pierre Leone, Steve Alpern
In this paper we solve the rendezvous problem on the line with markers that can be dropped at chosen times when the initial distance D between the players is known. In the case of one marker, the $$M_1$$ M 1 game, the marker is held by player II at t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::291b2e962038e03941198d33729fdaca
http://wrap.warwick.ac.uk/161703/7/WRAP-symbolic-programming-approach-rendezvous-search-problem-Alpern-2022.pdf
http://wrap.warwick.ac.uk/161703/7/WRAP-symbolic-programming-approach-rendezvous-search-problem-Alpern-2022.pdf
Continuous Patrolling Sometimes it is necessary to have a Patroller (on foot, in a car, or maybe a drone) move around a network so as to prevent an intruder (the Attacker) from infiltrating or otherwise ruining the network operation. The “attack”
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ef0fbdcaef7e73257b0e091da114f31
http://wrap.warwick.ac.uk/166010/14/WRAP-Continuous-patrolling-games-2022.pdf
http://wrap.warwick.ac.uk/166010/14/WRAP-Continuous-patrolling-games-2022.pdf
Autor:
Steve Alpern, Li Zeng
Publikováno v:
Dynamic Games and Applications
During epidemics, the population is asked to socially distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common aim is to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8efc4ade8d52e8366f5a49a3f46415e
http://arxiv.org/abs/2111.05958
http://arxiv.org/abs/2111.05958
Publikováno v:
SSRN Electronic Journal.
The celebrated Jury Theorem of Condorcet (1785) considered an odd size jury in which jurors vote simultaneously after receiving independent signals, correct with the same probability p > 1/2, concerning which of two binary possibilities (maybe innoce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a852b06d49fe8f60301641aa04ebeb5b
https://doi.org/10.2139/ssrn.3761745
https://doi.org/10.2139/ssrn.3761745
Autor:
Steve Alpern, Viciano Lee
Publikováno v:
Annals of the International Society of Dynamic Games ISBN: 9783030565336
Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any k of thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1731f0f4d91bff936192427739295559
http://wrap.warwick.ac.uk/141370/1/WRAP-Game-model-search-pursuit-Alpern-2020.pdf
http://wrap.warwick.ac.uk/141370/1/WRAP-Game-model-search-pursuit-Alpern-2020.pdf
Autor:
Bo Chen, Steve Alpern
We consider an odd-sized "jury", which votes sequentially between two states of Nature (say A and B, or Innocent and Guilty) with the majority opinion determining the verdict. Jurors have private information in the form of a signal in [-1,+1], with h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce1903fc65635b274d0299637f586217