Simon Mauras

Orcid: 0000-0003-4080-3118

Affiliations:
  • Tel Aviv University, Israel


According to our database1, Simon Mauras authored at least 19 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Truthful Matching with Online Items and Offline Agents.
Algorithmica, May, 2024

Equitable Pricing in Auctions.
CoRR, 2024

The Price of Fairness in Bipartite Matching.
CoRR, 2024

Optimal Stopping with Interdependent Values.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

On Optimal Tradeoffs between EFX and Nash Welfare.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Truthful Matching with Online Items and Offline Agents.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Constant Approximation for Private Interdependent Valuations.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model.
SIAM J. Discret. Math., 2022

2021
Analysis of random models for stable matchings. (Analyse de modèles aléatoires pour les matchings stables).
PhD thesis, 2021

Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures.
ACM Trans. Economics and Comput., 2021

Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting.
PLoS Comput. Biol., 2021

Constrained School Choice with Incomplete Information.
CoRR, 2021

Two-Sided Matching Markets with Strongly Correlated Preferences.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020
How to aggregate Top-lists: Approximation algorithms via scores and average ranks.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
On popularity-based random matching markets.
CoRR, 2019

2018
How to aggregate Top-lists: Score based approximation schemes.
CoRR, 2018

2017
Write-Optimized Skip Lists.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017


  Loading...