11 citations · 12 across the 3 of their papers we have counts for
3 papers
Online Combinatorial Allocation with Interdependent Values
Michal Feldman, Simon Mauras, Divyarthi Mohan +1
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each a…
Fair Division via Quantile Shares
Yakov Babichenko, Michal Feldman, Ron Holzman +1
We consider the problem of fair division, where a set of indivisible goods should be distributed fairly among a set of agents with combinatorial valuations. To capture fairness, we…
Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks
Michal Feldman, Nicole Immorlica, Brendan Lucier +1
We study the outcomes of information aggregation in online social networks. Our main result is that networks with certain realistic structural properties avoid information cascades…