On the complexity of stable fractional hypergraph matching

Takashi Ishizuka, Naoyuki Kamiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system. Aharoni and Fleiner proved that there exists a stable fractional matching in every hypergraphic preference system. Furthermore, Kintali, Poplawski, Rajaraman, Sundaram, and Teng proved that the problem of finding a stable fractional matching in a hypergraphic preference system is PPAD-complete. In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is bounded by some constant. The proof by Kintali, Poplawski, Rajaraman, Sundaram, and Teng implies the PPAD-completeness of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is 5. In this paper, we prove that (i) this problem is PPAD-complete even if the maximum degree is 3, and (ii) if the maximum degree is 2, then this problem can be solved in polynomial time. Furthermore, we prove that the problem of finding an approximate stable fractional matching in a hypergraphic preference system is PPAD-complete.

Original languageEnglish
Title of host publication29th International Symposium on Algorithms and Computation, ISAAC 2018
EditorsChung-Shou Liao, Der-Tsai Lee, Wen-Lian Hsu
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770941
DOIs
Publication statusPublished - Dec 1 2018
Event29th International Symposium on Algorithms and Computation, ISAAC 2018 - Jiaoxi, Yilan, Taiwan, Province of China
Duration: Dec 16 2018Dec 19 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume123
ISSN (Print)1868-8969

Conference

Conference29th International Symposium on Algorithms and Computation, ISAAC 2018
CountryTaiwan, Province of China
CityJiaoxi, Yilan
Period12/16/1812/19/18

Fingerprint

Polynomials

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Ishizuka, T., & Kamiyama, N. (2018). On the complexity of stable fractional hypergraph matching. In C-S. Liao, D-T. Lee, & W-L. Hsu (Eds.), 29th International Symposium on Algorithms and Computation, ISAAC 2018 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 123). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2018.11

On the complexity of stable fractional hypergraph matching. / Ishizuka, Takashi; Kamiyama, Naoyuki.

29th International Symposium on Algorithms and Computation, ISAAC 2018. ed. / Chung-Shou Liao; Der-Tsai Lee; Wen-Lian Hsu. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 123).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ishizuka, T & Kamiyama, N 2018, On the complexity of stable fractional hypergraph matching. in C-S Liao, D-T Lee & W-L Hsu (eds), 29th International Symposium on Algorithms and Computation, ISAAC 2018. Leibniz International Proceedings in Informatics, LIPIcs, vol. 123, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 29th International Symposium on Algorithms and Computation, ISAAC 2018, Jiaoxi, Yilan, Taiwan, Province of China, 12/16/18. https://doi.org/10.4230/LIPIcs.ISAAC.2018.11
Ishizuka T, Kamiyama N. On the complexity of stable fractional hypergraph matching. In Liao C-S, Lee D-T, Hsu W-L, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.ISAAC.2018.11
Ishizuka, Takashi ; Kamiyama, Naoyuki. / On the complexity of stable fractional hypergraph matching. 29th International Symposium on Algorithms and Computation, ISAAC 2018. editor / Chung-Shou Liao ; Der-Tsai Lee ; Wen-Lian Hsu. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{af925648086940c68f7bb9ac08f33bda,
title = "On the complexity of stable fractional hypergraph matching",
abstract = "In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system. Aharoni and Fleiner proved that there exists a stable fractional matching in every hypergraphic preference system. Furthermore, Kintali, Poplawski, Rajaraman, Sundaram, and Teng proved that the problem of finding a stable fractional matching in a hypergraphic preference system is PPAD-complete. In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is bounded by some constant. The proof by Kintali, Poplawski, Rajaraman, Sundaram, and Teng implies the PPAD-completeness of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is 5. In this paper, we prove that (i) this problem is PPAD-complete even if the maximum degree is 3, and (ii) if the maximum degree is 2, then this problem can be solved in polynomial time. Furthermore, we prove that the problem of finding an approximate stable fractional matching in a hypergraphic preference system is PPAD-complete.",
author = "Takashi Ishizuka and Naoyuki Kamiyama",
year = "2018",
month = "12",
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2018.11",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Chung-Shou Liao and Der-Tsai Lee and Wen-Lian Hsu",
booktitle = "29th International Symposium on Algorithms and Computation, ISAAC 2018",

}

TY - GEN

T1 - On the complexity of stable fractional hypergraph matching

AU - Ishizuka, Takashi

AU - Kamiyama, Naoyuki

PY - 2018/12/1

Y1 - 2018/12/1

N2 - In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system. Aharoni and Fleiner proved that there exists a stable fractional matching in every hypergraphic preference system. Furthermore, Kintali, Poplawski, Rajaraman, Sundaram, and Teng proved that the problem of finding a stable fractional matching in a hypergraphic preference system is PPAD-complete. In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is bounded by some constant. The proof by Kintali, Poplawski, Rajaraman, Sundaram, and Teng implies the PPAD-completeness of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is 5. In this paper, we prove that (i) this problem is PPAD-complete even if the maximum degree is 3, and (ii) if the maximum degree is 2, then this problem can be solved in polynomial time. Furthermore, we prove that the problem of finding an approximate stable fractional matching in a hypergraphic preference system is PPAD-complete.

AB - In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system. Aharoni and Fleiner proved that there exists a stable fractional matching in every hypergraphic preference system. Furthermore, Kintali, Poplawski, Rajaraman, Sundaram, and Teng proved that the problem of finding a stable fractional matching in a hypergraphic preference system is PPAD-complete. In this paper, we consider the complexity of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is bounded by some constant. The proof by Kintali, Poplawski, Rajaraman, Sundaram, and Teng implies the PPAD-completeness of the problem of finding a stable fractional matching in a hypergraphic preference system whose maximum degree is 5. In this paper, we prove that (i) this problem is PPAD-complete even if the maximum degree is 3, and (ii) if the maximum degree is 2, then this problem can be solved in polynomial time. Furthermore, we prove that the problem of finding an approximate stable fractional matching in a hypergraphic preference system is PPAD-complete.

UR - http://www.scopus.com/inward/record.url?scp=85063689090&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063689090&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ISAAC.2018.11

DO - 10.4230/LIPIcs.ISAAC.2018.11

M3 - Conference contribution

AN - SCOPUS:85063689090

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 29th International Symposium on Algorithms and Computation, ISAAC 2018

A2 - Liao, Chung-Shou

A2 - Lee, Der-Tsai

A2 - Hsu, Wen-Lian

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -