default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Mauras
Person information
- affiliation: Tel Aviv University, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Michal Feldman, Federico Fusco
, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. Algorithmica 86(5): 1600-1622 (2024)- [c7]Michal Feldman, Simon Mauras, Tomasz Ponitka:
On Optimal Tradeoffs between EFX and Nash Welfare. AAAI 2024: 9688-9695 - [i13]Alon Eden, Michal Feldman, Simon Mauras, Divyarthi Mohan:
Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids. CoRR abs/2402.12017 (2024) - [i12]Rémi Castera, Felipe Garrido-Lucero, Mathieu Molina, Simon Mauras, Patrick Loiseau, Vianney Perchet:
The Price of Fairness in Bipartite Matching. CoRR abs/2403.00397 (2024) - [i11]Simon Finster, Patrick Loiseau, Simon Mauras, Mathieu Molina, Bary S. R. Pradelski:
Equitable Pricing in Auctions. CoRR abs/2403.07799 (2024) - [i10]Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser:
Optimal Stopping with Interdependent Values. CoRR abs/2404.06293 (2024) - 2023
- [c6]Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan:
Constant Approximation for Private Interdependent Valuations. FOCS 2023: 148-163 - [c5]Michal Feldman, Federico Fusco, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. ICALP 2023: 58:1-58:20 - [i9]Michal Feldman, Simon Mauras, Tomasz Ponitka:
On Optimal Tradeoffs between EFX and Nash Welfare. CoRR abs/2302.09633 (2023) - [i8]Michal Feldman, Simon Mauras, Vishnu V. Narayan, Tomasz Ponitka:
Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations. CoRR abs/2304.03706 (2023) - [i7]Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan:
Constant Approximation for Private Interdependent Valuations. CoRR abs/2310.00958 (2023) - 2022
- [j3]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. SIAM J. Discret. Math. 36(1): 355-382 (2022) - [i6]Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras, Rebecca Reiffenhäuser:
Truthful Matching with Online Items and Offline Agents. CoRR abs/2211.02004 (2022) - 2021
- [b1]Simon Mauras:
Analysis of random models for stable matchings. (Analyse de modèles aléatoires pour les matchings stables). Université Paris Cité, France, 2021 - [j2]Simon Mauras, Vincent Cohen-Addad, Guillaume Duboc, Max Dupré la Tour, Paolo Frasca, Claire Mathieu, Lulla Opatowski, Laurent Viennot:
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting. PLoS Comput. Biol. 17(8) (2021) - [j1]Simon Mauras:
Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures. ACM Trans. Economics and Comput. 9(4): 24:1-24:14 (2021) - [c4]Hugo Gimbert, Claire Mathieu, Simon Mauras:
Two-Sided Matching Markets with Strongly Correlated Preferences. FCT 2021: 3-17 - [i5]Hugo Gimbert, Claire Mathieu, Simon Mauras:
Constrained School Choice with Incomplete Information. CoRR abs/2109.09089 (2021) - 2020
- [c3]Simon Mauras:
Two-sided Random Matching Markets: Ex-ante Equivalence of the Deferred Acceptance Procedures. EC 2020: 585-597 - [c2]Claire Mathieu, Simon Mauras:
How to aggregate Top-lists: Approximation algorithms via scores and average ranks. SODA 2020: 2810-2822 - [i4]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. CoRR abs/2002.05477 (2020) - [i3]Simon Mauras:
Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures. CoRR abs/2005.08584 (2020)
2010 – 2019
- 2019
- [i2]Hugo Gimbert, Claire Mathieu, Simon Mauras:
On popularity-based random matching markets. CoRR abs/1904.03890 (2019) - 2018
- [i1]Claire Mathieu, Simon Mauras:
How to aggregate Top-lists: Score based approximation schemes. CoRR abs/1811.01537 (2018) - 2017
- [c1]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia A. Phillips, Helen Xu:
Write-Optimized Skip Lists. PODS 2017: 69-78
Coauthor Index
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 2024-10-24 20:32 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:
