activity
20222026
most citedExploring Families' Use and Mediation of Generative AI: A Multi-User Perspective

4 citations · 5 across the 17 of their papers we have counts for

collaborators

20 papers

cs.DS2026

A General Framework for Matching with Delays

Sara Ahmadian, Shuchi Chawla, Ravi Kumar +2

We present a simple deterministic -competitive algorithm for the online minimum-cost perfect matching with delays (MPMD) problem on arbitrary, unknown metric spaces, whe…

cs.DS2026

Multi-Level Aggregation via Dual Fitting: An -Competitive Algorithm

Sara Ahmadian, Shuchi Chawla, Ravi Kumar +2

We present a new online algorithm for the well-known Multi-Level Aggregation Problem (MLAP) with arbitrary delay functions, achieving a -competitive ratio, where is the dep…

cs.AI2026

AI Alignment From Social Choice Perspectives

Daniel Halpern, Evi Micha, Ariel D. Procaccia +3

Alignment from human feedback uses human judgments about model outputs to steer the behavior of language models after pretraining. When those judgments reflect conflicting views of…

cs.GT2026

Finding Common Ground in a Sea of Alternatives

Jay Chooi, Paul Gölz, Ariel D. Procaccia +2

We study the problem of selecting a statement that finds common ground across diverse population preferences. Generative AI is uniquely suited for this task because it can access a…

cs.HC2026

"It's like a pet...but my pet doesn't collect data about me": Multi-person Households' Privacy Design Preferences for Household Robots

Jennica Li, Shirley Zhang, Dakota Sullivan +4

Household robots boasting mobility, more sophisticated sensors, and powerful processing models have become increasingly prevalent in the commercial market. However, these features…

cs.GT2026

Truthful Fair Division under Stochastic Valuations

Daniel Halpern, Alexandros Psomas, Shirley Zhang

We study no-money mechanisms for allocating indivisible items to strategic agents with additive preferences under a stochastic model. In this model, items' values are drawn from an…

cs.RO2025

Benchmarking LLM Privacy Recognition for Social Robot Decision Making

Dakota Sullivan, Shirley Zhang, Jennica Li +3

While robots have previously utilized rule-based systems or probabilistic models for user interaction, the rapid evolution of large language models (LLMs) presents new opportunitie…

cs.LG2025

Metritocracy: Representative Metrics for Lite Benchmarks

Ariel Procaccia, Benjamin Schiffer, Serena Wang +1

A common problem in LLM evaluation is how to choose a subset of metrics from a full suite of possible metrics. Subset selection is usually done for efficiency or interpretability r…

cs.HC2025★ 4 cited

Exploring Families' Use and Mediation of Generative AI: A Multi-User Perspective

Shirley Zhang, Dakota Sullivan, Jennica Li +4

Generative AI (GenAI) platforms, such as ChatGPT, have gained popularity among the public due to their ease of access, use, and support of educational and creative activities. Desp…

cs.HC2025

"Impressively Scary:" Exploring User Perceptions and Reactions to Unraveling Machine Learning Models in Social Media Applications

Jack West, Bengisu Cagiltay, Shirley Zhang +3

Machine learning models deployed locally on social media applications are used for features, such as face filters which read faces in-real time, and they expose sensitive attribute…

cs.LG2025

Clone-Robust AI Alignment

Ariel D. Procaccia, Benjamin Schiffer, Shirley Zhang

A key challenge in training Large Language Models (LLMs) is properly aligning them with human preferences. Reinforcement Learning with Human Feedback (RLHF) uses pairwise compariso…

cs.GT2025

Improved Regret Bounds for Online Fair Division with Bandit Learning

Benjamin Schiffer, Shirley Zhang

We study online fair division when there are a finite number of item types and the player values for the items are drawn randomly from distributions with unknown means. In this set…

cs.HC2024

Automatically Detecting Online Deceptive Patterns

Asmit Nayak, Shirley Zhang, Yash Wani +2

Deceptive patterns in digital interfaces manipulate users into making unintended decisions, exploiting cognitive biases and psychological vulnerabilities. These patterns have becom…

cs.GT2024

Honor Among Bandits: No-Regret Learning for Online Fair Division

Ariel D. Procaccia, Benjamin Schiffer, Shirley Zhang

We consider the problem of online fair division of indivisible goods to players when there are a finite number of types of goods and player values are drawn from distributions with…

cs.GT2024

Multi-Apartment Rent Division

Ariel D. Procaccia, Benjamin Schiffer, Shirley Zhang

Rent division is the well-studied problem of fairly assigning rooms and dividing rent among a set of roommates within a single apartment. A shortcoming of existing solutions is tha…

cs.GT2024

Multi-District School Choice: Playing on Several Fields

Yannai A. Gonczarowski, Michael Yin, Shirley Zhang

We extend the seminal model of Pathak and Sönmez (2008) to a setting with multiple school districts, each running its own separate centralized match, and focus on the case of two d…

cs.DS2024

Online Flexible Busy Time Scheduling on Heterogeneous Machines

Gruia Calinescu, Adrian Calinescu, Sami Davies +2

We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform processing time arrive online with a deadline that becomes known to the…

cs.GT2023

Selling to Multiple No-Regret Buyers

Linda Cai, S. Matthew Weinberg, Evan Wildenhain +1

We consider the problem of repeatedly auctioning a single item to multiple i.i.d buyers who each use a no-regret learning algorithm to bid over time. In particular, we study the se…

cs.GT2023★ 1 cited

The Distortion of Binomial Voting Defies Expectation

Yannai A. Gonczarowski, Gregory Kehne, Ariel D. Procaccia +2

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outc…

cs.DS2022

Balancing Flow Time and Energy Consumption

Sami Davies, Samir Khuller, Shirley Zhang

In this paper, we study the following batch scheduling model: find a schedule that minimizes total flow time for uniform length jobs, with release times and deadlines, where th…