Results 1 
7 of
7
Improved approximation for 3dimensional matching via bounded pathwidth local search
 In 54th IEEE Annual Symposium on Foundations of Computer Science (FOCS
, 2013
"... ar ..."
(Show Context)
Combinatorial Algorithm for Restricted MaxMin Fair Allocation
, 2014
"... We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configurationLP can be used to estima ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configurationLP can be used to estimate the value of the optimal allocation to within a factor of 4 + ε. In contrast, however, the best known approximation algorithm for the problem has an unspecified large constant guarantee. In this paper we significantly narrow this gap by giving a 13approximation algorithm for the problem. Our approach develops a local search technique introduced by Haxell [Hax95] for hypergraph matchings, and later used in this context by Asadpour, Feige, and Saberi [AFS12]. For our local search procedure to terminate in polynomial time, we introduce several new ideas such as lazy updates and greedy players. Besides the improved approximation guarantee, the highlight of our approach is that it is purely combinatorial and uses the configurationLP only in the analysis.
PTAS for Ordered Instances of Resource Allocation Problems
, 2013
"... We consider the problem of fair allocation of indivisible goods where we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj> 0 for a subset of customers interested in j and it has no value ..."
Abstract
 Add to MetaCart
We consider the problem of fair allocation of indivisible goods where we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj> 0 for a subset of customers interested in j and it has no value for other customers. The goal is to find a feasible allocation of the resources to the interested customers such that in the MaxMin scenario (also known as Santa Claus problem) the minimum utility (sum of the resources) received by each of the customers is as high as possible and in the MinMax case (also known as R   Cmax problem), the maximum utility is as low as possible. In this paper we are interested in instances of the problem that admit a PTAS. These instances are not only of theoretical interest but also have practical applications. For the MaxMin allocation problem, we start with instances of the problem that can be viewed as a convex bipartite graph; there exists an ordering of the resources such that each customer is interested (has positive evaluation) in a set of consecutive resources and we demonstrate a PTAS. For the MinMax allocation problem, we obtain a PTAS for instances in which there is an ordering of the customers (machines) and each resource (job) is adjacent to a consecutive set of customers (machines). Next we show that our method for the MaxMin scenario, can be extended to a broader class of bipartite graphs where the resources can be viewed as a tree and each customer is interested in a subtree of a bounded number of leaves of this tree (e.g. a subpath).
Acknowledgements:
, 2002
"... The Working Paper Series is intended to report preliminary results of researchinprogress. Comments are welcome. This paper looks at a form of caring labor that has been neglected by students both of care work and of emotional labor in the workplace: luxury service. Drawing on 12 months of ethnogra ..."
Abstract
 Add to MetaCart
(Show Context)
The Working Paper Series is intended to report preliminary results of researchinprogress. Comments are welcome. This paper looks at a form of caring labor that has been neglected by students both of care work and of emotional labor in the workplace: luxury service. Drawing on 12 months of ethnography in two luxury hotels and 50 interviews with participants, I demonstrate that many of the elements that differentiate luxury service from nonluxury service are indicators of care. These include personalization; anticipation, legitimation, and resolution of needs; sincerity and authenticity; and available physical labor, both visibly and invisibly displayed. In contrast to some kinds of marketized care work, such as elder care, in which commodification and bureaucratization have led to the elimination of these intangible dimensions of care, in luxury service, these “extra ” elements are the key to profit and are therefore emphasized by management. My evidence further indicates that the “needs ” that are met in the luxury hotel are also often acquired there, as guests describe a process of learning what they are supposed to want and to do in the hotel. I argue that this process of consumption of care in the luxury environment produces and reinforces a particular sense of self as especially entitled to consume care, which in turn creates class dispositions significant for guests ’ consumption and interpersonal relations beyond the
Strong LP formulations for scheduling splittable jobs on unrelated machines
, 2015
"... ..."
(Show Context)
SEE PROFILE
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Math. Program., Ser. B DOI 10.1007/s1010701408318 FULL LENGTH PAPER
, 2014
"... Strong LP formulations for scheduling splittable jobs on unrelated machines ..."
Abstract
 Add to MetaCart
Strong LP formulations for scheduling splittable jobs on unrelated machines