Online knapsack problem and budgeted truthful bipartite matching

Rahul Vaze. Online knapsack problem and budgeted truthful bipartite matching. In 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, May 1-4, 2017. pages 1-9, IEEE, 2017. [doi]

Authors

Rahul Vaze

This author has not been identified. Look up 'Rahul Vaze' in Google