Constrained Fair Division
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Algorithmically Fair Maximization of Multiple Submodular Objective Functions and Implications to Constrained Fair Division
Announce Type: replace Abstract: Constrained maximization of submodular functions is a central problem in combinatorial optimization. In many realistic scenarios, multiple agents each need to maximize their own submodular objective over a common ground set, subject to individual constraints, with the requirement that their solutions be disjoint. We study this setting through the lens of algorithmic fairness and constrained fair division.
Anguished Parents, Crying Doctors: Life Amid Utah’s Measles Outbreak
Ben Dowse hadn’t expected to treat measles when he became a doctor, but there he was, examining a newborn exposed to the virus in the womb. The infected mother had given birth just hours earlier. The hospital had alerted Dowse to the case before delivery, and he’d braced himself for the worst.