1. Abdulkadiroǧlu, A., & Sönmez, T. (1998). Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica, 66(3), 689–701.
2. Abebe, R., Kleinberg, J., & Parkes, D. C. (2017). Fair division via social comparison. In Proceedings of the 16th international conference on autonomous agents and multiagent systems (AAMAS-17) (pp. 281–289). ACM, São Paulo, Brazil.
3. Amanatidis, G., Birmpas, G., & Markakis, V. (2018). Comparing approximate relaxations of envy-freeness. In Proceedings of the 27th international joint conference on artificial intelligence (IJCAI-18) (pp. 42–48). International Joint Conferences on Artificial Intelligence, Stockholm, Sweden.
4. Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979). A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8(3), 121–123.
5. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (2012). Complexity and approximation: Combinatorial optimization problems and their approximability properties. Berlin: Springer.