default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Gourvès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j34]Pierre Cardi, Laurent Gourvès, Julien Lesca:
On fair and efficient solutions for budget apportionment. Auton. Agents Multi Agent Syst. 39(1): 21 (2025)- [j33]Laurent Gourvès, Gianpiero Monaco:
Existence, Computation and Efficiency of Nash Stable Outcomes in Hedonic Skill Games. J. Artif. Intell. Res. 82: 1711-1742 (2025) - [c59]Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli:
Individually Stable Dynamics in Coalition Formation over Graphs. AAAI 2025: 13831-13838 - [c58]Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos:
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. AAAI 2025: 13864-13872 - [i7]Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis:
Satisfactory Budget Division. CoRR abs/2502.00484 (2025) - 2024
- [j32]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
:
Filling crosswords is very hard. Theor. Comput. Sci. 982: 114275 (2024) - [c57]Laurent Gourvès, Gianpiero Monaco:
Nash Stability in Hedonic Skill Games. AAMAS 2024: 706-714 - [c56]Satya Tamby, Laurent Gourvès, Stefano Moretti:
Greedy Heuristic Guided by Lexicographic Excellence. EvoStar 2024: 97-112 - [c55]Laurent Gourvès, Aris Pagourtzis:
Removable Online Knapsack with Bounded Size Items. SOFSEM 2024: 283-296 - [i6]Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli:
Individually Stable Dynamics in Coalition Formation over Graphs. CoRR abs/2408.11488 (2024) - [i5]Vittorio Bilò, Angelo Fanelli, Laurent Gourvès, Christos Tsoufis, Cosimo Vinci:
Minimizing Rosenthal's Potential in Monotone Congestion Games. CoRR abs/2408.11489 (2024) - [i4]Dimitris Fotakis, Laurent Gourvès, Panagiotis Patsilinakos:
On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries. CoRR abs/2408.11755 (2024) - 2023
- [j31]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project games. Theor. Comput. Sci. 940(Part): 97-111 (2023) - [c54]Dimitris Fotakis, Laurent Gourvès:
On the Distortion of Single Winner Elections with Aligned Candidates. AAMAS 2023: 1409-1411 - 2022
- [j30]Dimitris Fotakis, Laurent Gourvès:
On the distortion of single winner elections with aligned candidates. Auton. Agents Multi Agent Syst. 36(2): 37 (2022) - [j29]Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos:
In memory of Jérôme Monnot. Theor. Comput. Sci. 921: 1-3 (2022) - [c53]Pierre Cardi, Laurent Gourvès, Julien Lesca:
On Fair and Efficient Solutions for Budget Apportionment. AAMAS 2022: 1560-1562 - [c52]Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski:
Sur l'Équité via la Sélection en Séquence pour l'Allocation de Biens Indivisibles. JIAF 2022: 8-9 - 2021
- [c51]Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski:
On Fairness via Picking Sequences in Allocation of Indivisible Goods. ADT 2021: 258-272 - [c50]Pierre Cardi, Laurent Gourvès, Julien Lesca:
Worst-case Bounds for Spending a Common Budget. AAMAS 2021: 288-296 - [c49]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords Is Very Hard. ISAAC 2021: 36:1-36:16 - [c48]Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot:
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI 2021: 5:1-5:12 - [i3]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords is Very Hard. CoRR abs/2109.11203 (2021) - 2020
- [c47]Dimitris Fotakis, Laurent Gourvès, Stelios Kasouridis, Aris Pagourtzis:
Object Allocation and Positive Graph Externalities. ECAI 2020: 107-114
2010 – 2019
- 2019
- [j28]Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Ararat Harutyunyan, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski:
Local envy-freeness in house allocation problems. Auton. Agents Multi Agent Syst. 33(5): 591-627 (2019) - [j27]Laurent Gourvès:
Agreeable sets with matroidal constraints. J. Comb. Optim. 37(3): 866-888 (2019) - [j26]Laurent Gourvès, Jérôme Monnot:
On maximin share allocations in matroids. Theor. Comput. Sci. 754: 50-64 (2019) - [c46]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
Project Games. CIAC 2019: 75-86 - [c45]Katarína Cechlárová, Laurent Gourvès, Julien Lesca:
On the Problem of Assigning PhD Grants. IJCAI 2019: 130-136 - [c44]Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT 2019: 252-265 - 2018
- [j25]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset sum problems with digraph constraints. J. Comb. Optim. 36(3): 937-964 (2018) - [c43]Aurélie Beynier, Yann Chevaleyre, Laurent Gourvès, Julien Lesca, Nicolas Maudet, Anaëlle Wilczynski:
Local Envy-Freeness in House Allocation Problems. AAMAS 2018: 292-300 - [c42]Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav:
Covering Clients with Types and Budgets. ISAAC 2018: 73:1-73:12 - 2017
- [j24]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77(3): 836-866 (2017) - [j23]Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten:
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670: 1-10 (2017) - [c41]Laurent Gourvès, Jérôme Monnot:
Approximate Maximin Share Allocations in Matroids. CIAC 2017: 310-321 - [c40]Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski:
Object Allocation via Swaps along a Social Network. IJCAI 2017: 213-219 - [c39]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Selfish Transportation Games. SOFSEM 2017: 176-187 - 2016
- [c38]Laurent Gourvès, Julien Lesca, Anaëlle Wilczynski:
Strategic Voting in a Social Context: Considerate Equilibria. ECAI 2016: 1423-1431 - [c37]Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot:
Achieving Proportional Representation in Conference Programs. IJCAI 2016: 144-150 - [c36]Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot:
How Hard Is It for a Party to Nominate an Election Winner?. IJCAI 2016: 257-263 - [c35]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE 2016: 221-235 - [i2]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset Sum Problems With Digraph Constraints. CoRR abs/1609.01078 (2016) - 2015
- [j22]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate tradeoffs on weighted labeled matroids. Discret. Appl. Math. 184: 154-166 (2015) - [j21]Laurent Gourvès:
Approximating the optimal sequence of acquisitions and sales with a capped budget. Inf. Process. Lett. 115(10): 760-764 (2015) - [j20]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. Theory Comput. Syst. 57(3): 598-616 (2015) - [j19]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Worst case compromises in matroids with applications to the allocation of indivisible goods. Theor. Comput. Sci. 589: 121-140 (2015) - [j18]Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot:
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. 602: 89-102 (2015) - [c34]Laurent Gourvès:
Profitable Deviation Strong Equilibria. ADT 2015: 236-252 - 2014
- [c33]Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot:
On regular and approximately fair allocations of indivisible goods. AAMAS 2014: 997-1004 - [c32]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Near Fairness in Matroids. ECAI 2014: 393-398 - [c31]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Matroid Problem. IFIP TCS 2014: 66-77 - 2013
- [j17]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26(2): 184-201 (2013) - [j16]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of trails, paths and circuits in arc-colored digraphs. Discret. Appl. Math. 161(6): 819-828 (2013) - [j15]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a fixed number of solutions of some multiobjective maximization problems. J. Discrete Algorithms 22: 19-29 (2013) - [j14]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) - [c30]Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries:
Possible Winners in Approval Voting. ADT 2013: 57-70 - [c29]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT 2013: 171-182 - [c28]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
A Matroid Approach to the Worst Case Allocation of Indivisible Goods. IJCAI 2013: 136-142 - [c27]Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti:
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. SAGT 2013: 207-218 - [c26]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
A Protocol for Cutting Matroids Like Cakes. WINE 2013: 216-229 - 2012
- [j13]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in multiorganization matching. Algorithmic Oper. Res. 7(2) (2012) - [j12]Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
On paths, trails and closed trails in edge-colored graphs. Discret. Math. Theor. Comput. Sci. 14(2): 57-74 (2012) - [j11]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. Internet Math. 8(4): 424-455 (2012) - [c25]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate Tradeoffs on Matroids. ECAI 2012: 360-365 - [c24]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. SAGT 2012: 204-215 - [c23]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti:
Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 - 2011
- [c22]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 - [c21]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum in a Matching Game. SAGT 2011: 81-92 - [c20]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 - [c19]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246 - 2010
- [j10]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. 158(13): 1404-1417 (2010) - [j9]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. 7(1-2): 74-85 (2010) - [j8]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) - [j7]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010) - [c18]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. CIAC 2010: 155-166 - [c17]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 - [c16]Hatem Chatti, Laurent Gourvès, Jérôme Monnot:
On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282 - [c15]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. TAMC 2010: 222-233 - [c14]Laurent Gourvès, Jérôme Monnot:
The Max k-Cut Game and Its Strong Equilibria. TAMC 2010: 234-246 - [i1]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010)
2000 – 2009
- 2009
- [j6]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti:
On s-t paths and trails in edge-colored graphs. Electron. Notes Discret. Math. 35: 221-226 (2009) - [j5]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the minimum hitting set of bundles problem. Theor. Comput. Sci. 410(45): 4534-4542 (2009) - [c13]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM 2009: 621-632 - [c12]Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Selfish Scheduling with Setup Times. WINE 2009: 292-303 - [c11]Laurent Gourvès, Jérôme Monnot:
On Strong Equilibria in the Max Cut Game. WINE 2009: 608-615 - 2008
- [c10]Eric Angel, Evripidis Bampis, Laurent Gourvès:
On the Minimum Hitting Set of Bundles Problem. AAIM 2008: 3-14 - [c9]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787 - [c8]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in Multiorganization Matching. WAOA 2008: 78-91 - [c7]Laurent Gourvès, Jérôme Monnot:
Three Selfish Spanning Tree Games. WINE 2008: 465-476 - 2007
- [c6]George Christodoulou, Laurent Gourvès, Fanny Pascual:
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. COCOON 2007: 187-197 - [c5]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 - [c4]Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos:
On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE 2007: 220-231 - [r1]Laurent Gourvès, Evripidis Bampis, Eric Angel:
Approximation in Multiobjective Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j4]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation algorithms for the bi-criteria weighted MAX-CUT problem. Discret. Appl. Math. 154(12): 1685-1692 (2006) - [j3]Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game. Inf. Process. Lett. 100(1): 29-35 (2006) - 2005
- [j2]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Inf. Process. Lett. 94(1): 19-27 (2005) - [c3]Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 - [c2]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem. WG 2005: 331-340 - 2004
- [j1]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. Theor. Comput. Sci. 310(1-3): 135-146 (2004) - [p1]Eric Angel, Evripidis Bampis, Laurent Gourvès:
A Dynasearch Neighborhood for the Bicriteria Traveling Salesman Problem. Metaheuristics for Multiobjective Optimisation 2004: 153-176 - 2003
- [c1]Eric Angel, Evripidis Bampis, Laurent Gourvès:
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem. FCT 2003: 39-48
Coauthor Index
Carlos Alberto de Jesus Martinhon
aka: Carlos A. J. Martinhon
aka: Carlos A. J. Martinhon
[j31] [c48] [j26] [c46] [c44] [j25] [j24] [j23] [c41] [c39] [c37] [c36] [c35] [i2] [j22] [j20] [j19] [j18] [c33] [c32] [c31] [j17] [j16] [j15] [j14] [c30] [c29] [c28] [c26] [j13] [j12] [j11] [c25] [c24] [c23] [c21] [c20] [c19] [j10] [j9] [j8] [j7] [c18] [c17] [c16] [c15] [c14] [i1] [j6] [c13] [c12] [c11] [c9] [c8] [c7] [c5] [c4] [c3]
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 2025-04-20 23:44 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:
