Saved in:
Bibliographic Details
Main Authors: Riess, Hans, Henselman-Petrusek, Gregory, Munger, Michael C., Ghrist, Robert, Bell, Zachary I., Zavlanos, Michael M.
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2310.00179
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909249993441280
author Riess, Hans
Henselman-Petrusek, Gregory
Munger, Michael C.
Ghrist, Robert
Bell, Zachary I.
Zavlanos, Michael M.
author_facet Riess, Hans
Henselman-Petrusek, Gregory
Munger, Michael C.
Ghrist, Robert
Bell, Zachary I.
Zavlanos, Michael M.
contents Preferences, fundamental in all forms of strategic behavior and collective decision-making, in their raw form, are an abstract ordering on a set of alternatives. Agents, we assume, revise their preferences as they gain more information about other agents. Exploiting the ordered algebraic structure of preferences, we introduce a message-passing algorithm for heterogeneous agents distributed over a network to update their preferences based on aggregations of the preferences of their neighbors in a graph. We demonstrate the existence of equilibrium points of the resulting global dynamical system of local preference updates and provide a sufficient condition for trajectories to converge to equilibria: stable preferences. Finally, we present numerical simulations demonstrating our preliminary results.
format Preprint
id arxiv_https___arxiv_org_abs_2310_00179
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Network Preference Dynamics using Lattice Theory
Riess, Hans
Henselman-Petrusek, Gregory
Munger, Michael C.
Ghrist, Robert
Bell, Zachary I.
Zavlanos, Michael M.
Multiagent Systems
Preferences, fundamental in all forms of strategic behavior and collective decision-making, in their raw form, are an abstract ordering on a set of alternatives. Agents, we assume, revise their preferences as they gain more information about other agents. Exploiting the ordered algebraic structure of preferences, we introduce a message-passing algorithm for heterogeneous agents distributed over a network to update their preferences based on aggregations of the preferences of their neighbors in a graph. We demonstrate the existence of equilibrium points of the resulting global dynamical system of local preference updates and provide a sufficient condition for trajectories to converge to equilibria: stable preferences. Finally, we present numerical simulations demonstrating our preliminary results.
title Network Preference Dynamics using Lattice Theory
topic Multiagent Systems
url https://arxiv.org/abs/2310.00179