| Issues in multiagent resource allocation Y Chevaleyre, PE Dunne, U Endriss, J Lang, M Lemaitre, N Maudet, ... | 659 | 2005 |
| A short introduction to computational social choice Y Chevaleyre, U Endriss, J Lang, N Maudet International Conference on Current Trends in Theory and Practice of …, 2007 | 334 | 2007 |
| Theoretical analysis of the multi-agent patrolling problem Y Chevaleyre Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent …, 2004 | 334 | 2004 |
| Recent advances on multi-agent patrolling A Almeida, G Ramalho, H Santana, P Tedesco, T Menezes, V Corruble, ... Brazilian Symposium on Artificial Intelligence, 474-483, 2004 | 218 | 2004 |
| Fair Allocation of Indivisible Goods. S Bouveret, Y Chevaleyre, N Maudet Handbook of computational social choice, 284-310, 2016 | 166 | 2016 |
| Solving multiple-instance and multiple-part learning problems with decision trees and rule sets. Application to the mutagenesis problem Y Chevaleyre, JD Zucker Conference of the Canadian Society for Computational Studies of Intelligence …, 2001 | 147 | 2001 |
| Learning conditionally lexicographic preference relations. R Booth, Y Chevaleyre, J Lang, J Mengin, C Sombattheera ECAI 10, 269-274, 2010 | 95 | 2010 |
| Preference handling in combinatorial domains: From AI to social choice Y Chevaleyre, U Endriss, J Lang, N Maudet AI magazine 29 (4), 37-37, 2008 | 91 | 2008 |
| Reaching envy-free states in distributed negotiation settings Y Chevaleyre, U Endriss, S Estivie, N Maudet IJCAI 7, 1239-1244, 2007 | 84 | 2007 |
| Multiagent resource allocation with k-additive utility functions Y Chevaleyre, U Endriss, S Estivie, N Maudet Proc. DIMACS-LAMSADE workshop on computer science and decision theory 3, 83-100, 2004 | 75 | 2004 |
| Multiagent resource allocation in k-additive domains: Preference representation and complexity Y Chevaleyre, U Endriss, S Estivie, N Maudet Annals of Operations Research 163 (1), 49-62, 2008 | 69 | 2008 |
| Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling. Y Chevaleyre, U Endriss, J Lang Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 2006 | 69 | 2006 |
| A theoretical analysis of multi-agent patrolling strategies Y Chevaleyre, F Sempe, G Ramalho AAMAS 4, 1524-1525, 2004 | 65 | 2004 |
| Possible winners when new candidates are added: The case of scoring rules Y Chevaleyre, J Lang, N Maudet, J Monnot Proceedings of the AAAI Conference on Artificial Intelligence 24 (1), 762-767, 2010 | 60 | 2010 |
| Representing utility functions via weighted goals J Uckelman, Y Chevaleyre, U Endriss, J Lang Mathematical Logic Quarterly 55 (4), 341-361, 2009 | 59 | 2009 |
| Distributed fair allocation of indivisible goods Y Chevaleyre, U Endriss, N Maudet Artificial Intelligence 242, 1-22, 2017 | 55 | 2017 |
| New candidates welcome! Possible winners with respect to the addition of new candidates Y Chevaleyre, J Lang, N Maudet, J Monnot, L Xia Mathematical Social Sciences 64 (1), 74-88, 2012 | 55 | 2012 |
| Allocating goods on a graph to eliminate envy Y Chevaleyre, U Endriss, N Maudet Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 2007 | 55 | 2007 |
| Negotiating over small bundles of resources Y Chevaleyre, U Endriss, J Lang, N Maudet Proceedings of the Fourth International Joint Conference on Autonomous …, 2005 | 55 | 2005 |
| A framework for learning rules from multiple instance data Y Chevaleyre, JD Zucker European Conference on Machine Learning, 49-60, 2001 | 53 | 2001 |
Jean-Daniel ZuckerSenior Researcher, UMMISCO, IRD/Sorbonne University, FranceVerified email at ird.fr
