==== Publications ====

You can find a list of publications on [[https://dblp.uni-trier.de/pers/hd/m/Mauras:Simon|DBLP]], [[https://www.semanticscholar.org/author/S.-Mauras/10673138|Semantic scholar]], [[https://scholar.google.fr/citations?user=iAq80sEAAAAJ|Google Scholar]] or [[http://arxiv.org/a/mauras_s_1|ArXiv]].

=== Algorithmic Game Theory ===
| **Fair Division** |
| On Optimal Tradeoffs between EFX and Nash Welfare [Feldman, Mauras, Ponitka] | Working paper |[[https://arxiv.org/abs/2302.09633|[arXiv]]] |
| Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations [Feldman, Mauras, Narayan, Ponitka] | Working paper |[[https://arxiv.org/abs/2304.03706|[arXiv]]] |
| **Mechanism Design** |
| Constant Approximation for Private Interdependent Valuations [Eden, Feldman, Goldner, Mauras, Mohan] | FOCS 2023 | [[https://arxiv.org/abs/2310.00958|[arXiv]]]|
| Truthful Matching with Online Items and Offline Agents [Feldman, Fusco, Leonardi, Mauras, Reiffenhäuser] | [[https://doi.org/10.4230/LIPIcs.ICALP.2023.58|ICALP 2023]] | [[https://arxiv.org/abs/2211.02004|[arXiv]]] |
| **Matchings Markets** |
| Constrained School Choice with Incomplete Information [Gimbert, Mathieu, Mauras] | Working paper |[[https://arxiv.org/abs/2109.09089|[arXiv]]] |
| Two-Sided Matching Markets with Correlated Preferences have Few Stable Pairs [Gimbert, Mathieu, Mauras] | Working paper |[[https://arxiv.org/abs/1904.03890|[arXiv]]] |
| Two-Sided Matching Markets with Strongly Correlated Preferences [Gimbert, Mathieu, Mauras] | [[https://doi.org/10.1007/978-3-030-86593-1_1|FCT 2021]] ||
| Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures [Mauras] | [[https://doi.org/10.1145/3391403.3399448|EC 2020]], [[https://doi.org/10.1145/3485010|TEAC 2021]] | [[https://arxiv.org/abs/2005.08584|[arXiv]]] |

=== Algorithm Design ===
| Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model [Huang, Kakimura, Mauras, Yoshida] | [[https://doi.org/10.1137/20M1357317|SIDMA 2022]] |[[https://arxiv.org/abs/2002.05477|[arXiv]]] |
| How to aggregate Top-lists: Approximation algorithms via scores and average ranks [Mathieu, Mauras] | [[https://doi.org/10.1137/1.9781611975994.171|SODA 2020]] |[[https://arxiv.org/abs/1811.01537|[arXiv]]] |
| Write-Optimized Skip Lists [Bender, Farach-Colton, Johnson, Mauras, Mayer, Phillips, Xu]  | [[https://doi.org/10.1145/3034786.3056117|PODS 2017]] | |

=== Scientific mobility ===
| Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting [Mauras, Cohen-Addad, Duboc, Dupré la Tour, Frasca, Mathieu , Opatowski, Viennot] | [[https://doi.org/10.1371/journal.pcbi.1009264|PLOS Comp. Biol.]] |[[https://doi.org/10.1101/2020.11.09.20228007|[medRxiv]]] |


=== Ongoing projects ===
I have several ongoing projects, more informations are available here:
  * [[stablematchings|Stable Matchings]]