Olivier Spanjaard

Orcid: 0000-0002-9948-090X

According to our database1, Olivier Spanjaard authored at least 55 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Robust Ordinal Regression for Subsets Comparisons with Interactions.
CoRR, 2023

A Hybrid Approach to Preference Learning with Interaction Terms.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Algorithmic Recognition of 2-Euclidean Preferences.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Robust Ordinal Regression for Collaborative Preference Learning with Opinion Synergies.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem.
Theor. Comput. Sci., 2022

Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences.
Discret. Appl. Math., 2022

Cautious Learning of Multiattribute Preferences.
CoRR, 2022

A Non-utilitarian Discrete Choice Model for Preference Aggregation.
Proceedings of the Scalable Uncertainty Management - 15th International Conference, 2022

2021
Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences.
CoRR, 2021

Measuring Nearly Single-Peakedness of an Electorate: Some New Insights.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020
Bayesian preference elicitation for multiobjective combinatorial optimization.
CoRR, 2020

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

2019
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case.
Algorithmica, 2019

Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra.
Proceedings of the Scalable Uncertainty Management - 13th International Conference, 2019

Incremental Elicitation of Rank-Dependent Aggregation Functions based on Bayesian Linear Regression.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017
Functional Reward Markov Decision Processes: Theory and Applications.
Int. J. Artif. Intell. Tools, 2017

A double oracle approach to minmax regret optimization problems with interval data.
Eur. J. Oper. Res., 2017

Complexity of Solving Decision Trees with Skew-Symmetric Bilinear Utility.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Incremental Decision Making Under Risk with the Weighted Expected Utility Model.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
A game theoretic bound for minmax regret optimization problems with interval data.
CoRR, 2016

Using the Sugeno Integral in Optimal Assignment Problems with Qualitative Utilities.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Solving MDPs with Skew Symmetric Bilinear Utility Functions.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Reducing the Number of Queries in Interactive Value Iteration.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2013
A hybrid dynamic programming approach to the biobjective binary knapsack problem.
ACM J. Exp. Algorithmics, 2013

Bidirectional Preference-Based Search for State Space Graph Problems.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Markov Decision Processes with Functional Rewards.
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2013

Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width.
Proceedings of the IJCAI 2013, 2013

Truthful Many-to-Many Assignment with Private Weights.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Exact algorithms for OWA-optimization in multiobjective spanning tree problems.
Comput. Oper. Res., 2012

Bounded Single-Peaked Width and Proportional Representation.
Proceedings of the ECAI 2012, 2012

Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Computing rank dependent utility in graphical models for sequential decision problems.
Artif. Intell., 2011

Resolute Choice in Sequential Decision Problems with Multiple Priors.
Proceedings of the IJCAI 2011, 2011

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

Contributions à la théorie de la décision algorithmique : optimisation multi-objectifs et optimisation dans l'incertain.
, 2011

2010
Choquet-based optimisation in multiobjective shortest path and spanning tree problems.
Eur. J. Oper. Res., 2010

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.
Eur. J. Oper. Res., 2010

Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Some tractable instances of interval data minmax regret problems.
Oper. Res. Lett., 2008

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem.
INFORMS J. Comput., 2008

Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems.
Proceedings of the Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, 2008

Near Admissible Algorithms for Multiobjective Search.
Proceedings of the ECAI 2008, 2008

Rank-Dependent Probability Weighting in Sequential Decision Problems under Uncertainty.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
State Space Search for Risk-Averse Agents.
Proceedings of the IJCAI 2007, 2007

OWA-Based Search in State Space Graphs with Multiple Cost Functions.
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2006
A decision-theoretic approach to robust optimization in multivalued graphs.
Ann. Oper. Res., 2006

2005
A preference-based approach to spanning trees and shortest paths problems****.
Eur. J. Oper. Res., 2005

Algebraic Markov Decision Processes.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
Non-classical preference models in combinatorial problems: Models and algorithms for graphs.
4OR, 2004

2003
Bottleneck shortest paths on a partially ordered scale.
4OR, 2003

An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios.
Proceedings of the UAI '03, 2003

2002
On Preference-Based Search in State Space Graphs.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002


  Loading...