An improved algorithm for testing substitutability of weak preferences

Susumu Kawanaka, Naoyuki Kamiyama

研究成果: ジャーナルへの寄稿記事

抄録

In this paper, we consider the problem of testing substitutability of weak preferences. For this problem, Aziz, Brill, and Harrenstein proposed an O(ℓ 3 u 2 +ℓ 2 u 2 s 2 )-time algorithm, where u is the size of the ground set, ℓ is the number of acceptable sets, and s is the maximum size of an equivalent class. In this paper, we propose an O(ℓ 3 u+ℓ 2 u 2 s)-time algorithm for this problem. Our algorithm is based on a generalization of the characterization of substitutability of strict preferences given by Croitoru and Mehlhorn.

元の言語英語
ページ(範囲)1-4
ページ数4
ジャーナルMathematical Social Sciences
99
DOI
出版物ステータス出版済み - 5 1 2019

Fingerprint

Testing
Substitutability
time
Generalization
Class

All Science Journal Classification (ASJC) codes

  • Sociology and Political Science
  • Social Sciences(all)
  • Psychology(all)
  • Statistics, Probability and Uncertainty

これを引用

An improved algorithm for testing substitutability of weak preferences. / Kawanaka, Susumu; Kamiyama, Naoyuki.

:: Mathematical Social Sciences, 巻 99, 01.05.2019, p. 1-4.

研究成果: ジャーナルへの寄稿記事

@article{9022a8b870a94daa9adaa1fe1e2dfaa8,
title = "An improved algorithm for testing substitutability of weak preferences",
abstract = "In this paper, we consider the problem of testing substitutability of weak preferences. For this problem, Aziz, Brill, and Harrenstein proposed an O(ℓ 3 u 2 +ℓ 2 u 2 s 2 )-time algorithm, where u is the size of the ground set, ℓ is the number of acceptable sets, and s is the maximum size of an equivalent class. In this paper, we propose an O(ℓ 3 u+ℓ 2 u 2 s)-time algorithm for this problem. Our algorithm is based on a generalization of the characterization of substitutability of strict preferences given by Croitoru and Mehlhorn.",
author = "Susumu Kawanaka and Naoyuki Kamiyama",
year = "2019",
month = "5",
day = "1",
doi = "10.1016/j.mathsocsci.2019.02.003",
language = "English",
volume = "99",
pages = "1--4",
journal = "Mathematical Social Sciences",
issn = "0165-4896",
publisher = "Elsevier",

}

TY - JOUR

T1 - An improved algorithm for testing substitutability of weak preferences

AU - Kawanaka, Susumu

AU - Kamiyama, Naoyuki

PY - 2019/5/1

Y1 - 2019/5/1

N2 - In this paper, we consider the problem of testing substitutability of weak preferences. For this problem, Aziz, Brill, and Harrenstein proposed an O(ℓ 3 u 2 +ℓ 2 u 2 s 2 )-time algorithm, where u is the size of the ground set, ℓ is the number of acceptable sets, and s is the maximum size of an equivalent class. In this paper, we propose an O(ℓ 3 u+ℓ 2 u 2 s)-time algorithm for this problem. Our algorithm is based on a generalization of the characterization of substitutability of strict preferences given by Croitoru and Mehlhorn.

AB - In this paper, we consider the problem of testing substitutability of weak preferences. For this problem, Aziz, Brill, and Harrenstein proposed an O(ℓ 3 u 2 +ℓ 2 u 2 s 2 )-time algorithm, where u is the size of the ground set, ℓ is the number of acceptable sets, and s is the maximum size of an equivalent class. In this paper, we propose an O(ℓ 3 u+ℓ 2 u 2 s)-time algorithm for this problem. Our algorithm is based on a generalization of the characterization of substitutability of strict preferences given by Croitoru and Mehlhorn.

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

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

U2 - 10.1016/j.mathsocsci.2019.02.003

DO - 10.1016/j.mathsocsci.2019.02.003

M3 - Article

VL - 99

SP - 1

EP - 4

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

SN - 0165-4896

ER -