15 citations · 16 across the 4 of their papers we have counts for
7 papers
Budgeted Dominating Sets in Uncertain Graphs
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy +2
We study the {\em Budgeted Dominating Set} (BDS) problem on uncertain graphs, namely, graphs with a probability distribution associated with the edges, such that an edge ex…
Simple Economies are Almost Optimal
Amir Ban, Avi Cohen, Shahar Dobzinski +1
Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit bidders to the aucti…
(Almost Full) EFX Exists for Four Agents (and Beyond)
Ben Berger, Avi Cohen, Michal Feldman +1
The existence of EFX allocations is a major open problem in fair division, even for additive valuations. The current state of the art is that no setting where EFX allocations are i…
Distributed Graph Realizations
John Augustine, Keerti Choudhary, Avi Cohen +3
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for repr…
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…