• Fair Division with Minimal Sharing

Fedor Sandomirskiy and Erel Segal-Halevi

• Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division

Elad Aigner-Horev and Erel Segal-Halevi

• Envy-freeness up to any item with high Nash welfare: The virtue of donating items

Ioannis Caragiannis, Nikolai Gravin and Xin Huang

• On Maximin Share Allocations on Cycles

Zbigniew Lonc and Miroslaw Truszczynski

• Efficient candidate screening under multiple tests and implications for statistical discrimination

Lee Cohen, Yishay Mansour and Zachary C. Lipton

• Approximate Counting of Semi-Fair Allocations via #Knapsack Computations

Theofilos Triommatis and Aris Pagourtzis