Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2020-12-04 11:10
Capacitated Network Design Games on a Generalized Fair Allocation Model
Toshiyuki Hirose (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) COMP2020-21
Abstract (in Japanese) (See Japanese page) 
(in English) The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with edge-costs and edge-capacities, each agent wants to construct a path from a source to a sink with low cost. The cost of each edge is shared by the users based on a cost-sharing function. One of simple cost-sharing functions is defined as the cost divided by the number of users. It models an ideal setting, where no overhead arises when people share things, though it might be quite rare in real life; it is more realistic to consider the setting that the cost that an agent should pay is the original cost per the number of the agents plus the overhead. In this paper, we model the more realistic scenario of cost-sharing connection games by generalizing cost-sharing functions. We investigate the Price of Anarchy (PoA) and the Price of Stability (PoS) of sum-cost and max-cost criteria under the generalized cost-sharing function. In spite of the generalization, we obtain the same bounds of PoA and PoS as the cost-sharing with no overhead except PoS of sum-cost, where the PoS of sum-cost increases from log n to n by the generalization. All the bounds that we give are tight.
Keyword (in Japanese) (See Japanese page) 
(in English) Capacitated Network Design Games / Nash Equilibrium / Price of Anarchy / Price of Stability / Cost-sharing connection games / / /  
Reference Info. IEICE Tech. Rep., vol. 120, no. 276, COMP2020-21, pp. 24-27, Dec. 2020.
Paper # COMP2020-21 
Date of Issue 2020-11-27 (COMP) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2020-21

Conference Information
Committee COMP  
Conference Date 2020-12-04 - 2020-12-04 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2020-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Capacitated Network Design Games on a Generalized Fair Allocation Model 
Sub Title (in English)  
Keyword(1) Capacitated Network Design Games  
Keyword(2) Nash Equilibrium  
Keyword(3) Price of Anarchy  
Keyword(4) Price of Stability  
Keyword(5) Cost-sharing connection games  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Toshiyuki Hirose  
1st Author's Affiliation Nagoya University (Nagoya Univ.)
2nd Author's Name Tesshu Hanaka  
2nd Author's Affiliation Chuo University (Chuo Univ.)
3rd Author's Name Hirotaka Ono  
3rd Author's Affiliation Nagoya University (Nagoya Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2020-12-04 11:10:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2020-21 
Volume (vol) vol.120 
Number (no) no.276 
Page pp.24-27 
#Pages 4 
Date of Issue 2020-11-27 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan