%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/

%% Created for Xiaohui Bei at 2019-09-04 17:46:42 +0800


%% Saved with string encoding Unicode (UTF-8)

@inproceedings{menon2018robust,
  title={Robust and approximately stable marriages under partial information},
  author={Menon, Vijay and Larson, Kate},
  booktitle={International Conference on Web and Internet Economics},
  pages={341--355},
  year={2018},
  organization={Springer}
}

@article{aziz2017stable,
  title={Stable matching with uncertain pairwise preferences},
  author={Aziz, Haris and Bir{\'o}, P{\'e}ter and Fleiner, Tam{\'a}s and Gaspers, Serge and Haan, Ronald de},
  year={2017}
}

@article{aziz2019efficient,
  title={Efficient reallocation under additive and responsive preferences},
  author={Aziz, Haris and Biro, Peter and Lang, J{\'e}r{\^o}me and Lesca, Julien and Monnot, J{\'e}r{\^o}me},
  journal={Theoretical Computer Science},
  volume={790},
  pages={1--15},
  year={2019},
  publisher={Elsevier}
}

@article{segal2020fair,
  title={Fair Allocation with Diminishing Differences},
  author={Segal-Halevi, Erel and Hassidim, Avinatan and Aziz, Haris},
  journal={Journal of Artificial Intelligence Research},
  volume={67},
  pages={471--507},
  year={2020}
}

@incollection{hall2009representatives,
  title={On representatives of subsets},
  author={Hall, Philip},
  booktitle={Classic Papers in Combinatorics},
  pages={58--62},
  year={2009},
  publisher={Springer}
}

@inproceedings{lipton2004approximately,
  title={On approximately fair allocations of indivisible goods},
  author={Lipton, Richard J and Markakis, Evangelos and Mossel, Elchanan and Saberi, Amin},
  booktitle={Proceedings of the 5th ACM conference on Electronic commerce},
  pages={125--131},
  year={2004},
  organization={ACM}
}

@inproceedings{brams2012maxsum,
  title={On maxsum fair cake divisions},
  author={Brams, Steven J and Feldman, Michal and Lai, John K and Morgenstern, Jamie and Procaccia, Ariel D},
  booktitle={Twenty-sixth AAAI Conference on Artificial Intelligence},
  year={2012}
}

@article{bouveret2008efficiency,
  title={Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity},
  author={Bouveret, Sylvain and Lang, J{\'e}r{\^o}me},
  journal={Journal of Artificial Intelligence Research},
  volume={32},
  pages={525--564},
  year={2008}
}

@article{bezakova2005allocating,
  title={Allocating indivisible goods},
  author={Bez{\'a}kov{\'a}, Ivona and Dani, Varsha},
  journal={ACM SIGecom Exchanges},
  volume={5},
  number={3},
  pages={11--18},
  year={2005},
  publisher={ACM}
}

@inproceedings{mattei2013preflib,
	Author = {Mattei, Nicholas and Walsh, Toby},
	Booktitle = {International Conference on Algorithmic DecisionTheory},
	Date-Added = {2019-09-04 17:46:39 +0800},
	Date-Modified = {2019-09-04 17:46:39 +0800},
	Organization = {Springer},
	Pages = {259--270},
	Title = {Preflib: A library for preferences http://www. preflib. org},
	Year = {2013}}

@book{david2013algorithmics,
	Author = {David, Manlove},
	Date-Added = {2019-08-29 17:48:47 +0800},
	Date-Modified = {2019-08-29 17:48:47 +0800},
	Publisher = {World Scientific},
	Title = {Algorithmics of matching under preferences},
	Volume = {2},
	Year = {2013}}

@article{gardenfors1973assignment,
	Author = {Gardenfors, Peter},
	Date-Added = {2019-08-29 17:48:12 +0800},
	Date-Modified = {2019-08-29 17:48:12 +0800},
	Journal = {Management Science},
	Number = {3},
	Pages = {331--340},
	Publisher = {INFORMS},
	Title = {Assignment problem based on ordinal preferences},
	Volume = {20},
	Year = {1973}}

@article{demko1988equitable,
	Author = {Demko, Stephen and Hill, Theodore P},
	Date-Added = {2019-08-29 17:47:28 +0800},
	Date-Modified = {2019-08-29 17:47:28 +0800},
	Journal = {Mathematical Social Sciences},
	Number = {2},
	Pages = {145--158},
	Publisher = {Elsevier},
	Title = {Equitable distribution of indivisible objects},
	Volume = {16},
	Year = {1988}}

@article{hylland1979efficient,
	Author = {Hylland, Aanund and Zeckhauser, Richard},
	Date-Added = {2019-08-29 15:09:32 +0800},
	Date-Modified = {2019-08-29 15:09:32 +0800},
	Journal = {Journal of Political economy},
	Number = {2},
	Pages = {293--314},
	Publisher = {The University of Chicago Press},
	Title = {The efficient allocation of individuals to positions},
	Volume = {87},
	Year = {1979}}

@article{abdulkadiroglu1998random,
	Author = {Abdulkadiroglu, Atila and Sonmez, Tayfun},
	Date-Added = {2019-08-29 15:08:55 +0800},
	Date-Modified = {2019-08-29 15:08:55 +0800},
	Journal = {Econometrica},
	Number = {3},
	Pages = {689},
	Publisher = {Blackwell Publishing Ltd.},
	Title = {Random serial dictatorship and the core from random endowments in house allocation problems},
	Volume = {66},
	Year = {1998}}

@book{moulin2004fair,
	Author = {Moulin, Herv{\'e}},
	Date-Added = {2019-08-29 15:04:39 +0800},
	Date-Modified = {2019-08-29 15:04:39 +0800},
	Publisher = {MIT press},
	Title = {Fair division and collective welfare},
	Year = {2004}}

@article{brams1996procedure,
	Author = {Brams, Steven J and Taylor, Alan D},
	Date-Added = {2019-08-29 15:03:34 +0800},
	Date-Modified = {2019-08-29 15:03:34 +0800},
	Journal = {Mediation Quarterly},
	Number = {3},
	Pages = {191--205},
	Publisher = {Wiley Online Library},
	Title = {A procedure for divorce settlements},
	Volume = {13},
	Year = {1996}}

@inproceedings{aziz2019pareto,
	Author = {Aziz, Haris and Biro, Peter and de Haan, Ronald and Rastegari, Baharak},
	Booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
	Pages = {1740--1747},
	Title = {Pareto optimal allocation under compact uncertain preferences},
	Volume = {33},
	Year = {2019}}

@inproceedings{aziz2017pareto,
	Author = {Aziz, Haris and De Haan, Ronald and Rastegari, Baharak},
	Booktitle = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems},
	Organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	Pages = {1472--1474},
	Title = {Pareto optimal allocation under uncertain preferences},
	Year = {2017}}

@inproceedings{aziz2016stable,
	Author = {Aziz, Haris and Bir{\'o}, P{\'e}ter and Gaspers, Serge and De Haan, Ronald and Mattei, Nicholas and Rastegari, Baharak},
	Booktitle = {International Symposium on Algorithmic Game Theory},
	Organization = {Springer},
	Pages = {195--206},
	Title = {Stable matching with uncertain linear preferences},
	Year = {2016}}

@article{aziz2015fair,
	Author = {Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Walsh, Toby},
	Journal = {Artificial Intelligence},
	Pages = {71--92},
	Publisher = {Elsevier},
	Title = {Fair assignment of indivisible objects under ordinal preferences},
	Volume = {227},
	Year = {2015}}

@article{horton1993minimum,
	Author = {Horton, Joseph Douglas and Kilakos, Kyriakos},
	Journal = {SIAM Journal on Discrete Mathematics},
	Number = {3},
	Pages = {375--387},
	Publisher = {SIAM},
	Title = {Minimum edge dominating sets},
	Volume = {6},
	Year = {1993}}

@techreport{berman2004approximation,
	Author = {Berman, Piotr and Karpinski, Marek and Scott, A},
	Title = {Approximation hardness of short symmetric instances of MAX-3SAT},
	Year = {2004}}

@book{johnson1979computers,
	Author = {Johnson, David S and Garey, Michael R},
	Publisher = {WH Freeman San Francisco},
	Title = {Computers and intractability: A guide to the theory of NP-completeness},
	Volume = {1},
	Year = {1979}}

@article{saban2015complexity,
	Author = {Saban, Daniela and Sethuraman, Jay},
	Journal = {Mathematics of Operations Research},
	Number = {4},
	Pages = {1005--1014},
	Publisher = {INFORMS},
	Title = {The complexity of computing the random priority allocation matrix},
	Volume = {40},
	Year = {2015}}

@article{lehmann2006combinatorial,
	Author = {Lehmann, Benny and Lehmann, Daniel and Nisan, Noam},
	Journal = {Games and Economic Behavior},
	Number = {2},
	Pages = {270--296},
	Publisher = {Elsevier},
	Title = {Combinatorial auctions with decreasing marginal utilities},
	Volume = {55},
	Year = {2006}}

@article{kuhn1955hungarian,
	Author = {Kuhn, Harold W},
	Journal = {Naval research logistics quarterly},
	Number = {1-2},
	Pages = {83--97},
	Publisher = {Wiley Online Library},
	Title = {The Hungarian method for the assignment problem},
	Volume = {2},
	Year = {1955}}

@book{burkard2009assignment,
	Author = {Burkard, Rainer E and Dell'Amico, Mauro and Martello, Silvano},
	Publisher = {Springer},
	Title = {Assignment problems},
	Year = {2009}}

@article{bogomolnaia2001new,
	Author = {Bogomolnaia, Anna and Moulin, Herv{\'e}},
	Journal = {Journal of Economic theory},
	Number = {2},
	Pages = {295--328},
	Publisher = {Elsevier},
	Title = {A new solution to the random assignment problem},
	Volume = {100},
	Year = {2001}}

@book{brams1996fair,
	Author = {Brams, Steven J and Taylor, Alan D},
	Publisher = {Cambridge University Press},
	Title = {Fair Division: From cake-cutting to dispute resolution},
	Year = {1996}}

@incollection{lindner2016cake,
	Author = {Lindner, Claudia and Rothe, J{\"o}rg},
	Booktitle = {Economics and Computation},
	Pages = {395--491},
	Publisher = {Springer},
	Title = {Cake-cutting: Fair division of divisible goods},
	Year = {2016}}

@article{bei2017networked,
	Author = {Bei, Xiaohui and Qiao, Youming and Zhang, Shengyu},
	Journal = {arXiv preprint arXiv:1707.02033},
	Title = {Networked fairness in cake cutting},
	Year = {2017}}

@misc{bouveret2016fair,
	Author = {Bouveret, Sylvain and Chevaleyre, Yann and Maudet, Nicolas},
	Publisher = {Citeseer},
	Title = {Fair Allocation of Indivisible Goods.},
	Year = {2016}}

@inproceedings{ghodsi2018fair,
	Author = {Ghodsi, Mohammad and HajiAghayi, MohammadTaghi and Seddighin, Masoud and Seddighin, Saeed and Yami, Hadi},
	Booktitle = {Proceedings of the 2018 ACM Conference on Economics and Computation},
	Organization = {ACM},
	Pages = {539--556},
	Title = {Fair allocation of indivisible goods: Improvements and generalizations},
	Year = {2018}}

@article{bei2019connected,
	Author = {Bei, Xiaohui and Igarashi, Ayumi and Lu, Xinhang and Suksompong, Warut},
	Journal = {arXiv preprint arXiv:1908.05433},
	Title = {Connected Fair Allocation of Indivisible Goods},
	Year = {2019}}
