Paper from our lab has been accepted for presentation at the International Joint Conference on Artificial Intelligence (IJCAI-21)

The paper by Artem Baklanov and his co-authors has been accepted by one of the top CS conferences.

We are delighted to inform you that a paper from our lab has been accepted for presentation at IJCAI-21.

Artem Baklanov together with Pranav Garimidi, Vasilis Gkatzelis, and Daniel Schoepflin from The Drexel Economics and Computation (EconCS) research group (USA) study the problem of fairly allocating indivisible goods. For the problem of indivisible goods allocation, they relax the classic fairness notion by introducing the notion of proportionality up to the maximin item (PROPm) and show how to reach an allocation satisfying this notion for any number of agents with additive valuations using the proposed algorithm with the running time that is polynomial in both the number of agents and the number of goods.
The paper is available at https://arxiv.org/abs/2105.11348

A new ranking of CS conferences puts IJCAI at #14 out of more than a thousand venues, based on two impact metrics, h5-index and impact score. This year the conference received 4204 full-paper submissions, 587 papers were accepted (13.9% acceptance rate).