5 papers
Online Fair Division with Budget Constraints
Saar Cohen, Nicholas Teh, Paul W. Goldberg +1
We study an online variant of discrete fair division under generalized assignment budget constraints. Goods arrive one at a time and must be assigned irrevocably to a feasible agen…
Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals
Saar Cohen
Clustering is a fundamental problem, aiming to partition a set of elements, like agents or data points, into clusters such that elements in the same cluster are closer to each othe…
The Attacker in the Mirror: Breaking Self-Consistency in Safety via Anchored Bipolicy Self-Play
Gabriele La Malfa, Emanuele La Malfa, Saar Cohen +4
Self-play red team is an established approach to improving AI safety in which different instances of the same model play attacker and defender roles in a zero-sum game, i.e., where…
Offline Learning of Nash Stable Coalition Structures with Possibly Overlapping Coalitions
Saar Cohen
Coalition formation concerns strategic collaborations of selfish agents that form coalitions based on their preferences. It is often assumed that coalitions are disjoint and prefer…
Convexified Message-Passing Graph Neural Networks
Saar Cohen, Noa Agmon, Uri Shaham
Graph Neural Networks (GNNs) are key tools for graph representation learning, demonstrating strong results across diverse prediction tasks. In this paper, we present Convexified Me…