#  A Simple, General Framework for Fair Allocation Under Matroid Rank Valuations 

 



####  calendar\_today Date and Time 

 **October 14, 2022** 

 01:00PM - 02:30PM EDT 

####  pin\_drop Location 

 **SEC 1.413, and streamed via Zoom: https://harvard.zoom.us/j/95184948637?pwd=bXBIc2U5MEZ0QmRUb01WQ0o0SXRCdz09**  



 

 



 

 Abstract:

 We study the problem of fairly allocating a set of indivisible goods among agents with matroid rank valuations. We present a simple framework that efficiently computes any fairness objective that satisfies some mild assumptions. Along with maximizing a fairness objective, the framework is guaranteed to run in polynomial time, maximize utilitarian social welfare and ensure strategyproofness. Our framework can be used to achieve four different fairness objectives: (a) Prioritized Lorenz dominance, (b) Maxmin fairness, (c) Weighted leximin, and (d) Max weighted Nash welfare. In particular, our framework provides the first polynomial time algorithms to compute weighted leximin and max. weighted Nash welfare allocations for matroid rank valuations.

 As always, the talk will be **1pm-2pm** Eastern Time in **SEC 1.413**, and streamed via Zoom at the usual link:

 [https://harvard.zoom.us/j/95184948637?pwd=bXBIc2U5MEZ0QmRUb01WQ0o0SXRCdz09](https://urldefense.proofpoint.com/v2/url?u=https-3A__harvard.zoom.us_j_95184948637-3Fpwd-3DbXBIc2U5MEZ0QmRUb01WQ0o0SXRCdz09&d=DwMFaQ&c=WO-RGvefibhHBZq3fL85hQ&r=ZOP6tLIqLOHbdgCvrXjUlPta0tw7K_-ivqiItQhh6LQ&m=X61RNjLiM7vZVopGz0NC8LwPWBx3mD_uItRmLTCx7BpNx-Hhie7PciziLB6xngDS&s=TuRCafjrPRp9amaFXvCln68thpWokhLWQhq1jdZ--O0&e=)



 

 



 

 See also:- [ Fall 2022 Econ CS Seminars ](/taxonomycalendarseminar/fall-2022)
 
 

 Share on:- [     Facebook ](#)
- [     Twitter ](#)
- [     Linkedin ](#)
 


 Save: [ Add to calendar calendar\_today ](https://econcs.seas.harvard.edu/node/1654402/event-feed.ics)  Copy link link