Person:
Procaccia, Ariel

Profile Picture

Email Address

AA Acceptance Date

Birth Date

Research Projects

Organizational Units

Job Title

Last Name

Procaccia

First Name

Ariel

Name

Procaccia, Ariel

Filters

2011 - 20123

Settings

Author's Publications: search.filters.isAuthorOfPublication.7fbfb99b-f145-4665-a9d7-67748191698a

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Publication
    Beyond Dominant Resource Fairness: Extensions, Limitations, and Indivisibilities
    (ACM Press, 2012) Parkes, David; Procaccia, Ariel; Shah, Nisarg
    We study the problem of allocating multiple resources to agents with heterogeneous demands. Technological advances such as cloud computing and data centers provide a new impetus for investigating this problem under the assumption that agents demand the resources in fixed proportions, known in economics as Leontief preferences. In a recent paper, Ghodsi et al. [2011] introduced the dominant resource fairness (DRF) mechanism, which was shown to possess highly desirable theoretical properties under Leontief preferences. We extend their results in three directions. First, we show that DRF generalizes to more expressive settings, and leverage a new technical framework to formally extend its guarantees. Second, we study the relation between social welfare and properties such as truthfulness; DRF performs poorly in terms of social welfare, but we show that this is an unavoidable shortcoming that is shared by every mechanism that satisfies one of three basic properties. Third, and most importantly, we study a realistic setting that involves indivisibilities. We chart the boundaries of the possible in this setting, contributing a new relaxed notion of fairness and providing both possibility and impossibility results.
  • Thumbnail Image
    Publication
    TurkServer: Enabling Synchronous and Longitudinal Online Experiments
    (AAAI Press, 2012) Mao, Andrew; Chen, Yiling; Gajos, Krzysztof; Parkes, David; Procaccia, Ariel; Zhang, Haoqi
    With the proliferation of online labor markets and other social computing platforms, online experiments have become a low-cost and scalable way to empirically test hypotheses and mechanisms in both human computation and social science. Yet, despite the potential in designing more powerful and expressive online experiments using multiple subjects, researchers still face many technical and logistical difficulties. We see synchronous and longitudinal experiments involving real-time interaction between participants as a dual-use paradigm for both human computation and social science, and present TurkServer, a platform that facilitates these types of experiments on Amazon Mechanical Turk. Our work has the potential to make more fruitful online experiments accessible to researchers in many different fields.
  • Thumbnail Image
    Publication
    Optimal Envy-Free Cake Cutting
    (Association for the Advancement of Artificial Intelligence Press, 2011) Cohler, Yuga Julian; Lai, John Kwang; Parkes, David; Procaccia, Ariel
    We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where each agent prefers its own allocation to any other, may not be efficient, in the sense of maximizing the total value of the agents. Our goal is to pinpoint the most efficient allocations among all envy-free allocations. We provide tractable algorithms for doing so under different assumptions regarding the preferences of the agents.