activity
20192026
most citedFairness-Efficiency Tradeoffs in Dynamic Fair Division

8 citations · 18 across the 23 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.GT2025

Sponsored Questions and How to Auction Them

Kshipra Bhawalkar, Alexandros Psomas, Di Wang

Online platforms connect users with relevant products and services using ads. A key challenge is that a user's search query often leaves their true intent ambiguous. Typically, pla…

cs.GT2025

On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences

Egor Gagushin, Marios Mertzanidis, Alexandros Psomas

We study the fundamental problem of fairly allocating a multiset of types of indivisible items among groups of agents, where all agents within a group have id…

cs.GT2025

On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness

Arnav Mehra, Alexandros Psomas

We consider the classic cake-cutting problem of producing fair allocations for agents, in the Robertson-Webb query model. In this model, it is known that: (i) proportional allo…

cs.GT2025

Pseudo-Equilibria, or: How to Stop Worrying About Crypto and Just Analyze the Game

Alexandros Psomas, Athina Terzoglou, Yu Wei +1

We consider the problem of a game theorist analyzing a game that uses cryptographic protocols. Ideally, a theorist abstracts protocols as ideal, implementation-independent primitiv…

cs.GT2025

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations

Daniel Halpern, Alexandros Psomas, Paritosh Verma +1

We consider the fundamental problem of allocating indivisible items that arrive over time to agents with additive preferences, with the goal of minimizing envy. This proble…