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 2025-12-05 15:40
A New Relaxation of Fairness in Two-Sided MatchingRespecting Acquaintance Relationships
Ryota Takeshima, Kei Kimura, Ayumu Kuroki, Temma Wakasugi, Makoto Yokoo (Kyushu Univ.) COMP2025-20
Abstract (in Japanese) (See Japanese page) 
(in English) Two-sided matching, such as student-school assignments, is widely studied but suffers from a fundamental conflict
between efficiency and fairness. Notably, Pareto efficiency and justified-envy-freeness are incompatible even in simple one-to-one
matchings like the stable marriage problem. Prior research has improved efficiency by relaxing fairness, often tolerating student
envy. This study takes a different approach by focusing on envy that students perceive more strongly—specifically, envy toward
acquaintances. We model student relationships as an undirected graph and define local envy as justified envy toward a neighbor.
A matching without such envy satisfies local envy-freeness, a relaxed fairness concept. We investigate whether Pareto-efficient
matchings can coexist with local envy-freeness by imposing structure on the graph and school preferences. To explore this, we
introduce a local version of Cho et al.’s (AAMAS 2024) parameterized fairness, which quantifies levels of local envy-freeness.
We then analyze the achievable levels under Pareto-efficient mechanisms for graphs that are “close” to trees and single-peaked
preferences on the graph.
Keyword (in Japanese) (See Japanese page) 
(in English) Mechanism Design / Two-sided Matching / Graph Theory / / / / /  
Reference Info. IEICE Tech. Rep., vol. 125, no. 277, COMP2025-20, pp. 44-51, Dec. 2025.
Paper # COMP2025-20 
Date of Issue 2025-11-28 (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 COMP2025-20

Conference Information
Committee COMP  
Conference Date 2025-12-05 - 2025-12-05 
Place (in Japanese) (See Japanese page) 
Place (in English) Salon, 2nd Floor, Alumni Hall, Ehime University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2025-12-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A New Relaxation of Fairness in Two-Sided MatchingRespecting Acquaintance Relationships 
Sub Title (in English)  
Keyword(1) Mechanism Design  
Keyword(2) Two-sided Matching  
Keyword(3) Graph Theory  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ryota Takeshima  
1st Author's Affiliation Kyushu University (Kyushu Univ.)
2nd Author's Name Kei Kimura  
2nd Author's Affiliation Kyushu University (Kyushu Univ.)
3rd Author's Name Ayumu Kuroki  
3rd Author's Affiliation Kyushu University (Kyushu Univ.)
4th Author's Name Temma Wakasugi  
4th Author's Affiliation Kyushu University (Kyushu Univ.)
5th Author's Name Makoto Yokoo  
5th Author's Affiliation Kyushu University (Kyushu Univ.)
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 2025-12-05 15:40:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2025-20 
Volume (vol) vol.125 
Number (no) no.277 
Page pp.44-51 
#Pages 8 
Date of Issue 2025-11-28 (COMP) 

[Return to Top Page]

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