Abstract
The pipage rounding technique of Ageev & Sviridenko is combined with the recent rounding method developed by Srinivasan. The aim is to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. A useful feature of the method is that it allows to prove certain (probabilistic) per-user fairness properties.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 323-332 |
| Number of pages | 10 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 2002 |
| Externally published | Yes |
| Event | The 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada Duration: Nov 16 2002 → Nov 19 2002 |
ASJC Scopus subject areas
- Hardware and Architecture