![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Olivier Spanjaard
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. 348: 301-319 (2024) - 2023
- [c34]Hugo Gilbert, Mohamed Ouaguenouni, Meltem Öztürk, Olivier Spanjaard:
Robust Ordinal Regression for Collaborative Preference Learning with Opinion Synergies. AAMAS 2023: 2439-2441 - [c33]Bruno Escoffier
, Olivier Spanjaard
, Magdaléna Tydrichová
:
Algorithmic Recognition of 2-Euclidean Preferences. ECAI 2023: 637-644 - [c32]Hugo Gilbert, Mohamed Ouaguenouni, Meltem Öztürk, Olivier Spanjaard:
A Hybrid Approach to Preference Learning with Interaction Terms. ECAI 2023: 835-842 - [i10]Hugo Gilbert, Mohamed Ouaguenouni, Meltem Öztürk, Olivier Spanjaard:
Robust Ordinal Regression for Subsets Comparisons with Interactions. CoRR abs/2308.03376 (2023) - 2022
- [j16]Bruno Escoffier, Olivier Spanjaard
, Magdaléna Tydrichová:
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. Discret. Appl. Math. 318: 6-12 (2022) - [j15]Hugo Gilbert
, Tom Portoleau, Olivier Spanjaard
:
Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem. Theor. Comput. Sci. 904: 27-47 (2022) - [c31]Martin Durand
, Fanny Pascual
, Olivier Spanjaard
:
A Non-utilitarian Discrete Choice Model for Preference Aggregation. SUM 2022: 157-171 - [i9]Hugo Gilbert, Mohamed Ouaguenouni, Meltem Öztürk, Olivier Spanjaard:
Cautious Learning of Multiattribute Preferences. CoRR abs/2206.07341 (2022) - 2021
- [c30]Bruno Escoffier
, Olivier Spanjaard
, Magdaléna Tydrichová
:
Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT 2021: 19-34 - [i8]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. CoRR abs/2106.13054 (2021) - 2020
- [c29]Hugo Gilbert, Tom Portoleau, Olivier Spanjaard:
Beyond Pairwise Comparisons in Social Choice: A Setwise Kemeny Aggregation Problem. AAAI 2020: 1982-1989 - [c28]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. SAGT 2020: 291-306 - [i7]Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. CoRR abs/2004.13602 (2020) - [i6]Nadjet Bourdache, Patrice Perny, Olivier Spanjaard:
Bayesian preference elicitation for multiobjective combinatorial optimization. CoRR abs/2007.14778 (2020)
2010 – 2019
- 2019
- [j14]Hugo Gilbert
, Olivier Spanjaard:
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case. Algorithmica 81(7): 2653-2681 (2019) - [c27]Nadjet Bourdache, Patrice Perny, Olivier Spanjaard:
Incremental Elicitation of Rank-Dependent Aggregation Functions based on Bayesian Linear Regression. IJCAI 2019: 2023-2029 - [c26]Nadjet Bourdache, Patrice Perny, Olivier Spanjaard:
Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra. SUM 2019: 93-106 - [i5]Hugo Gilbert, Tom Portoleau, Olivier Spanjaard:
Beyond Pairwise Comparisons in Social Choice: A Setwise Kemeny Aggregation Problem. CoRR abs/1911.06226 (2019) - 2018
- [i4]Hugo Gilbert, Olivier Spanjaard:
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case. CoRR abs/1809.08453 (2018) - 2017
- [j13]Hugo Gilbert, Olivier Spanjaard:
A double oracle approach to minmax regret optimization problems with interval data. Eur. J. Oper. Res. 262(3): 929-943 (2017) - [j12]Paul Weng
, Olivier Spanjaard:
Functional Reward Markov Decision Processes: Theory and Applications. Int. J. Artif. Intell. Tools 26(3): 1760014:1-1760014:20 (2017) - [c25]Hugo Gilbert, Nawal Benabbou, Patrice Perny, Olivier Spanjaard, Paolo Viappiani:
Incremental Decision Making Under Risk with the Weighted Expected Utility Model. IJCAI 2017: 4588-4594 - [c24]Hugo Gilbert, Olivier Spanjaard:
Complexity of Solving Decision Trees with Skew-Symmetric Bilinear Utility. UAI 2017 - 2016
- [c23]Soufiane Drissi Oudghiri, Patrice Perny, Olivier Spanjaard, Mohamed Hachimi:
Using the Sugeno Integral in Optimal Assignment Problems with Qualitative Utilities. ECAI 2016: 1406-1413 - [i3]Hugo Gilbert, Olivier Spanjaard:
A game theoretic bound for minmax regret optimization problems with interval data. CoRR abs/1602.01764 (2016) - 2015
- [c22]Hugo Gilbert, Olivier Spanjaard, Paolo Viappiani
, Paul Weng:
Reducing the Number of Queries in Interactive Value Iteration. ADT 2015: 139-152 - [c21]Hugo Gilbert, Olivier Spanjaard, Paolo Viappiani, Paul Weng:
Solving MDPs with Skew Symmetric Bilinear Utility Functions. IJCAI 2015: 1989-1995 - 2013
- [j11]Charles Delort, Olivier Spanjaard:
A hybrid dynamic programming approach to the biobjective binary knapsack problem. ACM J. Exp. Algorithmics 18 (2013) - [c20]Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 - [c19]Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. IJCAI 2013: 76-82 - [c18]Olivier Spanjaard, Paul Weng:
Markov Decision Processes with Functional Rewards. MIWAI 2013: 269-280 - [c17]Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard:
Bidirectional Preference-Based Search for State Space Graph Problems. SOCS 2013: 80-88 - 2012
- [j10]Lucie Galand, Olivier Spanjaard:
Exact algorithms for OWA-optimization in multiobjective spanning tree problems. Comput. Oper. Res. 39(7): 1540-1554 (2012) - [c16]Gildas Jeantet, Patrice Perny, Olivier Spanjaard:
Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach. AAAI 2012: 1931-1937 - [c15]Denis Cornaz, Lucie Galand, Olivier Spanjaard:
Bounded Single-Peaked Width and Proportional Representation. ECAI 2012: 270-275 - [i2]Patrice Perny, Olivier Spanjaard:
An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios. CoRR abs/1212.2496 (2012) - 2011
- [b1]Olivier Spanjaard:
Contributions à la théorie de la décision algorithmique : optimisation multi-objectifs et optimisation dans l'incertain. Pierre and Marie Curie University, Paris, France, 2011 - [j9]Gildas Jeantet, Olivier Spanjaard:
Computing rank dependent utility in graphical models for sequential decision problems. Artif. Intell. 175(7-8): 1366-1389 (2011) - [c14]Charles Delort, Olivier Spanjaard, Paul Weng:
Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation. ADT 2011: 28-41 - [c13]Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard:
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81 - [c12]Hélène Fargier, Gildas Jeantet, Olivier Spanjaard:
Resolute Choice in Sequential Decision Problems with Multiple Priors. IJCAI 2011: 2120-2125 - 2010
- [j8]Lucie Galand, Patrice Perny, Olivier Spanjaard:
Choquet-based optimisation in multiobjective shortest path and spanning tree problems. Eur. J. Oper. Res. 204(2): 303-315 (2010) - [j7]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard:
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205(1): 19-30 (2010) - [c11]Charles Delort, Olivier Spanjaard:
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem. SEA 2010: 253-265
2000 – 2009
- 2009
- [c10]Gildas Jeantet, Olivier Spanjaard:
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities. ADT 2009: 340-352 - [i1]Lucie Galand, Olivier Spanjaard:
Exact algorithms for OWA-optimization in multiobjective spanning tree problems. CoRR abs/0910.5744 (2009) - 2008
- [j6]Francis Sourd, Olivier Spanjaard:
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. INFORMS J. Comput. 20(3): 472-484 (2008) - [j5]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008) - [c9]Gildas Jeantet, Olivier Spanjaard:
Rank-Dependent Probability Weighting in Sequential Decision Problems under Uncertainty. ICAPS 2008: 148-155 - [c8]Patrice Perny, Olivier Spanjaard:
Near Admissible Algorithms for Multiobjective Search. ECAI 2008: 490-494 - [c7]Lucie Galand, Patrice Perny, Olivier Spanjaard:
A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems. MCDM 2008: 355-365 - [c6]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291 - 2007
- [c5]Lucie Galand, Olivier Spanjaard:
OWA-Based Search in State Space Graphs with Multiple Cost Functions. FLAIRS 2007: 86-91 - [c4]Patrice Perny, Olivier Spanjaard, Louis-Xavier Storme:
State Space Search for Risk-Averse Agents. IJCAI 2007: 2353-2358 - 2006
- [j4]Patrice Perny, Olivier Spanjaard, Louis-Xavier Storme:
A decision-theoretic approach to robust optimization in multivalued graphs. Ann. Oper. Res. 147(1): 317-341 (2006) - 2005
- [j3]Patrice Perny, Olivier Spanjaard:
A preference-based approach to spanning trees and shortest paths problems****. Eur. J. Oper. Res. 162(3): 584-601 (2005) - [c3]Patrice Perny, Olivier Spanjaard, Paul Weng:
Algebraic Markov Decision Processes. IJCAI 2005: 1372-1377 - 2004
- [j2]Olivier Spanjaard:
Non-classical preference models in combinatorial problems: Models and algorithms for graphs. 4OR 2(4): 325-328 (2004) - 2003
- [j1]Jérôme Monnot, Olivier Spanjaard:
Bottleneck shortest paths on a partially ordered scale. 4OR 1(3): 225-241 (2003) - [c2]Patrice Perny, Olivier Spanjaard:
An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios. UAI 2003: 469-476 - 2002
- [c1]Patrice Perny, Olivier Spanjaard:
On Preference-Based Search in State Space Graphs. AAAI/IAAI 2002: 751-756
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint