Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387185501> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W4387185501 abstract "Matching problems with group-fairness constraints and diversity constraints have numerous applications such as in allocation problems, committee selection, school choice, etc. Moreover, online matching problems have lots of applications in ad allocations and other e-commerce problems like product recommendation in digital marketing. We study two problems involving assigning items to platforms, where items belong to various groups depending on their attributes; the set of items are available offline and the platforms arrive online. In the first problem, we study online matchings with proportional fairness constraints. Here, each platform on arrival should either be assigned a set of items in which the fraction of items from each group is within specified bounds or be assigned no items; the goal is to assign items to platforms in order to maximize the number of items assigned to platforms. In the second problem, we study online matchings with diversity constraints, i.e. for each platform, absolute lower bounds are specified for each group. Each platform on arrival should either be assigned a set of items that satisfy these bounds or be assigned no items; the goal is to maximize the set of platforms that get matched. We study approximation algorithms and hardness results for these problems. The technical core of our proofs is a new connection between these problems and the problem of matchings in hypergraphs. Our experimental evaluation shows the performance of our algorithms on real-world and synthetic datasets exceeds our theoretical guarantees." @default.
- W4387185501 created "2023-09-30" @default.
- W4387185501 creator A5022225101 @default.
- W4387185501 creator A5042768493 @default.
- W4387185501 creator A5059269053 @default.
- W4387185501 creator A5059653613 @default.
- W4387185501 date "2023-09-28" @default.
- W4387185501 modified "2023-09-30" @default.
- W4387185501 title "Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints" @default.
- W4387185501 doi "https://doi.org/10.3233/faia230442" @default.
- W4387185501 hasPublicationYear "2023" @default.
- W4387185501 type Work @default.
- W4387185501 citedByCount "0" @default.
- W4387185501 crossrefType "book-chapter" @default.
- W4387185501 hasAuthorship W4387185501A5022225101 @default.
- W4387185501 hasAuthorship W4387185501A5042768493 @default.
- W4387185501 hasAuthorship W4387185501A5059269053 @default.
- W4387185501 hasAuthorship W4387185501A5059653613 @default.
- W4387185501 hasBestOaLocation W43871855011 @default.
- W4387185501 hasConcept C105795698 @default.
- W4387185501 hasConcept C108710211 @default.
- W4387185501 hasConcept C11413529 @default.
- W4387185501 hasConcept C126255220 @default.
- W4387185501 hasConcept C149629883 @default.
- W4387185501 hasConcept C154945302 @default.
- W4387185501 hasConcept C165064840 @default.
- W4387185501 hasConcept C177264268 @default.
- W4387185501 hasConcept C178790620 @default.
- W4387185501 hasConcept C185592680 @default.
- W4387185501 hasConcept C196921405 @default.
- W4387185501 hasConcept C199360897 @default.
- W4387185501 hasConcept C2524010 @default.
- W4387185501 hasConcept C2781311116 @default.
- W4387185501 hasConcept C33923547 @default.
- W4387185501 hasConcept C41008148 @default.
- W4387185501 hasConcept C80444323 @default.
- W4387185501 hasConcept C81917197 @default.
- W4387185501 hasConceptScore W4387185501C105795698 @default.
- W4387185501 hasConceptScore W4387185501C108710211 @default.
- W4387185501 hasConceptScore W4387185501C11413529 @default.
- W4387185501 hasConceptScore W4387185501C126255220 @default.
- W4387185501 hasConceptScore W4387185501C149629883 @default.
- W4387185501 hasConceptScore W4387185501C154945302 @default.
- W4387185501 hasConceptScore W4387185501C165064840 @default.
- W4387185501 hasConceptScore W4387185501C177264268 @default.
- W4387185501 hasConceptScore W4387185501C178790620 @default.
- W4387185501 hasConceptScore W4387185501C185592680 @default.
- W4387185501 hasConceptScore W4387185501C196921405 @default.
- W4387185501 hasConceptScore W4387185501C199360897 @default.
- W4387185501 hasConceptScore W4387185501C2524010 @default.
- W4387185501 hasConceptScore W4387185501C2781311116 @default.
- W4387185501 hasConceptScore W4387185501C33923547 @default.
- W4387185501 hasConceptScore W4387185501C41008148 @default.
- W4387185501 hasConceptScore W4387185501C80444323 @default.
- W4387185501 hasConceptScore W4387185501C81917197 @default.
- W4387185501 hasLocation W43871855011 @default.
- W4387185501 hasOpenAccess W4387185501 @default.
- W4387185501 hasPrimaryLocation W43871855011 @default.
- W4387185501 hasRelatedWork W2037687679 @default.
- W4387185501 hasRelatedWork W2125356288 @default.
- W4387185501 hasRelatedWork W2128302072 @default.
- W4387185501 hasRelatedWork W2361490677 @default.
- W4387185501 hasRelatedWork W2386767533 @default.
- W4387185501 hasRelatedWork W2606073172 @default.
- W4387185501 hasRelatedWork W2952399753 @default.
- W4387185501 hasRelatedWork W2970622411 @default.
- W4387185501 hasRelatedWork W3139262068 @default.
- W4387185501 hasRelatedWork W4300878902 @default.
- W4387185501 isParatext "false" @default.
- W4387185501 isRetracted "false" @default.
- W4387185501 workType "book-chapter" @default.