Up a level |
Barman, Siddharth and Krishnamurthy, Sanath Kumar and Vaish, Rohit (2018) Greedy Algorithms for Maximizing Nash Social Welfare. In: 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018, 10 July 2018, Sweden, pp. 7-13.
Barman, Siddharth (2018) APPROXIMATING NASH EQUILIBRIA AND DENSE SUBGRAPHS VIA AN APPROXIMATE VERSION OF CARATHEODORY'S THEOREM. In: SIAM JOURNAL ON COMPUTING, 47 (3). pp. 960-981.
Barman, Siddharth and Fawzi, Omar (2018) Algorithmic Aspects of Optimal Channel Coding. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (2). pp. 1038-1045.