12 citations · 53 across the 19 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.GT2017★ 11 cited
Groupwise Maximin Fair Allocation of Indivisible Goods
Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy +1
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fair…
cs.LG2017
Online Learning for Structured Loss Spaces
Siddharth Barman, Aditya Gopalan, Aadirupa Saha
We consider prediction with expert advice when the loss vectors are assumed to lie in a set described by the sum of atomic norm balls. We derive a regret bound for a general versio…