Stable dinner party seating arrangements
D Berriaud, A Constantinescu… - … Conference on Web and …, 2023 - Springer
A group of n agents with numerical preferences for each other are to be assigned to the n
seats of a dining table. We study two natural topologies: circular (cycle) tables and panel …
seats of a dining table. We study two natural topologies: circular (cycle) tables and panel …
Individual Rationality in Topological Distance Games is Surprisingly Hard
In the recently introduced topological distance games, strategic agents need to be assigned
to a subset of vertices of a topology. In the assignment, the utility of an agent depends on …
to a subset of vertices of a topology. In the assignment, the utility of an agent depends on …
Neighborhood Stability in Assignments on Graphs
We study the problem of assigning agents to the vertices of a graph such that no pair of
neighbors can benefit from swapping assignments--a property we term neighborhood …
neighbors can benefit from swapping assignments--a property we term neighborhood …
Seat Arrangement Problems under B-utility and W-utility
J Rodríguez - arXiv preprint arXiv:2406.09965, 2024 - arxiv.org
In the Seat Arrangement problem the goal is to allocate agents to vertices in a graph such
that the resulting arrangement is optimal or fair in some way. Examples include an …
that the resulting arrangement is optimal or fair in some way. Examples include an …
Check for Stable Dinner Party Seating Arrangements Damien Berriaud®, Andrei Constantinescu), and Roger Wattenhofer ETH Zurich, Rämistrasse 101, 8092 Zurich …
D Berriaud - Web and Internet Economics: 19th International …, 2023 - books.google.com
A group of n agents with numerical preferences for each other are to be assigned to the n
seats of a dining table. We study two natural topologies: circular (cycle) tables and panel …
seats of a dining table. We study two natural topologies: circular (cycle) tables and panel …