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
Showing cs.GTShow all

8 papers · 1 filter

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.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.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.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.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…