5 citations · 9 across the 8 of their papers we have counts for
13 papers
de Finetti Lattices and Magog Triangles
Andrew Beveridge, Ian Calaway, Kristin Heysse
The order ideal of the Boolean lattice consists of all subsets of size at most . Let denote the poset refinement of induced by the rules: $i…
The Voter Basis and the Admissibility of Tree Characters
Andrew Beveridge, Ian Calaway
When making simultaneous decisions, our preference for the outcomes on one subset can depend on the outcomes on a disjoint subset. In referendum elections, this gives rise to the s…
Multi-robot Symmetric Rendezvous Search on the Line with an Unknown Initial Distance
Deniz Ozsoyeller
In this paper, we study the symmetric rendezvous search problem on the line with n > 2 robots that are unaware of their locations and the initial distances between them. In the sym…
Line-of-Sight Pursuit in Monotone and Scallop Polygons
Lindsay Berry, Andrew Beveridge, Jane Butterfield +4
We study a turn-based game in a simply connected polygonal environment between a pursuer and an adversarial evader . Both players can move in a straight line to any poin…
A Hitting Time Formula for the Discrete Green's Function
Andrew Beveridge
The discrete Green's function (without boundary) is a pseudo-inverse of the combinatorial Laplace operator of a graph . We reveal the intimate connection betw…
Two-Dimensional Pursuit-Evasion in a Compact Domain with Piecewise Analytic Boundary
Andrew Beveridge, Yiqing Cai
In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the gam…