2 citations · 5 across the 17 of their papers we have counts for
4 papers · 1 filter
Computing Power Indices in Weighted Majority Games with Formal Power Series
Naonori Kakimura, Yoshihiko Terai
In this paper, we propose fast pseudo-polynomial-time algorithms for computing power indices in weighted majority games. We show that we can compute the Banzhaf index for all playe…
On Reachable Assignments under Dichotomous Preferences
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +4
We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise exchanges of items between agents.…
Market Pricing for Matroid Rank Valuations
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
In this paper, we study the problem of maximizing social welfare in combinatorial markets through pricing schemes. We consider the existence of prices that are capable to achieve o…
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase +3
Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a m…