215 citations · 689 across the 60 of their papers we have counts for
3 papers · 1 filter
Efficient Distributed Random Walks with Applications
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan +1
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtai…
Stackelberg Pricing is Hard to Approximate within
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Stackelberg Pricing Games is a two-level combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider th…
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Patrick Briest, Sanjeev Khanna
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may…