Network Preference Dynamics using Lattice Theory

Hans Riess, Gregory Henselman-Petrusek, Michael C. Munger, Robert Ghrist, Zachary I. Bell +1 more
9/29/2023
cs.MA

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{riess2023network,
  title  = {Network Preference Dynamics using Lattice Theory},
  author = {Hans Riess and Gregory Henselman-Petrusek and Michael C. Munger and Robert Ghrist and Zachary I. Bell and Michael M. Zavlanos},
  year   = {2023},
  eprint = {2310.00179},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.00179v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.00179.svg)](https://codeofpaper.com/paper/2310.00179)

Discussion