Simon Mauras
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Simon Mauras has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Divyarthi Mohan
School of Computer Science, Tel Aviv University
3 shared publications - Michal Feldman
Tel Aviv University and Microsoft ILDC Israel
3 shared publications - Rebecca Reiffenhäuser
University of Amsterdam, Amsterdam, Netherlands
2 shared publications - Adrian Vetta
McGill University
1 shared publication - Alon Eden
Hebrew University, Jerusalem, Israel
1 shared publication - Bary S. R. Pradelski
Department of Economics Merton College Department of Economics CNRS Maison Française d'Oxford University of Oxford University of Oxford
1 shared publication
Latest Publications
- 4 September 2025
- Published by Elsevier in Games and Economic Behavior
- Vol. 154, 53-61
A direct proof of the short-side advantage in random matching markets
- 4 September 2025
- Published by Elsevier in Games and Economic Behavior
- Vol. 154, 53-61
A direct proof of the short-side advantage in random matching markets
- Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 189-205
Online Combinatorial Allocation with Interdependent Values
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 189-205
Open AccessOnline Combinatorial Allocation with Interdependent Values
- Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 304
Equitable Auctions
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 304
Open AccessEquitable Auctions
- Open Access
- 9 September 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033265
Correlating light fields through disordered media across multiple degrees of freedom
Speckle patterns are inherent features of coherent light propagation through complex media. As a result of interference, they are sensitive to multiple experimental parameters such as the configuration of disorder or the propagating wavelength. Recent developments in wavefront shaping have made it possible to control speckle pattern statistics and correlations, for example using the concept of the transmission matrix. In this article, we address the problem of correlating scattered fields across multiple degrees of freedom. We highlight the common points between the specific techniques already demonstrated, and we propose a general framework based on the singular value decomposition of a linear combination of multiple transmission matrices. Following analytical predictions, we experimentally illustrate the technique on spectral and temporal correlations, and we show that both the amplitude and the phase of the field correlations can be tuned. Our work opens up new perspectives in speckle correlation manipulation, with potential applications in coherent control. Published by the American Physical Society 2024
- 9 September 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033265
Open AccessCorrelating light fields through disordered media across multiple degrees of freedom
Speckle patterns are inherent features of coherent light propagation through complex media. As a result of interference, they are sensitive to multiple experimental parameters such as the configuration of disorder or the propagating wavelength. Recent developments in wavefront shaping have made it possible to control speckle pattern statistics and correlations, for example using the concept of the transmission matrix. In this article, we address the problem of correlating scattered fields across multiple degrees of freedom. We highlight the common points between the specific techniques already demonstrated, and we propose a general framework based on the singular value decomposition of a linear combination of multiple transmission matrices. Following analytical predictions, we experimentally illustrate the technique on spectral and temporal correlations, and we show that both the amplitude and the phase of the field correlations can be tuned. Our work opens up new perspectives in speckle correlation manipulation, with potential applications in coherent control. Published by the American Physical Society 2024
- Open Access
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1236-1266
Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations
We study best-of-both-worlds guarantees for the fair division of indivisible items among agents with subadditive valuations. Our main result establishes the existence of a random allocation that is simultaneously ex-ante 1/2-envy-free, ex-post 1/2-EFX and ex-post EF1, for every instance with subadditive valuations. We achieve this result by a novel polynomial-time algorithm that randomizes the well-established envy cycles procedure in a way that provides ex-ante fairness. Notably, this is the first best-of-both-worlds fairness guarantee for subadditive valuations, even when considering only EF1 without EFX.
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1236-1266
Open AccessBreaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations
We study best-of-both-worlds guarantees for the fair division of indivisible items among agents with subadditive valuations. Our main result establishes the existence of a random allocation that is simultaneously ex-ante 1/2-envy-free, ex-post 1/2-EFX and ex-post EF1, for every instance with subadditive valuations. We achieve this result by a novel polynomial-time algorithm that randomizes the well-established envy cycles procedure in a way that provides ex-ante fairness. Notably, this is the first best-of-both-worlds fairness guarantee for subadditive valuations, even when considering only EF1 without EFX.
- Open Access
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 246-265
Optimal Stopping with Interdependent Values
We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a private signal and the value of an agent is a function of the signals held by all agents. Results in online selection crucially rely on some degree of independence of values, which is conceptually at odds with the interdependent values model. For prophet and secretary models under the standard independent values assumption, prior works provide constant factor approximations to the welfare. On the other hand, when agents have interdependent values, prior works in Economics and Computer Science provide truthful mechanisms that obtain optimal and approximately optimal welfare under certain assumptions on the valuation functions. We bring together these two important lines of work and provide the first constant factor approximations for prophet and secretary problems with interdependent values. We consider both the algorithmic setting, where agents are non-strategic (but have interdependent values), and the mechanism design setting with strategic agents. All our results are constructive and use simple stopping rules.
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 246-265
Open AccessOptimal Stopping with Interdependent Values
We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a private signal and the value of an agent is a function of the signals held by all agents. Results in online selection crucially rely on some degree of independence of values, which is conceptually at odds with the interdependent values model. For prophet and secretary models under the standard independent values assumption, prior works provide constant factor approximations to the welfare. On the other hand, when agents have interdependent values, prior works in Economics and Computer Science provide truthful mechanisms that obtain optimal and approximately optimal welfare under certain assumptions on the valuation functions. We bring together these two important lines of work and provide the first constant factor approximations for prophet and secretary problems with interdependent values. We consider both the algorithmic setting, where agents are non-strategic (but have interdependent values), and the mechanism design setting with strategic agents. All our results are constructive and use simple stopping rules.
- Open Access
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 448-464
Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
We study auction design within the widely acclaimed model of interdependent values, introduced by Milgrom and Weber [1982]. In this model, every bidder i has a private signal si for the item for sale, and a public valuation function υi (s1, ..., sn) which maps every vector of private signals (of all bidders) into a real value. A recent line of work established the existence of approximately-optimal mechanisms within this framework, even in the more challenging scenario where each bidder's valuation function υi is also private. This body of work has primarily focused on single-item auctions with two natural classes of valuations: those exhibiting submodularity over signals (SOS) and d-critical valuations. In this work we advance the state of the art on interdependent values with private valuation functions, with respect to both SOS and d-critical valuations. For SOS valuations, we devise a new mechanism that gives an improved approximation bound of 5 for single-item auctions. This mechanism employs a novel variant of an "eating mechanism", leveraging LP-duality to achieve feasibility with reduced welfare loss. For d-critical valuations, we broaden the scope of existing results beyond single-item auctions, introducing a mechanism that gives a (d + 1)-approximation for any environment with matroid feasibility constraints on the set of agents that can be simultaneously served. Notably, this approximation bound is tight, even with respect to single-item auctions.
- 8 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 448-464
Open AccessPrivate Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
We study auction design within the widely acclaimed model of interdependent values, introduced by Milgrom and Weber [1982]. In this model, every bidder i has a private signal si for the item for sale, and a public valuation function υi (s1, ..., sn) which maps every vector of private signals (of all bidders) into a real value. A recent line of work established the existence of approximately-optimal mechanisms within this framework, even in the more challenging scenario where each bidder's valuation function υi is also private. This body of work has primarily focused on single-item auctions with two natural classes of valuations: those exhibiting submodularity over signals (SOS) and d-critical valuations. In this work we advance the state of the art on interdependent values with private valuation functions, with respect to both SOS and d-critical valuations. For SOS valuations, we devise a new mechanism that gives an improved approximation bound of 5 for single-item auctions. This mechanism employs a novel variant of an "eating mechanism", leveraging LP-duality to achieve feasibility with reduced welfare loss. For d-critical valuations, we broaden the scope of existing results beyond single-item auctions, introducing a mechanism that gives a (d + 1)-approximation for any environment with matroid feasibility constraints on the set of agents that can be simultaneously served. Notably, this approximation bound is tight, even with respect to single-item auctions.
- Open Access
- 16 October 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Economics and Computation
- Vol. 9 (4) , 1-14
Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures
Stable matching in a community consisting of N men and N women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal work by Gale and Shapley. When the input preference profile is generated from a distribution, we study the output distribution of two stable matching procedures: women-proposing-deferred-acceptance and men-proposing-deferred-acceptance. We show that the two procedures are ex-ante equivalent—that is, under certain conditions on the input distribution, their output distributions are identical. In terms of technical contributions, we generalize (to the non-uniform case) an integral formula, due to Knuth and Pittel, which gives the probability that a fixed matching is stable. Using an inclusion-exclusion principle on the set of rotations, we give a new formula that gives the probability that a fixed matching is the women/men-optimal stable matching.
- 16 October 2021
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Economics and Computation
- Vol. 9 (4) , 1-14
Open AccessTwo-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures
Stable matching in a community consisting of N men and N women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal work by Gale and Shapley. When the input preference profile is generated from a distribution, we study the output distribution of two stable matching procedures: women-proposing-deferred-acceptance and men-proposing-deferred-acceptance. We show that the two procedures are ex-ante equivalent—that is, under certain conditions on the input distribution, their output distributions are identical. In terms of technical contributions, we generalize (to the non-uniform case) an integral formula, due to Knuth and Pittel, which gives the probability that a fixed matching is stable. Using an inclusion-exclusion principle on the set of rotations, we give a new formula that gives the probability that a fixed matching is the women/men-optimal stable matching.
- Open Access
- 26 August 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (8) , e1009264
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting
The COVID-19 epidemic has forced most countries to impose contact-limiting restrictions at workplaces, universities, schools, and more broadly in our societies. Yet, the effectiveness of these unprecedented interventions in containing the virus spread remain largely unquantified. Here, we develop a simulation study to analyze COVID-19 outbreaks on three real-life contact networks stemming from a workplace, a primary school and a high school in France. Our study provides a fine-grained analysis of the impact of contact-limiting strategies at workplaces, schools and high schools, including: (1) Rotating strategies, in which workers are evenly split into two shifts that alternate on a daily or weekly basis; and (2) On-Off strategies, where the whole group alternates periods of normal work interactions with complete telecommuting. We model epidemics spread in these different setups using a stochastic discrete-time agent-based transmission model that includes the coronavirus most salient features: super-spreaders, infectious asymptomatic individuals, and pre-symptomatic infectious periods. Our study yields clear results: the ranking of the strategies, based on their ability to mitigate epidemic propagation in the network from a first index case, is the same for all network topologies (workplace, primary school and high school). Namely, from best to worst: Rotating week-by-week, Rotating day-by-day, On-Off week-by-week, and On-Off day-by-day. Moreover, our results show that below a certain threshold for the original local reproduction number within the network (< 1.52 for primary schools, < 1.30 for the workplace, < 1.38 for the high school, and < 1.55 for the random graph), all four strategies efficiently control outbreak by decreasing effective local reproduction number to < 1. These results can provide guidance for public health decisions related to telecommuting.- 26 August 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (8) , e1009264
Open AccessMitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting
The COVID-19 epidemic has forced most countries to impose contact-limiting restrictions at workplaces, universities, schools, and more broadly in our societies. Yet, the effectiveness of these unprecedented interventions in containing the virus spread remain largely unquantified. Here, we develop a simulation study to analyze COVID-19 outbreaks on three real-life contact networks stemming from a workplace, a primary school and a high school in France. Our study provides a fine-grained analysis of the impact of contact-limiting strategies at workplaces, schools and high schools, including: (1) Rotating strategies, in which workers are evenly split into two shifts that alternate on a daily or weekly basis; and (2) On-Off strategies, where the whole group alternates periods of normal work interactions with complete telecommuting. We model epidemics spread in these different setups using a stochastic discrete-time agent-based transmission model that includes the coronavirus most salient features: super-spreaders, infectious asymptomatic individuals, and pre-symptomatic infectious periods. Our study yields clear results: the ranking of the strategies, based on their ability to mitigate epidemic propagation in the network from a first index case, is the same for all network topologies (workplace, primary school and high school). Namely, from best to worst: Rotating week-by-week, Rotating day-by-day, On-Off week-by-week, and On-Off day-by-day. Moreover, our results show that below a certain threshold for the original local reproduction number within the network (< 1.52 for primary schools, < 1.30 for the workplace, < 1.38 for the high school, and < 1.55 for the random graph), all four strategies efficiently control outbreak by decreasing effective local reproduction number to < 1. These results can provide guidance for public health decisions related to telecommuting.