 | 2009 |
|---|
| 41 |       | Antoine Nongaillard,
Philippe Mathieu:
A Multi-agent Resource Negotiation for Social Welfare.
IAT 2009: 58-61 |
| 2008 |
|---|
| 40 | | Yoann Kubera,
Philippe Mathieu,
Sébastien Picault:
Interaction-Oriented Agent Simulations: From Theory to Implementation.
ECAI 2008: 383-387 |
| 39 | | François Gaillard,
Yoann Kubera,
Philippe Mathieu,
Sébastien Picault:
A Reverse Engineering Form for Multi Agent Systems.
ESAW 2008: 137-153 |
| 38 | | Antoine Nongaillard,
Philippe Mathieu,
Brigitte Jaumard:
A Multi-Agent Resource Negotiation for the Utilitarian Welfare.
ESAW 2008: 208-226 |
| 37 | | Yoann Kubera,
Philippe Mathieu,
Sébastien Picault:
Interaction Biases in Multi-Agent Simulations: An Experimental Study.
ESAW 2008: 229-247 |
| 36 | | Yoann Kubera,
Philippe Mathieu,
Sébastien Picault:
Interaction Selection Ambiguities in Multi-agent Systems.
IAT 2008: 75-78 |
| 35 | | Benoit Lacroix,
Philippe Mathieu,
Andras Kemeny:
A Normative Model for Behavioral Differentiation.
IAT 2008: 96-99 |
| 34 | | Yoann Kubera,
Philippe Mathieu,
Sébastien Picault:
Formalisation et implémentation des interactions pour la simulation centrée individu.
L'OBJET 14(1-2): 9-33 (2008) |
| 2007 |
|---|
| 33 | | Maxime Morge,
Philippe Mathieu:
Mécanisme de rétribution pour les systèmes P2P d'échange de fichiers. Comment résoudre le problème du cavalier seul.
Ingénierie des Systèmes d'Information 12(3): 61-84 (2007) |
| 32 | | J. Derveeuw,
Bruno Beaufils,
O. Brandouy,
Philippe Mathieu:
L'apport des SMA à la modélisation des marchés financiers.
Revue d'Intelligence Artificielle 21(5-6): 617-641 (2007) |
| 2006 |
|---|
| 31 | | Cédric Dinont,
Philippe Mathieu,
Emmanuel Druon,
Patrick Taillibert:
Artifacts for time-aware agents.
AAMAS 2006: 593-600 |
| 30 |  | Bruno Beaufils,
Philippe Mathieu:
Cheating Is Not Playing: Methodological Issues of Computational Game Theory.
ECAI 2006: 185-189 |
| 2005 |
|---|
| 29 | | Damien Devigne,
Philippe Mathieu,
Jean-Christophe Routier:
Team of cognitive agents with a leader: how to let them acquire autonomy.
CIG 2005 |
| 28 | | Philippe Mathieu,
Sébastien Picault:
Towards an Interaction-Based Design of Behaviors.
EUMAS 2005: 167-178 |
| 27 | | Philippe Mathieu,
Marie-Hélène Verrons:
GeNCA, un modèle général de négociation de contrats.
Revue d'Intelligence Artificielle 19(6): 837-884 (2005) |
| 2004 |
|---|
| 26 | | Damien Devigne,
Philippe Mathieu,
Jean-Christophe Routier:
Planning for Spatially Situated Agents.
IAT 2004: 385-388 |
| 2003 |
|---|
| 25 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
RIO: Roles, Interactions and Organizations.
CEEMAS 2003: 147-157 |
| 24 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Bridging the Gap Between Semantic and Pragmatic.
IKE 2003: 308-314 |
| 23 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Runnable Specifications of Interactions for Open Multi-Agent Systems.
IKE 2003: 431-437 |
| 22 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Towards a Pragmatic Methodology for Open Multi-agent Systems.
ISMIS 2003: 206-210 |
| 21 | | Philippe Mathieu,
Marie-Hélène Verrons:
ANTS: an API for creating negotiation applications.
ISPE CE 2003: 169-175 |
| 20 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Towards a Pragmatic Use of Ontologies in Multi-agent Platforms.
KES 2003: 1395-1402 |
| 2002 |
|---|
| 19 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Dynamic organization of multi-agent systems.
AAMAS 2002: 451-452 |
| 18 | | Jean-Christophe Routier,
Philippe Mathieu:
A Multi-Agent Approach to Cooperative Work.
CADUI 2002: 367-380 |
| 17 | | Philippe Mathieu,
Jean-Christophe Routier,
Yann Secq:
Principles for Dynamic Multi-agent Organizations.
PRIMA 2002: 109-122 |
| 2000 |
|---|
| 16 | | Olivier Roussel,
Philippe Mathieu:
The Achievement of Knowledge Bases by Cycle Search.
Inf. Comput. 162(1-2): 43-58 (2000) |
| 1999 |
|---|
| 15 | | Philippe Mathieu,
Bruno Beaufils,
Jean-Paul Delahaye:
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies.
Artificial Evolution 1999: 177-190 |
| 1998 |
|---|
| 14 | | Bruno Beaufils,
Jean-Paul Delahaye,
Philippe Mathieu:
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
Evolutionary Programming 1998: 33-41 |
| 13 | | Nourredine Bensaid,
Philippe Mathieu:
An Autonomous Agent System to Simulate a Set of Robots Exploring a Labyrinth.
FLAIRS Conference 1998: 384-388 |
| 1997 |
|---|
| 12 | | Olivier Roussel,
Philippe Mathieu:
Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case.
CADE 1997: 161-175 |
| 11 | | Olivier Roussel,
Philippe Mathieu:
Une compilation logique exacte en calcul des prédicats: le cas de l'achèvement partiel.
JFPLC 1997: 261-276 |
| 1996 |
|---|
| 10 | | Olivier Roussel,
Philippe Mathieu:
A New Method for Knowledge Compilation: The Achievement by Cycle Search.
CADE 1996: 493-507 |
| 9 | | Olivier Roussel,
Philippe Mathieu:
Une nouvelle méthode de compilation logique: l'achèvement par cycles.
JFPLC 1996: 271-286 |
| 1995 |
|---|
| 8 | | Olivier Roussel,
Philippe Mathieu:
Évaluation des méthodes d'achèvement par parties.
JFPLC 1995: 175-189 |
| 7 | | Nourredine Bensaid,
Philippe Mathieu:
Un modèle d'architecture multi-agents entièrement écrit en Prolog.
JFPLC 1995: 381-385 |
| 1994 |
|---|
| 6 | | Philippe Mathieu,
Jean-Paul Delahaye:
A Kind of Achievement by Parts Method.
LPAR 1994: 320-332 |
| 5 | | Philippe Mathieu,
Jean-Paul Delahaye:
A Kind of Logical Compilation for Knowledge Bases.
Theor. Comput. Sci. 131(1): 197-218 (1994) |
| 1993 |
|---|
| 4 | | Jean-Paul Delahaye,
Philippe Mathieu:
An achievement by part method to solve the incompleteness of forward chaining.
JFPL 1993: 155-171 |
| 1992 |
|---|
| 3 | | Jean-Paul Delahaye,
Philippe Devienne,
Philippe Mathieu,
Pascal Yim:
JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France
JFPL 1992 |
| 1990 |
|---|
| 2 | | Philippe Mathieu,
Jean-Paul Delahaye:
The Logical Compilation of Knowledge Bases.
JELIA 1990: 386-398 |
| 1989 |
|---|
| 1 | | Jean-Paul Delahaye,
Philippe Mathieu:
Logique Partielle et Prolog.
SPLT 1989: 311- |
