( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On regular and approximately fair allocations of indivisible goods.

, , и . AAMAS, стр. 997-1004. IFAAMAS/ACM, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Laurent Bartholdi

Laurent Ntahuga

Thomas Laurent

Thomas Laurent

Laurent Herschke

 

Другие публикации лиц с тем же именем

Complexity and Approximation Results for the Connected Vertex Cover Problem., , и . WG, том 4769 из Lecture Notes in Computer Science, стр. 202-213. Springer, (2007)Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs., , , и . TAMC, том 6108 из Lecture Notes in Computer Science, стр. 222-233. Springer, (2010)Selfish Scheduling with Setup Times., , и . WINE, том 5929 из Lecture Notes in Computer Science, стр. 292-303. Springer, (2009)On a Simple Hedonic Game with Graph-Restricted Communication., , и . SAGT, том 11801 из Lecture Notes in Computer Science, стр. 252-265. Springer, (2019)Strategic Voting in a Social Context: Considerate Equilibria., , и . ECAI, том 285 из Frontiers in Artificial Intelligence and Applications, стр. 1423-1431. IOS Press, (2016)Selfish Transportation Games., , и . SOFSEM, том 10139 из Lecture Notes in Computer Science, стр. 176-187. Springer, (2017)Object Allocation via Swaps along a Social Network., , и . IJCAI, стр. 213-219. ijcai.org, (2017)Strategy-Proof Mechanisms for Facility Location Games with Many Facilities., , , , и . ADT, том 6992 из Lecture Notes in Computer Science, стр. 67-81. Springer, (2011)The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet., , , и . WABI, том 201 из LIPIcs, стр. 5:1-5:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On regular and approximately fair allocations of indivisible goods., , и . AAMAS, стр. 997-1004. IFAAMAS/ACM, (2014)