Incentive ratios of a proportional sharing mechanism in resource sharing

Zhou Chen; Yukun Cheng; Qi Qi; Xiang Yan

doi:10.1007/978-3-319-62389-4_12

Incentive ratios of a proportional sharing mechanism in resource sharing

Zhou Chen^*
, Yukun Cheng
, Qi Qi
, Xiang Yan

^*Corresponding author for this work

Department of Industrial Engineering and Decision Analytics

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

5 Citations (Scopus)

Abstract

In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resource directly available to others. In this paper we focus on a proportional sharing mechanism, which is fair, efficient and guarantees a market equilibrium in the resource sharing system. We study the incentives an agent may manipulate such a mechanism, by the vertex splitting strategy, for personal gains and adopt a concept called incentive ratio to quantify the amount of gains. For the resource sharing system where the underlying network ia a cycle, we prove that the incentive ratio on this kind of network is bounded by 2\le \zeta \le 4. Furthermore, the incentive ratio on an even cycle, a cycle with even number of vertices, is proved to be exactly 2.

Original language	English
Title of host publication	Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings
Editors	Yixin Cao, Jianer Chen
Publisher	Springer Verlag
Pages	137-149
Number of pages	13
ISBN (Print)	9783319623887
DOIs	https://doi.org/10.1007/978-3-319-62389-4_12
Publication status	Published - 2017
Event	23rd International Conference on Computing and Combinatorics, COCOON 2017 - Hong Kong, China Duration: 3 Aug 2017 → 5 Aug 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10392 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd International Conference on Computing and Combinatorics, COCOON 2017
Country/Territory	China
City	Hong Kong
Period	3/08/17 → 5/08/17

Bibliographical note

Publisher Copyright:
© 2017, Springer International Publishing AG.

Keywords

Combinatorial optimization
Incentive ratio
Market equilibrium
Mechanism design
Resource sharing

Access to Document

10.1007/978-3-319-62389-4_12

Cite this

Chen, Z., Cheng, Y., Qi, Q., & Yan, X. (2017). Incentive ratios of a proportional sharing mechanism in resource sharing. In Y. Cao, & J. Chen (Eds.), Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings (pp. 137-149). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10392 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-62389-4_12

Chen, Zhou ; Cheng, Yukun ; Qi, Qi et al. / Incentive ratios of a proportional sharing mechanism in resource sharing. Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. editor / Yixin Cao ; Jianer Chen. Springer Verlag, 2017. pp. 137-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7c94fc98b4084f67838070ebf546de34,

title = "Incentive ratios of a proportional sharing mechanism in resource sharing",

abstract = "In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resource directly available to others. In this paper we focus on a proportional sharing mechanism, which is fair, efficient and guarantees a market equilibrium in the resource sharing system. We study the incentives an agent may manipulate such a mechanism, by the vertex splitting strategy, for personal gains and adopt a concept called incentive ratio to quantify the amount of gains. For the resource sharing system where the underlying network ia a cycle, we prove that the incentive ratio on this kind of network is bounded by 2\textbackslash{}le \textbackslash{}zeta \textbackslash{}le 4. Furthermore, the incentive ratio on an even cycle, a cycle with even number of vertices, is proved to be exactly 2.",

keywords = "Combinatorial optimization, Incentive ratio, Market equilibrium, Mechanism design, Resource sharing",

author = "Zhou Chen and Yukun Cheng and Qi Qi and Xiang Yan",

note = "Publisher Copyright: {\textcopyright} 2017, Springer International Publishing AG.; 23rd International Conference on Computing and Combinatorics, COCOON 2017 ; Conference date: 03-08-2017 Through 05-08-2017",

year = "2017",

doi = "10.1007/978-3-319-62389-4\_12",

language = "English",

isbn = "9783319623887",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "137--149",

editor = "Yixin Cao and Jianer Chen",

booktitle = "Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings",

}

Chen, Z, Cheng, Y, Qi, Q & Yan, X 2017, Incentive ratios of a proportional sharing mechanism in resource sharing. in Y Cao & J Chen (eds), Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10392 LNCS, Springer Verlag, pp. 137-149, 23rd International Conference on Computing and Combinatorics, COCOON 2017, Hong Kong, China, 3/08/17. https://doi.org/10.1007/978-3-319-62389-4_12

Incentive ratios of a proportional sharing mechanism in resource sharing. / Chen, Zhou; Cheng, Yukun; Qi, Qi et al.
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. ed. / Yixin Cao; Jianer Chen. Springer Verlag, 2017. p. 137-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10392 LNCS).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Incentive ratios of a proportional sharing mechanism in resource sharing

AU - Chen, Zhou

AU - Cheng, Yukun

AU - Qi, Qi

AU - Yan, Xiang

PY - 2017

Y1 - 2017

N2 - In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resource directly available to others. In this paper we focus on a proportional sharing mechanism, which is fair, efficient and guarantees a market equilibrium in the resource sharing system. We study the incentives an agent may manipulate such a mechanism, by the vertex splitting strategy, for personal gains and adopt a concept called incentive ratio to quantify the amount of gains. For the resource sharing system where the underlying network ia a cycle, we prove that the incentive ratio on this kind of network is bounded by 2\le \zeta \le 4. Furthermore, the incentive ratio on an even cycle, a cycle with even number of vertices, is proved to be exactly 2.

AB - In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resource directly available to others. In this paper we focus on a proportional sharing mechanism, which is fair, efficient and guarantees a market equilibrium in the resource sharing system. We study the incentives an agent may manipulate such a mechanism, by the vertex splitting strategy, for personal gains and adopt a concept called incentive ratio to quantify the amount of gains. For the resource sharing system where the underlying network ia a cycle, we prove that the incentive ratio on this kind of network is bounded by 2\le \zeta \le 4. Furthermore, the incentive ratio on an even cycle, a cycle with even number of vertices, is proved to be exactly 2.

KW - Combinatorial optimization

KW - Incentive ratio

KW - Market equilibrium

KW - Mechanism design

KW - Resource sharing

UR - https://www.scopus.com/pages/publications/85028472755

U2 - 10.1007/978-3-319-62389-4_12

DO - 10.1007/978-3-319-62389-4_12

M3 - Conference Paper published in a book

AN - SCOPUS:85028472755

SN - 9783319623887

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 137

EP - 149

BT - Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings

A2 - Cao, Yixin

A2 - Chen, Jianer

PB - Springer Verlag

T2 - 23rd International Conference on Computing and Combinatorics, COCOON 2017

Y2 - 3 August 2017 through 5 August 2017

ER -

Chen Z, Cheng Y, Qi Q, Yan X. Incentive ratios of a proportional sharing mechanism in resource sharing. In Cao Y, Chen J, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Springer Verlag. 2017. p. 137-149. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-62389-4_12

Incentive ratios of a proportional sharing mechanism in resource sharing

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this