Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference13 articles.
1. Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Annual Symposium on Foundations of Computer Science (FOCS), pp. 416–427. IEEE (2016). https://doi.org/10.1109/FOCS.2016.52
2. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973). https://doi.org/10.1016/S0022-0000(73)80033-9
3. Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016). ISBN: 978-1-107-06043-2
4. Brams, S.J., Taylor, A.D.: Fair Division. Cambridge University Press, Cambridge (1996). ISBN: 978-0-521-55644-6
5. Balinski, M.L., Young, H.P.: Fair Representation: Meeting the Ideal of One Man, One Vote, 2nd edn. Brookings Institution Press, Washington (2001). ISBN: 978-0-81-570111-8
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献