Achieving Proportional Representation in Conference Programs
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 144-149.
Abstract
We study the optimization problem of designing the program of a conference with parallel sessions, so that the intended participants are as happy as possible from the talks they can attend. Interestingly, this can be thought of as a two-dimensional extension of a scheme proposed by Chamberlin and Courant [1983] for achieving proportional representation in multi-winner elections. We show that different variations of the problem are computationally hard by exploiting relations of the problem with well-known hard graph problems. On the positive side, we present polynomial-time algorithms that compute conference programs that have a social utility that is provably close to the optimal one (within constant factors). Our algorithms are either combinatorial or based on linear programming and randomized rounding.
@inproceedings{ijcai2016p28,
title = {Achieving Proportional Representation in Conference Programs},
author = {Caragiannis, Ioannis and Gourvès, Laurent and Monnot, Jérôme},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {144--149},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/28},
}
TY - CPAPER TI - Achieving Proportional Representation in Conference Programs AU - Caragiannis, Ioannis AU - Gourvès, Laurent AU - Monnot, Jérôme T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 144 EP - 149 UR - https://ijcai.org/proceedings/2016/28 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
