Bidirectional Preference-Based Search for State Space Graph Problems

Autor: Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard

Publikováno v: Proceedings of the International Symposium on Combinatorial Search. 4:80-88

In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6d0e4ff170977b89d49592ce993b54ea
https://doi.org/10.1609/socs.v4i1.18287

Computational social choice for coordination in agent networks

Autor: Patrice Perny, Anisse Ismaili

Publikováno v: Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence, 2016, 77 (3), pp.335-359. ⟨10.1007/s10472-015-9462-x⟩
Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2016, 77 (3), pp.335-359. ⟨10.1007/s10472-015-9462-x⟩

International audience; This paper presents some models and algorithms for social choice in agent networks. Agent networks are graphical models used to represent systems involving multiple, locally interacting, agents. They allow the representation o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62330a682089a27d8994a6921760ed25
https://doi.org/10.1007/s10472-015-9462-x

Student-Project-Resource Allocation: Complexity of the Symmetric Case

Autor: Tomoaki Yamaguchi, Anisse Ismaili, Makoto Yokoo

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030030971
PRIMA

In this paper, we consider a student-project-resource allocation problem, in which students and indivisible resources are allocated to every project. The allocated resources determine endogenously the student capacity of a project. Traditionally, thi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::30a6ab5e2473d555e6215ce3730158fa
https://doi.org/10.1007/978-3-030-03098-8_14

Routing Games over Time with FIFO Policy

Autor: Anisse Ismaili

Publikováno v: Web and Internet Economics ISBN: 9783319719238
WINE

We study atomic routing games where every agent travels both along its decided edges and through time. The agents arriving on an edge are first lined up in a first-in-first-out queue and may wait: an edge is associated with a capacity, which defines

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::56e4a0583e3989ae2bbd7c6b418d1b05
https://doi.org/10.1007/978-3-319-71924-5_19

Efficiency in Multi-objective Games

Autor: Anisse Ismaili

Publikováno v: Algorithmic Decision Theory ISBN: 9783319231136
ADT

In a multi-objective game, each agent individually evaluates each overall action-profile by a vector. I generalize the price of anarchy to multi-objective games and provide a polynomial-time algorithm to assess this new generalization. A working pape

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8d9a785e02606ec0482fa4c401f4063c
https://doi.org/10.1007/978-3-319-23114-3_37