消息
×
loading..
Cost Sharing under Private Costs and Connection Control on Directed Acyclic Graphs
2023-11-30
会议录名称ACM INTERNATIONAL CONFERENCE PROCEEDING SERIES
DOI10.1145/3627676.3627689
摘要We consider a cost sharing problem on a weighted directed acyclic graph (DAG) with a source node to which all the other nodes want to connect. The cost (weight) of each edge is private information reported by multiple contractors, and among them, only one contractor is selected as the builder. All the nodes except for the source need to share the total cost of the used edges. However, they may block others' connections to the source by strategically cutting their outgoing edges to reduce their cost share, which may increase the total cost of connectivity. To minimize the total cost of connectivity, we design a cost sharing mechanism to incentivize each node to offer all its outgoing edges and each contractor to report all the edges' weights truthfully, and show the properties of the proposed mechanism. In addition, our mechanism outperforms the two benchmark mechanisms. © 2023 ACM.
关键词Cost effectiveness Directed graphs Machine design Acyclic graphs Connection control Cost controls Cost of connectivity Cost sharing Cost-sharing problems Directed acyclic graph Mechanism design Source nodes Truthfulness
会议名称5th International Conference on Distributed Artificial Intelligence, DAI 2023
会议地点Singapore, Singapore
会议日期November 30, 2023 - December 3, 2023
URL查看原文
收录类别EI
语种英语
出版者Association for Computing Machinery
EI入藏号20240415423669
EI主题词Contractors
EI分类号601 Mechanical Design ; 911.2 Industrial Economics ; 912 Industrial Engineering and Management ; 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
原始文献类型Conference article (CA)
引用统计
正在获取...
文献类型会议论文
条目标识符https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/349787
专题信息科学与技术学院_PI研究组_赵登吉组
信息科学与技术学院_硕士生
信息科学与技术学院_博士生
作者单位
ShanghaiTech University, Shanghai, China
第一作者单位上海科技大学
第一作者的第一单位上海科技大学
推荐引用方式
GB/T 7714
Zhang, Tianyi,Zhao, Dengji,Zhang, Junyu,et al. Cost Sharing under Private Costs and Connection Control on Directed Acyclic Graphs[C]:Association for Computing Machinery,2023.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Zhang, Tianyi]的文章
[Zhao, Dengji]的文章
[Zhang, Junyu]的文章
百度学术
百度学术中相似的文章
[Zhang, Tianyi]的文章
[Zhao, Dengji]的文章
[Zhang, Junyu]的文章
必应学术
必应学术中相似的文章
[Zhang, Tianyi]的文章
[Zhao, Dengji]的文章
[Zhang, Junyu]的文章
相关权益政策
暂无数据
收藏/分享
文件名: 10.1145@3627676.3627689.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。