社団法人 日本オペレーションズ・リサーチ学会
ENGLISH
入会申込み お問合わせ
HOME オペレーションズ・リサーチ学会とは 研究活動案内 OR事典Wiki 機関誌 論文誌 会員の方へ
活動概要
会長挨拶
支部紹介
 

HOME > 論文誌  > JORSJ論文概要 

64-1 64-2 

JORSJ 64-1

1.
NASH EQUILIBRIA FOR INFORMATION DIFFUSION GAMES ON WEIGHTED CYCLES AND PATHS
Tianyang Li, Maiko Shigeno (University of Tsukuba)
The information diffusion game, which is a type of non-cooperative game, models the diffusion process of information in networks for several competitive firms that want to spread their information. Recently, the game on weighted graphs was introduced and pure Nash equilibria for the game were discussed. This paper gives a full characterization of the existence of pure Nash equilibria for the game on weighted cycles and paths according to the number of vertices, the number of players and weight classes.
2.
AN ANALYSIS OF MECHANISM FOR CUSTOMERSʼ PURCHASE AMOUNT AND NUMBER OF VISITS IN DEPARTMENT STORE
Hiroki Yamada (Gifu Shotoku Gakuen University) Tadahiko Sato(University of Tsukuba

The purpose of this study is to reveal how marketing affects customersʼ purchase amount and number of visits in Japanese department stores. We model purchase amounts by using a hierarchical Bayes regression model and number of visits by using a hierarchical Bayes Poisson regression model. Furthermore, we estimate the latent factor behind price as the purchase amount per month with a Type-1 Tobit model and the structural heterogeneity of each customer with a model for variable selection. Direct mail and events are used as marketing measures. The analytical results reveal marketing measures that raise customersʼ final purchase amounts.

2.
APPROXIMATION ALGORITHMS FOR A GENERALIZATION OF THE MAXIMUM BUDGET ALLOCATION
Takuro Fukunaga(Chuo University)

The maximum budget allocation (MBA) problem is the problem of allocating items to agents so as to maximize the total payment from all agents, where the payment from an agent is the sum of prices of the items allocated to that agent, capped by the agentʼs budget. In this study, we consider a generalization of the MBA problem in which each item has a capacity constraint, and present two approximation algorithms for it. The first is a polynomial bicriteria algorithm that is guaranteed to output an allocation producing at least 1-r times the optimal feasible total payment, where r is the maximum ratio of price to budget, and to violate the capacity constraints on items by at most a factor of 2. The other is a pseudo-polynomial algorithm with approximation ratio 1/3((· 1-r=4) that always outputs a feasible allocation.

ページトップへ戻る
HOMEに戻る
カレンダー
日 程:2021/10/9(土)
場所:オンライ ン開催
テーマ:地理情 報システム入門
シンポジウム
2021 年春季シンポジウム
開催終了しました。
日 程:2021/3/1(月)
場所:東 京工業大学
(オ ンライン開催)
2021 年秋季シンポジウム
日程:2021/9/15 (水)
場所:九 州大学
(オ ンライン開催)
研究発表会
2021 年春季研究発表会
開催終了しました。
日程:2021/
3/2(月)~3(水)
場所:東 京工業大学
(オ ンライン開催)
2021 年秋季研究発表会
日程:2021/
9/16(水)~17(金)
場所:九 州大学
(オ ンライン開催)
= 会場開催についてのお知らせ=
「新型コロナウイルス感染予防のため、以下について、予め御了承いただけますよう、よろしくお願い 申し上げます。」

● 新型コロナウイルス感染拡大の状況によっては、イベントの開催を中止させていただく場合がございます。 ご来場前に必ず当該イベントのホームページにて開催の有無をご確認下さ い。

●参加者の皆様へのお願い
・発熱、強い倦怠感等の症状がある方は御来場を御遠慮下さい。

・感染予防のため、スタッフはマスクを着用している場合があることを御了承下さい。