Noriyoshi Sukegawa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Noriyoshi Sukegawa has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Yuichi Takano
University of Tsukuba
10 shared publications - Naoki Nishimura
University of Tsukuba
7 shared publications - Koya Ohashi
Mercari, Inc., Minato-ku
5 shared publications - Antoine Deza
McMaster University
4 shared publications Deddy Jobson
Mercari, Inc Minato-ku 106-6118 Tokyo Japan
3 shared publications- Deddy Jobson
Mercari Inc
3 shared publications
Latest Publications
- Open Access
- 1 July 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (4) , 2735-2745
Simultaneous estimation of multiple discrete unimodal distributions under stochastic order constraints
We study the problem of estimating multiple discrete unimodal distributions, motivated by search behavior analysis on a real-world platform. To incorporate prior knowledge of precedence relations among distributions, we impose stochastic order constraints and formulate the estimation task as a mixed-integer convex quadratic optimization problem. Experiments on both synthetic and real datasets show that the proposed method reduces the Jensen-Shannon divergence by 2.2% on average (up to 6.3%) when the sample size is small, while performing comparably to existing methods when sufficient data are available.
- 1 July 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (4) , 2735-2745
Open AccessSimultaneous estimation of multiple discrete unimodal distributions under stochastic order constraints
We study the problem of estimating multiple discrete unimodal distributions, motivated by search behavior analysis on a real-world platform. To incorporate prior knowledge of precedence relations among distributions, we impose stochastic order constraints and formulate the estimation task as a mixed-integer convex quadratic optimization problem. Experiments on both synthetic and real datasets show that the proposed method reduces the Jensen-Shannon divergence by 2.2% on average (up to 6.3%) when the sample size is small, while performing comparably to existing methods when sufficient data are available.
- 1 April 2026
- Published by Springer Nature
- p. 600-613
Subset Selection for Stratified Sampling in Online Controlled Experiments
- 1 April 2026
- Published by Springer Nature
- p. 600-613
Subset Selection for Stratified Sampling in Online Controlled Experiments
- Open Access
Subset Selection for Stratified Sampling in Online Controlled Experiments
Online controlled experiments, also known as A/B testing, are the digital equivalent of randomized controlled trials for estimating the impact of marketing campaigns on website visitors. Stratified sampling is a traditional technique for variance reduction to improve the sensitivity (or statistical power) of controlled experiments; this technique first divides the population into strata (homogeneous subgroups) based on stratification variables and then draws samples from each stratum to avoid sampling bias. To enhance the estimation accuracy of stratified sampling, we focus on the problem of selecting a subset of stratification variables that are effective in variance reduction. We design an efficient algorithm that selects stratification variables one by one by simulating a series of stratified sampling processes. We also estimate the computational complexity of our subset selection algorithm. Computational experiments using synthetic and real-world datasets demonstrate that our method can outperform other variance reduction techniques especially when multiple variables have a certain correlation with the outcome variable. Our subset selection method for stratified sampling can improve the sensitivity of online controlled experiments, thus enabling more reliable marketing decisions.
Open AccessSubset Selection for Stratified Sampling in Online Controlled Experiments
Online controlled experiments, also known as A/B testing, are the digital equivalent of randomized controlled trials for estimating the impact of marketing campaigns on website visitors. Stratified sampling is a traditional technique for variance reduction to improve the sensitivity (or statistical power) of controlled experiments; this technique first divides the population into strata (homogeneous subgroups) based on stratification variables and then draws samples from each stratum to avoid sampling bias. To enhance the estimation accuracy of stratified sampling, we focus on the problem of selecting a subset of stratification variables that are effective in variance reduction. We design an efficient algorithm that selects stratification variables one by one by simulating a series of stratified sampling processes. We also estimate the computational complexity of our subset selection algorithm. Computational experiments using synthetic and real-world datasets demonstrate that our method can outperform other variance reduction techniques especially when multiple variables have a certain correlation with the outcome variable. Our subset selection method for stratified sampling can improve the sensitivity of online controlled experiments, thus enabling more reliable marketing decisions.
- Open Access
- 6 August 2025
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 13
Robust personalized pricing under uncertainty of purchase probabilities
- 6 August 2025
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 13
Open AccessRobust personalized pricing under uncertainty of purchase probabilities
- 12 November 2024
- Published by Springer Nature
- p. 207-215
Fast Solution to the Fair Ranking Problem Using the Sinkhorn Algorithm
- 12 November 2024
- Published by Springer Nature
- p. 207-215
Fast Solution to the Fair Ranking Problem Using the Sinkhorn Algorithm
- Open Access
- 14 August 2024
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 62 (4) , 646-660
Robust portfolio optimization model for electronic coupon allocation
- 14 August 2024
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 62 (4) , 646-660
Open AccessRobust portfolio optimization model for electronic coupon allocation
- Open Access
Strategic Coupon Allocation for Increasing Providers' Sales Experiences in Two-sided Marketplaces
In a two-sided marketplace, network effects are crucial for competitiveness, and platforms need to retain users through advanced customer relationship management as much as possible. Maintaining numerous providers' stable and active presence on the platform is highly important to enhance the marketplace's scale and diversity. The strongest motivation for providers to continue using the platform is to realize actual profits through sales. Then, we propose a personalized promotion to increase the number of successful providers with sales experiences on the platform. The main contributions of our research are twofold. First, we introduce a new perspective in provider management with the distribution of successful sales experiences. Second, we propose a personalized promotion optimization method to maximize the number of providers' sales experiences. By utilizing this approach, we ensure equal opportunities for providers to experience sales without being monopolized by a few providers. Through experiments using actual data on coupon distribution, we confirm that our method enables the implementation of coupon allocation strategies that significantly increase the total number of providers having sales experiences.
Open AccessStrategic Coupon Allocation for Increasing Providers' Sales Experiences in Two-sided Marketplaces
In a two-sided marketplace, network effects are crucial for competitiveness, and platforms need to retain users through advanced customer relationship management as much as possible. Maintaining numerous providers' stable and active presence on the platform is highly important to enhance the marketplace's scale and diversity. The strongest motivation for providers to continue using the platform is to realize actual profits through sales. Then, we propose a personalized promotion to increase the number of successful providers with sales experiences on the platform. The main contributions of our research are twofold. First, we introduce a new perspective in provider management with the distribution of successful sales experiences. Second, we propose a personalized promotion optimization method to maximize the number of providers' sales experiences. By utilizing this approach, we ensure equal opportunities for providers to experience sales without being monopolized by a few providers. Through experiments using actual data on coupon distribution, we confirm that our method enables the implementation of coupon allocation strategies that significantly increase the total number of providers having sales experiences.
- Open Access
Robust portfolio optimization model for electronic coupon allocation
Currently, many e-commerce websites issue online/electronic coupons as an effective tool for promoting sales of various products and services. We focus on the problem of optimally allocating coupons to customers subject to a budget constraint on an e-commerce website. We apply a robust portfolio optimization model based on customer segmentation to the coupon allocation problem. We also validate the efficacy of our method through numerical experiments using actual data from randomly distributed coupons. Main contributions of our research are twofold. First, we handle six types of coupons, thereby making it extremely difficult to accurately estimate the difference in the effects of various coupons. Second, we demonstrate from detailed numerical results that the robust optimization model achieved larger uplifts of sales than did the commonly-used multiple-choice knapsack model and the conventional mean-variance optimization model. Our results open up great potential for robust portfolio optimization as an effective tool for practical coupon allocation.
Open AccessRobust portfolio optimization model for electronic coupon allocation
Currently, many e-commerce websites issue online/electronic coupons as an effective tool for promoting sales of various products and services. We focus on the problem of optimally allocating coupons to customers subject to a budget constraint on an e-commerce website. We apply a robust portfolio optimization model based on customer segmentation to the coupon allocation problem. We also validate the efficacy of our method through numerical experiments using actual data from randomly distributed coupons. Main contributions of our research are twofold. First, we handle six types of coupons, thereby making it extremely difficult to accurately estimate the difference in the effects of various coupons. Second, we demonstrate from detailed numerical results that the robust optimization model achieved larger uplifts of sales than did the commonly-used multiple-choice knapsack model and the conventional mean-variance optimization model. Our results open up great potential for robust portfolio optimization as an effective tool for practical coupon allocation.
- Open Access
- 20 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (1) , 178-193
On Computing Medians of Marked Point Process Data Under Edit Distance
In this paper, we consider the problem of computing a median of marked point process data under an edit distance. We formulate this problem as a binary linear program, and propose to solve it to optimality by software. We show results of numerical experiments to demonstrate the effectiveness of the proposed method and its application in earthquake prediction.
- 20 December 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 200 (1) , 178-193
Open AccessOn Computing Medians of Marked Point Process Data Under Edit Distance
In this paper, we consider the problem of computing a median of marked point process data under an edit distance. We formulate this problem as a binary linear program, and propose to solve it to optimality by software. We show results of numerical experiments to demonstrate the effectiveness of the proposed method and its application in earthquake prediction.
- 7 October 2023
- Published by Springer Nature in Operations Research Forum
- Vol. 4 (4) , 1-16
Monotone Diameter of Bisubmodular Polyhedra
- 7 October 2023
- Published by Springer Nature in Operations Research Forum
- Vol. 4 (4) , 1-16
Monotone Diameter of Bisubmodular Polyhedra