activity
20112025
most citedA 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

14 citations · 49 across the 14 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.OC2021★ 2 cited

Dynamic Programming and Linear Programming for Odds Problem

Sachika Kurokawa, Tomomi Matsui

This paper discusses the odds problem, proposed by Bruss in 2000, and its variants. A recurrence relation called a dynamic programming (DP) equation is used to find an optimal stop…

cs.DM2021

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization

Masato Tanaka, Tomomi Matsui

A circle graph is a graph in which the adjacency of vertices can be represented as the intersection of chords of a circle. The problem of calculating the chromatic number is known…

cs.GT2021★ 2 cited

Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games

Yuto Ushioda, Masato Tanaka, Tomomi Matsui

This paper addresses Monte Carlo algorithms for calculating the Shapley-Shubik power index in weighted majority games. First, we analyze a naive Monte Carlo algorithm and discuss t…

cs.GT2021★ 4 cited

Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games

Masato Tanaka, Tomomi Matsui

In this paper, we propose a pseudo polynomial size LP formulation for finding a payoff vector in the least core of a weighted voting game. The numbers of variables and constraints…

cs.GT2021

Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games

Akihiro Kawana, Tomomi Matsui

This study investigates simple games. A fundamental research question in this field is to determine necessary and sufficient conditions for a simple game to be a weighted majority…