default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Labreuche
- > Home > Persons > Christophe Labreuche
Publications
- 2022
[j31]Christophe Labreuche:
Explanation with the Winter value: Efficient computation for hierarchical Choquet integrals. Int. J. Approx. Reason. 151: 225-250 (2022)- [c54]Christophe Labreuche
:
Explanation of Pseudo-Boolean Functions Using Cooperative Game Theory and Prime Implicants. SUM 2022: 295-308 - 2021
- [c53]Christophe Labreuche:
Explanation with the Winter Value: Efficient Computation for Hierarchical Choquet Integrals. ECSQARU 2021: 471-485 - 2019
- [c47]Christophe Labreuche:
Explaining Hierarchical Multi-linear Models. SUM 2019: 192-206 - 2018
- [j28]Christophe Labreuche:
An axiomatization of the Choquet integral in the context of multiple criteria decision making without any commensurability assumption. Ann. Oper. Res. 271(2): 701-735 (2018) - 2017
- [c40]Christophe Labreuche:
Aggregation of Preferences on Criteria Importance Expressed on Various Subsets by Several Decision Makers. SUM 2017: 377-388 - 2016
- [c39]Christophe Labreuche:
On Capacities Characterized by Two Weight Vectors. IPMU (1) 2016: 23-34 - 2014
- [c33]Christophe Labreuche:
Construction of a Bi-capacity and Its Utility Functions without any Commensurability Assumption in Multi-criteria Decision Making. IPMU (1) 2014: 294-303 - 2013
- [c31]Christophe Labreuche:
Argumentation Based Dynamic Multiple Criteria Decision Making. ECSQARU 2013: 352-363 - 2012
- [c26]Christophe Labreuche:
An Axiomatization of the Choquet Integral and Its Utility Functions without Any Commensurability Assumption. IPMU (4) 2012: 258-267 - 2011
- [j21]Christophe Labreuche:
A general framework for explaining the results of a multi-attribute preference model. Artif. Intell. 175(7-8): 1410-1448 (2011) - [j20]Christophe Labreuche:
Interaction indices for games on combinatorial structures with forbidden coalitions. Eur. J. Oper. Res. 214(1): 99-108 (2011) - [c21]Christophe Labreuche:
Construction of a Choquet integral and the value functions without any commensurateness assumption in multi-criteria decision making. EUSFLAT Conf. 2011: 90-97 - 2010
- [c16]Christophe Labreuche:
On the Robustness for the Choquet Integral. IPMU 2010: 484-493 - 2009
- [c13]Christophe Labreuche:
On the Completion Mechanism Produced by the Choquet Integral on Some Decision Strategies. IFSA/EUSFLAT Conf. 2009: 567-572 - 2007
- [c10]Christophe Labreuche:
Two Consensus Protocols Based on an Acceptance Threshold in Group Decision Making. EUSFLAT Conf. (2) 2007: 295-302 - [c9]Christophe Labreuche:
Modeling the Context in Multi-Criteria Decision Analysis. EUSFLAT Conf. (2) 2007: 303-310 - 2005
- [c5]Christophe Labreuche:
Argumentation of the results of a multi-criteria evaluation model in individual and group decision aiding. EUSFLAT Conf. 2005: 482-487 - 1998
- [j2]Christophe Labreuche:
A convergence theorem for the fast multipole method for 2 dimensional scattering problems. Math. Comput. 67(222): 553-591 (1998) - [j1]Christophe Labreuche:
Purely Imaginary Resonant Frequencies For a Lossy Inhomogeneous Medium. SIAM J. Appl. Math. 59(2): 725-742 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
