Yann Chevaleyre | Université Sorbonne Paris Nord / Sorbonne Paris Nord University (original) (raw)
Papers by Yann Chevaleyre
Journal of High Energy Physics, 2006
We investigate the properties of an abstract negotiation framework where agents autonomously nego... more We investigate the properties of an abstract negotiation framework where agents autonomously negotiate over allocations of indivisible resources. In this framework, reaching an allocation that is optimal may require very complex multilateral deals. Therefore, we are interested in identifying classes of valuation functions such that any negotiation conducted by means of deals involving only a single resource at a time
Neuropsychologia, 2005
Computational social choice is an interdisciplinary field of study at the interface of social cho... more Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions. On the one hand, it is concerned with the application of techniques developed in computer science, such as complexity analysis or algorithm design, to the study of social choice mechanisms, such as voting
European Management Journal, 2005
We consider the problem of learning a user's ordinal preferences on multiattribute domains, a... more We consider the problem of learning a user's ordinal preferences on multiattribute domains, assuming that the user's preferences may be modelled as a kind of lexicographic ordering. We introduce a general graphical representation called LP-structures which captures various natural classes of such ordering in which both the order of importance between attributes and the local preferences over each attribute may
In some voting contexts, some new candidates may show up in the course of the process. In this ca... more In some voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed numberk of new candidates will be added. We give a computational study of the latter problem, focusing on scoring rules, and we give a
International Joint Conference on Artificial Intelligence, 2009
In many practical contexts where a number of agents have to find a common decision, the votes do ... more In many practical contexts where a number of agents have to find a common decision, the votes do not come all together at the same time. In such situ- ations, we may want to preprocess the information given by the subelectorate (consisting of the voters who have expressed their votes) so as to "compile" the known votes for the time
... This problem consists in inducing the description of h from a set of pairs (description(objec... more ... This problem consists in inducing the description of h from a set of pairs (description(objecti), resulti=f(objecti)) - the learning examples - and criteria - learning bias - that enable a ... Similarly, a classification rule used to represent multiple-concepts will be called multiple-rule. ...
International Conference on Machine Learning, 2000
This paper addresses the issue of multipleinstanceinduction of rules in the presence ofnoise. It ... more This paper addresses the issue of multipleinstanceinduction of rules in the presence ofnoise. It first proposes a multiple-instanceextensions of rule-based learning algorithms.Then, it shows what kind of noise can appear inmultiple-instance data, and how to handle ittheoretically. Finally, it describes theimplementation of such a noise-tolerant multipleinstance learner, and shows its performance onseveral problems, including the well-knownmutagenesis prediction task.1.
National Conference on Artificial Intelligence, 2010
In some voting situations, some new candidates may show up in the course of the process. In this ... more In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. Focusing on scoring rules, we give complexity results for the above possible winner problem.
Lecture Notes in Computer Science, 2001
... This problem consists in inducing the description of h from a set of pairs (description(objec... more ... This problem consists in inducing the description of h from a set of pairs (description(objecti), resulti=f(objecti)) - the learning examples - and criteria - learning bias - that enable a ... Similarly, a classification rule used to represent multiple-concepts will be called multiple-rule. ...
Lecture Notes in Computer Science, 2002
ABSTRACT This work is about the building of a lexicon of shared symbols between a Pioneer2DX mobi... more ABSTRACT This work is about the building of a lexicon of shared symbols between a Pioneer2DX mobile robot and its human interlocutors. This lexicon contains words corresponding to objects seen in the environment. The difficulty relies in grounding these symbols with the actual data provided by the camera of the robot with respect to the learning scenario shown in figure
Lecture Notes in Computer Science, 2009
Transfer algorithms allow the use of knowledge previously learned on related tasks to speed-up le... more Transfer algorithms allow the use of knowledge previously learned on related tasks to speed-up learning of the current task. Recently, many complex reinforcement learning problems have been successfully solved by efficient transfer learners. However, most of these algorithms suffer from a severe flaw: they are implicitly tuned to transfer knowledge between tasks having a given degree of similarity. In other
ABSTRACT Nowadays, tsunami is becoming one of the most dangerous natural disaster for coastal reg... more ABSTRACT Nowadays, tsunami is becoming one of the most dangerous natural disaster for coastal regions. Along with the early warning system, evacuation is one of the first mitigation procedures to consider. The evacuation simulation then received a lot of studies in recent years in the domain of computer science. In fact, there are always the part of evacuees (e.g. the tourist) who lack information of the evacuation map, which motivates us to study the problem of optimizing of guidance sign placement for tsunami evacuation. In this paper, we first propose the approach of Linear Programming that speeds up the Evaluation of Casualties in Agent-based Simulation in order to overcome the problem of computational speed of agent-based simulation. Then, we present an approach for optimizing the sign placement by using genetic algorithm with the fitness evaluated by the agent-based simulation.
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII, 2011
We address the problem of designing communication protocols for voting rules when the set of cand... more We address the problem of designing communication protocols for voting rules when the set of candidates can evolve via the addition of new candidates.We show that the necessary amount of communication that must be transmitted between the voters and the central authority depends on the amount of space devoted to the storage of the votes over the initial set of candidates. This calls for a bicriteria evaluation of protocols. We consider a few usual voting rules, and three types of storage functions: full storage, where the full votes on the initial set of voters are stored; null storage, where nothing is stored; and anonymous storage, which lies in-between. For some of these pairs (voting rule, type of storage) we design protocols and show that they are asymptotically optimal by determining the communication complexity of the rule under the storage function considered.
Lecture Notes in Computer Science, 2001
... 54 Y. Chevaleyre and J.-D. Zucker 4 Analysis of RipperMi Algorithms The purpose of this secti... more ... 54 Y. Chevaleyre and J.-D. Zucker 4 Analysis of RipperMi Algorithms The purpose of this section is to analyze and to understand the behavior of the algorithm presented earlier as NAIVE-RIPPERMI. ... Analyzing relational learning in the phase transition framework. In Proc. ...
Robotics and Autonomous Systems, 2003
There is a growing interest in both the robotics and AI communities to give autonomous robots the... more There is a growing interest in both the robotics and AI communities to give autonomous robots the ability to interact with humans. To efficiently identify properties from its environment (be it the presence of a human, or a fire extinguisher or another robot of its kind) is one of the critical tasks for supporting meaningful robot/human dialogues. This task is
Journal of High Energy Physics, 2006
We investigate the properties of an abstract negotiation framework where agents autonomously nego... more We investigate the properties of an abstract negotiation framework where agents autonomously negotiate over allocations of indivisible resources. In this framework, reaching an allocation that is optimal may require very complex multilateral deals. Therefore, we are interested in identifying classes of valuation functions such that any negotiation conducted by means of deals involving only a single resource at a time
Neuropsychologia, 2005
Computational social choice is an interdisciplinary field of study at the interface of social cho... more Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions. On the one hand, it is concerned with the application of techniques developed in computer science, such as complexity analysis or algorithm design, to the study of social choice mechanisms, such as voting
European Management Journal, 2005
We consider the problem of learning a user's ordinal preferences on multiattribute domains, a... more We consider the problem of learning a user's ordinal preferences on multiattribute domains, assuming that the user's preferences may be modelled as a kind of lexicographic ordering. We introduce a general graphical representation called LP-structures which captures various natural classes of such ordering in which both the order of importance between attributes and the local preferences over each attribute may
In some voting contexts, some new candidates may show up in the course of the process. In this ca... more In some voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed numberk of new candidates will be added. We give a computational study of the latter problem, focusing on scoring rules, and we give a
International Joint Conference on Artificial Intelligence, 2009
In many practical contexts where a number of agents have to find a common decision, the votes do ... more In many practical contexts where a number of agents have to find a common decision, the votes do not come all together at the same time. In such situ- ations, we may want to preprocess the information given by the subelectorate (consisting of the voters who have expressed their votes) so as to "compile" the known votes for the time
... This problem consists in inducing the description of h from a set of pairs (description(objec... more ... This problem consists in inducing the description of h from a set of pairs (description(objecti), resulti=f(objecti)) - the learning examples - and criteria - learning bias - that enable a ... Similarly, a classification rule used to represent multiple-concepts will be called multiple-rule. ...
International Conference on Machine Learning, 2000
This paper addresses the issue of multipleinstanceinduction of rules in the presence ofnoise. It ... more This paper addresses the issue of multipleinstanceinduction of rules in the presence ofnoise. It first proposes a multiple-instanceextensions of rule-based learning algorithms.Then, it shows what kind of noise can appear inmultiple-instance data, and how to handle ittheoretically. Finally, it describes theimplementation of such a noise-tolerant multipleinstance learner, and shows its performance onseveral problems, including the well-knownmutagenesis prediction task.1.
National Conference on Artificial Intelligence, 2010
In some voting situations, some new candidates may show up in the course of the process. In this ... more In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. Focusing on scoring rules, we give complexity results for the above possible winner problem.
Lecture Notes in Computer Science, 2001
... This problem consists in inducing the description of h from a set of pairs (description(objec... more ... This problem consists in inducing the description of h from a set of pairs (description(objecti), resulti=f(objecti)) - the learning examples - and criteria - learning bias - that enable a ... Similarly, a classification rule used to represent multiple-concepts will be called multiple-rule. ...
Lecture Notes in Computer Science, 2002
ABSTRACT This work is about the building of a lexicon of shared symbols between a Pioneer2DX mobi... more ABSTRACT This work is about the building of a lexicon of shared symbols between a Pioneer2DX mobile robot and its human interlocutors. This lexicon contains words corresponding to objects seen in the environment. The difficulty relies in grounding these symbols with the actual data provided by the camera of the robot with respect to the learning scenario shown in figure
Lecture Notes in Computer Science, 2009
Transfer algorithms allow the use of knowledge previously learned on related tasks to speed-up le... more Transfer algorithms allow the use of knowledge previously learned on related tasks to speed-up learning of the current task. Recently, many complex reinforcement learning problems have been successfully solved by efficient transfer learners. However, most of these algorithms suffer from a severe flaw: they are implicitly tuned to transfer knowledge between tasks having a given degree of similarity. In other
ABSTRACT Nowadays, tsunami is becoming one of the most dangerous natural disaster for coastal reg... more ABSTRACT Nowadays, tsunami is becoming one of the most dangerous natural disaster for coastal regions. Along with the early warning system, evacuation is one of the first mitigation procedures to consider. The evacuation simulation then received a lot of studies in recent years in the domain of computer science. In fact, there are always the part of evacuees (e.g. the tourist) who lack information of the evacuation map, which motivates us to study the problem of optimizing of guidance sign placement for tsunami evacuation. In this paper, we first propose the approach of Linear Programming that speeds up the Evaluation of Casualties in Agent-based Simulation in order to overcome the problem of computational speed of agent-based simulation. Then, we present an approach for optimizing the sign placement by using genetic algorithm with the fitness evaluated by the agent-based simulation.
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII, 2011
We address the problem of designing communication protocols for voting rules when the set of cand... more We address the problem of designing communication protocols for voting rules when the set of candidates can evolve via the addition of new candidates.We show that the necessary amount of communication that must be transmitted between the voters and the central authority depends on the amount of space devoted to the storage of the votes over the initial set of candidates. This calls for a bicriteria evaluation of protocols. We consider a few usual voting rules, and three types of storage functions: full storage, where the full votes on the initial set of voters are stored; null storage, where nothing is stored; and anonymous storage, which lies in-between. For some of these pairs (voting rule, type of storage) we design protocols and show that they are asymptotically optimal by determining the communication complexity of the rule under the storage function considered.
Lecture Notes in Computer Science, 2001
... 54 Y. Chevaleyre and J.-D. Zucker 4 Analysis of RipperMi Algorithms The purpose of this secti... more ... 54 Y. Chevaleyre and J.-D. Zucker 4 Analysis of RipperMi Algorithms The purpose of this section is to analyze and to understand the behavior of the algorithm presented earlier as NAIVE-RIPPERMI. ... Analyzing relational learning in the phase transition framework. In Proc. ...
Robotics and Autonomous Systems, 2003
There is a growing interest in both the robotics and AI communities to give autonomous robots the... more There is a growing interest in both the robotics and AI communities to give autonomous robots the ability to interact with humans. To efficiently identify properties from its environment (be it the presence of a human, or a fire extinguisher or another robot of its kind) is one of the critical tasks for supporting meaningful robot/human dialogues. This task is