works on

From the 2 of 17 linked papers with an AI index.

activity
20242026
collaborators
Showing cs.GTShow all

15 papers · 1 filter

cs.GT2026

Stable Voting is PSPACE-Complete

Ethan Dickey, Alexandros Psomas, Athina Terzoglou

The paper proves that determining the winner under the Stable Voting and Simple Stable Voting rules is PSPACE‑complete.

cs.GT2026

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

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

Fair Division Under Inaccurate Preferences

Trung Dang, Daniel Halpern, Anuran Makur +3

The fair allocation of scarce resources is a central problem in mathematics, computer science, operations research, and economics. While much of the fair-division literature assume…

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

On the Fairness of Normalized p-Means for Allocating Goods and Chores

Owen Eckart, Alexandros Psomas, Paritosh Verma

Allocating items in a fair and economically efficient manner is a central problem in fair division. We study this problem for agents with additive preferences, when items are all g…