Sharing sequential values in a network

Consider a sequential process where agents have individual values at every possible step. A planner is in charge of selecting steps and distributing the accumulated aggregate values among a number of agents. We model this process by a directed network, whereby each edge is associated with a vector o...

Full description

Saved in:
Bibliographic Details
Main Authors: JUAREZ, Ruben, CHIU, Yu Ko, XUE, Jingyi
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2018
Subjects:
Online Access:https://ink.library.smu.edu.sg/soe_research/2238
https://ink.library.smu.edu.sg/context/soe_research/article/3237/viewcontent/Sharing_Sequential_Values_in_a_Network_pp.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.soe_research-3237
record_format dspace
spelling sg-smu-ink.soe_research-32372020-04-01T06:29:41Z Sharing sequential values in a network JUAREZ, Ruben CHIU, Yu Ko XUE, Jingyi Consider a sequential process where agents have individual values at every possible step. A planner is in charge of selecting steps and distributing the accumulated aggregate values among a number of agents. We model this process by a directed network, whereby each edge is associated with a vector of individual values. This model applies to several new and existing problems, e.g. developing a connected public facility and distributing total values received by surrounding districts, selecting a long-term production project and sharing final profits among partners of a firm, or choosing a machine schedule to serve different tasks and distributing total benefits among task owners.Herein, we provide the first axiomatic study on path selection and value-sharing in networks. We consider four sets of axioms from different perspectives, including those related to (1) the sequential consistency of value-sharing; (2) the monotonicity of value-sharing with respect to technology improvements; (3) the independence of value-sharing with respect to certain network transformations; and (4) the robust implementation of the efficient path selection when the planner has no information about network configuration. Surprisingly, these four disparate sets of axioms characterize similar classes of solutions, namely selecting an efficient path(s) and assigning to each agent a share of total values that is independent of individual values. Furthermore, we characterize more general solutions that depend on individual values. 2018-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/soe_research/2238 info:doi/10.1016/j.jet.2018.08.004 https://ink.library.smu.edu.sg/context/soe_research/article/3237/viewcontent/Sharing_Sequential_Values_in_a_Network_pp.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Economics eng Institutional Knowledge at Singapore Management University Sequential values Sharing Network Redistribution Economic Theory
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Sequential values
Sharing
Network
Redistribution
Economic Theory
spellingShingle Sequential values
Sharing
Network
Redistribution
Economic Theory
JUAREZ, Ruben
CHIU, Yu Ko
XUE, Jingyi
Sharing sequential values in a network
description Consider a sequential process where agents have individual values at every possible step. A planner is in charge of selecting steps and distributing the accumulated aggregate values among a number of agents. We model this process by a directed network, whereby each edge is associated with a vector of individual values. This model applies to several new and existing problems, e.g. developing a connected public facility and distributing total values received by surrounding districts, selecting a long-term production project and sharing final profits among partners of a firm, or choosing a machine schedule to serve different tasks and distributing total benefits among task owners.Herein, we provide the first axiomatic study on path selection and value-sharing in networks. We consider four sets of axioms from different perspectives, including those related to (1) the sequential consistency of value-sharing; (2) the monotonicity of value-sharing with respect to technology improvements; (3) the independence of value-sharing with respect to certain network transformations; and (4) the robust implementation of the efficient path selection when the planner has no information about network configuration. Surprisingly, these four disparate sets of axioms characterize similar classes of solutions, namely selecting an efficient path(s) and assigning to each agent a share of total values that is independent of individual values. Furthermore, we characterize more general solutions that depend on individual values.
format text
author JUAREZ, Ruben
CHIU, Yu Ko
XUE, Jingyi
author_facet JUAREZ, Ruben
CHIU, Yu Ko
XUE, Jingyi
author_sort JUAREZ, Ruben
title Sharing sequential values in a network
title_short Sharing sequential values in a network
title_full Sharing sequential values in a network
title_fullStr Sharing sequential values in a network
title_full_unstemmed Sharing sequential values in a network
title_sort sharing sequential values in a network
publisher Institutional Knowledge at Singapore Management University
publishDate 2018
url https://ink.library.smu.edu.sg/soe_research/2238
https://ink.library.smu.edu.sg/context/soe_research/article/3237/viewcontent/Sharing_Sequential_Values_in_a_Network_pp.pdf
_version_ 1770574509271678976