Saved in:
Bibliographic Details
Main Authors: Chen, Shenghui, Bayiz, Yigit E., Fridovich-Keil, David, Topcu, Ufuk
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2207.06392
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916105593815040
author Chen, Shenghui
Bayiz, Yigit E.
Fridovich-Keil, David
Topcu, Ufuk
author_facet Chen, Shenghui
Bayiz, Yigit E.
Fridovich-Keil, David
Topcu, Ufuk
contents Autonomous agents can adopt socially-aware behaviors to reduce social costs, mimicking the way animals interact in nature and humans in society. We present a new approach to model socially-aware decision-making that includes two key elements: bounded rationality and inter-agent relationships. We capture the interagent relationships by introducing a novel model called a relationship game and encode agents' bounded rationality using quantal response equilibria. For each relationship game, we define a social cost function and formulate a mechanism design problem to optimize weights for relationships that minimize social cost at the equilibrium. We address the multiplicity of equilibria by presenting the problem in two forms: Min-Max and Min-Min, aimed respectively at minimization of the highest and lowest social costs in the equilibria. We compute the quantal response equilibrium by solving a least-squares problem defined with its Karush-Kuhn-Tucker conditions, and propose two projected gradient descent algorithms to solve the mechanism design problems. Numerical results, including two-lane congestion and congestion with an ambulance, confirm that these algorithms consistently reach the equilibrium with the intended social costs.
format Preprint
id arxiv_https___arxiv_org_abs_2207_06392
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Relationship Design for Socially-Aware Behavior in Static Games
Chen, Shenghui
Bayiz, Yigit E.
Fridovich-Keil, David
Topcu, Ufuk
Multiagent Systems
Systems and Control
Autonomous agents can adopt socially-aware behaviors to reduce social costs, mimicking the way animals interact in nature and humans in society. We present a new approach to model socially-aware decision-making that includes two key elements: bounded rationality and inter-agent relationships. We capture the interagent relationships by introducing a novel model called a relationship game and encode agents' bounded rationality using quantal response equilibria. For each relationship game, we define a social cost function and formulate a mechanism design problem to optimize weights for relationships that minimize social cost at the equilibrium. We address the multiplicity of equilibria by presenting the problem in two forms: Min-Max and Min-Min, aimed respectively at minimization of the highest and lowest social costs in the equilibria. We compute the quantal response equilibrium by solving a least-squares problem defined with its Karush-Kuhn-Tucker conditions, and propose two projected gradient descent algorithms to solve the mechanism design problems. Numerical results, including two-lane congestion and congestion with an ambulance, confirm that these algorithms consistently reach the equilibrium with the intended social costs.
title Relationship Design for Socially-Aware Behavior in Static Games
topic Multiagent Systems
Systems and Control
url https://arxiv.org/abs/2207.06392