154 citations · 438 across the 55 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.GT2013
Optimal Provision-After-Wait in Healthcare
Mark Braverman, Jing Chen, Sampath Kannan
We investigate computational and mechanism design aspects of scarce resource allocation, where the primary rationing mechanism is through waiting times. Specifically we consider al…
cs.DS2013★ 4 cited
Tight Bounds for Set Disjointness in the Message Passing Model
Mark Braverman, Faith Ellen, Rotem Oshman +2
In a multiparty message-passing model of communication, there are players. Each player has a private input, and they communicate by sending messages to one another over private…
cs.DS2013
Search using queries on indistinguishable items
Mark Braverman, Gal Oshri
We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer , and receive a respo…