Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Mauras, Simon"'
We study the problem of matching markets with ties, where one side of the market does not necessarily have strict preferences over members at its other side. For example, workers do not always have strict preferences over jobs, students can give the
Externí odkaz:
http://arxiv.org/abs/2411.03270
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 s
Externí odkaz:
http://arxiv.org/abs/2404.06293
We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is efficient
Externí odkaz:
http://arxiv.org/abs/2403.07799
Autor:
Castera, Rémi, Garrido-Lucero, Felipe, Molina, Mathieu, Mauras, Simon, Loiseau, Patrick, Perchet, Vianney
We investigate notions of group fairness in bipartite matching markets involving agents and jobs, where agents are grouped based on sensitive attributes. Employing a geometric approach, we characterize how many agents can be matched in each group, sh
Externí odkaz:
http://arxiv.org/abs/2403.00397
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 $s_i$ for the item for sale, and a public valuation function $v_i(s_1,\ld
Externí odkaz:
http://arxiv.org/abs/2402.12017
Publikováno v:
Physical Review RESEARCH 6, 033265 (2024)
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. Recen
Externí odkaz:
http://arxiv.org/abs/2312.08506
The celebrated model of auctions with interdependent valuations, introduced by Milgrom and Weber in 1982, has been studied almost exclusively under private signals $s_1, \ldots, s_n$ of the $n$ bidders and public valuation functions $v_i(s_1, \ldots,
Externí odkaz:
http://arxiv.org/abs/2310.00958
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 $\frac{1}{2}$-envy-free, ex-p
Externí odkaz:
http://arxiv.org/abs/2304.03706
A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency -- envy freene
Externí odkaz:
http://arxiv.org/abs/2302.09633
Publikováno v:
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an item in her
Externí odkaz:
http://arxiv.org/abs/2211.02004