19 citations · 33 across the 13 of their papers we have counts for
4 papers · 1 filter
Efficiently Realizing Interval Sequences
Amotz Bar-Noy, Keerti Choudhary, David Peleg +1
We consider the problem of realizable interval-sequences. An interval sequence comprises of integer intervals such that , and is said t…
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
Amotz Bar-Noy, Keerti Choudhary, David Peleg +1
The classical problem of degree sequence realizability asks whether or not a given sequence of positive integers is equal to the degree sequence of some -vertex undirected s…
Hotelling Games with Random Tolerance Intervals
Avi Cohen, David Peleg
The classical Hotelling game is played on a line segment whose points represent uniformly distributed clients. The players of the game are servers who need to place themselves…
Hotelling Games with Multiple Line Faults
Avi Cohen, David Peleg
The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the…