Bachelor of Engineering, Yamagata University

Master of Engineering, University of Tsukuba

Ph.D (Engineering), University of Tsukuba

Auction Theory, Mathematical Optimization, Experimental Economics

Informatics, Computational science

Humanities & social sciences, Theoretical economics

Social infrastructure (civil Engineering, architecture, disaster prevention), Safety engineering

Social infrastructure (civil Engineering, architecture, disaster prevention), Social systems engineering

Informatics, Mathematical informatics

Informatics, Information theory

01 Nov. 2015 - 30 Sep. 2020
Nagoya Institute of Technology, Project Associate Professor

01 Apr. 2013 - 31 Mar. 2018
電気通信大学大学院, システム情報工学研究科, 助教

01 Apr. 2012 - 31 Mar. 2013
JSPS, Research Fellow (DC2)

Apr. 2010 - Mar. 2013
University of Tsukuba, Graduate School of Systems and Information Engineering, Doctoral Program in Social Systems and Management

07 Apr. 2001 - 31 Mar. 2004
Kurosawajiri Kita Prefectural High School

01 Apr. 2013 - 31 Mar. 2015
編集幹事, 日本オペレーションズ・リサーチ学会論文誌編集委員, Society

Mar. 2022
経営科学系研究部会連合協議会
SCTTMによるユーザ属性を考慮した潜在嗜好変化の時系列推定
令和3年度データ解析コンペティション成果報告会審査員特別賞, 富川雄斗;青柳和樹;寺崎海翔;佐々木極昇;羽田野湧太;荒木麻帆;伊藤尚紀;住谷祐太;高橋里司;岡本吉央
Japan society

Jul. 2018
7th International Congress on Advanced Applied Informatics
An Acceleration Method for Equilibrium Solution Search in Multiple OD Selfish Routing Games
Best Student Paper Award, Guu Kofujita;Satoshi Takahashi
International society

Mar. 2008
情報処理学会
情報処理学会学生奨励賞

2007
日本パーソナルコンピュータ利用技術学会
研究奨励賞

Pseudo Session-Based Recommendation with Hierarchical Embedding and Session Attributes.
Yuta Sumiya; Ryusei Numata; Satoshi Takahashi
DS, 582-596, Oct. 2023
International conference proceedings

SCTTMによるユーザ属性を考慮した潜在嗜好変化の時系列推定
住谷 祐太,富川 雄斗,伊藤 尚紀,高橋 里司
Last, 日本オペレーションズ・リサーチ学会機関誌 オペレーションズ・リサーチ誌, 68, 2, 56-66, 01 Feb. 2023, Peer-reviwed, Invited, False
Scientific journal, Japanese

Pseudo session-based recommendation with hierarchical embedding and session attributes.
Yuta Sumiya; Ryusei Numata; Satoshi Takahashi
CoRR, abs/2306.10029, 2023
Scientific journal

A Subject Experiment of an Approximate DGS Algorithm: Price Increment, Allocative Efficiency, and Sellersʼs Revenue
Yoichi Izunaga, Satoshi Takahashi, and Naoki Watanabe
2022 IEEE International Conference on Big Data (Big Data), IEEE, 1, 1, 3273-3280, Dec. 2022, Peer-reviwed, False
International conference proceedings, English

Multi-objective Searching on Multimodal Transportation Networks.
Yuta Hatano; Satoshi Takahashi
IIAI-AAI-Winter, 32-37, 2022
International conference proceedings

An experimental study of VCG mechanism for multi-unit auctions: competing with machine bidders
Satoshi Takahashi; Yoichi Izunaga; Naoki Watanabe
Evolutionary and Institutional Economics Review, Springer Japan, 1-27, 07 Feb. 2021, Peer-reviwed
Scientific journal, English

The Maximum k Weighted Distance-d Independent Set problem on interval graph
Yoshito Atsuta; Satoshi Takahashi
8th International Conference on Smart Computing and Artificial Intelligence and inclusion in the conference proceedings, IEEE CPS, 1, 1, 840-841, 01 Sep. 2020, Peer-reviwed
International conference proceedings, English

Tourists Movement Analysis Based on Entropies of Markov Process
Naohiro Ishii; Kazuya Odagiri; Hidekazu Iwamoto; Satoshi Takahashi; Tokuro Matsuo
8th International Conference on Smart Computing and Artificial Intelligence and inclusion in the conference proceedings, Springer, 1, 1, 573-584, 01 Sep. 2020, Peer-reviwed
International conference proceedings, Japanese

Pruning Algorithms for A Replicator Dynamics Method in Multiple OD Selfish Routing Games
G. Kofujita; S. Takahashi
International Journal of Smart Computing and Artificial Intelligence, IIAI, 3, 2, 40-56, 19 Nov. 2019, Peer-reviwed
Scientific journal, English

Descending auction model using mari considering the consumer market
Tomoki Morimoto; Satoshi Takahashi
Proc. of 32nd International Conference on Computer Applications in Industry and Engineering, 1, 1, 1-10, 30 Sep. 2019, Peer-reviwed
International conference proceedings, English

VCG mechanism for multi-unit auctions and appearance of information: a subject experiment
S. Takahashi; Y. Izunaga; N. Watanabe
Evolutionary and Institutional Economics Review, Springer Science and Business Media LLC, 16, 31, 1-18, 24 Jul. 2019, Peer-reviwed
Scientific journal, English

An Envy-free Pricing Algorithm for Multi Item Market with Covering Constraints
Hirofumi Mizuno; Satoshi Takahashi
proc. of 8th International Congress on Advanced Applied Informatics, 1, 1, In-Press-IN-Press, Jul. 2019, Peer-reviwed
International conference proceedings, English

Approach to Problem of Minimizing Network Power Consumption Based on Robust Optimization
B.C. Das; S. Takahashi; E. Oki; M. Muramatsu
International Journal of Communication Systems, 32, 5, e3891, 25 Mar. 2019, Peer-reviwed
Scientific journal, Japanese

A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
Y. Matsuda; S. Takahashi
Optimization Letters, Springer, 13, 2, 341-348, 05 Dec. 2018, Peer-reviwed
Scientific journal, English

An Acceleration Method for Equilibrium Solution Search in Multiple OD Selfish Routing Games
Guu Kofujita; Satoshi Takahashi
proc. of 7th International Congress on Advanced Applied Informatics, 1, 1, In-Press-IN-Press, Jul. 2018, Peer-reviwed
International conference proceedings, English

Emergency logistics network design based on hub-and-spork network
Kanako Ojima; Satoshi Takahashi
Proc. of 3rd International Conference on Electric Vehicle, Smart Grid and Information Technology, 1, 1, 12-15, May 2018, Peer-reviwed
International conference proceedings, English

An Approximation Algorithm for Multi-unit Auctions: Numerical and Subject Experiments
S. Takahashi; Y. Izunaga; N. Watanabe
Operations Research and Decision, 28, 1, 95-115, 13 Apr. 2018, Peer-reviwed
Scientific journal, English

Improved Simulation Adjusting
K. Hoki; N. Araki; S. Takahashi; M. Muramatsu
ICGA journal, 39, 3-4, 195-204, 09 Mar. 2018, Peer-reviwed
Scientific journal, English

Revenue improvement mechanisms based on advertisement’s values and layouts
Satoshi Takahashi; Tokuro Matsuo
Advances in Intelligent Systems and Computing, Springer Verlag, 685, 270-280, 2018, Peer-reviwed, We study an advertisement transaction market which is considering a value of advertisement in addition to monetary value. This paper proposes a novel model for advertisement transactions which employs two stages auctions. To improve an advertisement value for advertisers, it is important to consider not only advertisement sizes and its allocations but also its combinations for the advertisers’ marketing strategies. The two stages auction aims to improve the advertisement value and seller’s revenue. The concept of our model is that the advertisers can consider own marketing strategies for the auction. The first auction winner can choose some preferred other advertisers to make a second auction, and also he/she can reject inconvenient advertisers. The first auction winner can consider the marketing strategy by making a convenient bidders set in the second auction.
International conference proceedings, English

Network Congestion Minimization Models Based on Robust Optimization
B.C. Das; S. Takahashi; M. Muramatsu; E. Oki
IEICE Trans. on Communication, The Institute of Electronics, Information and Communication Engineers, E101-B, 3, 772-784, 2018, Peer-reviwed,

This paper introduces robust optimization models for minimization of the network congestion ratio that can handle the fluctuation in traffic demands between nodes. The simplest and widely used model to minimize the congestion ratio, called the pipe model, is based on precisely specified traffic demands. However, in practice, network operators are often unable to estimate exact traffic demands as they can fluctuate due to unpredictable factors. To overcome this weakness, we apply robust optimization to the problem of minimizing the network congestion ratio. First, we review existing models as robust counterparts of certain uncertainty sets. Then we consider robust optimization assuming ellipsoidal uncertainty sets, and derive a tractable optimization problem in the form of second-order cone programming (SOCP). Furthermore, we take uncertainty sets to be the intersection of ellipsoid and polyhedral sets, and considering the mirror subproblems inherent in the models, obtain tractable optimization problems, again in SOCP form. Compared to the previous model that assumes an error interval on each coordinate, our models have the advantage of being able to cope with the total amount of errors by setting a parameter that determines the volume of the ellipsoid. We perform numerical experiments to compare our SOCP models with the existing models which are formulated as linear programming problems. The results demonstrate the relevance of our models in terms of congestion ratio and computation time.

Scientific journal, English

A Human Subject Experiment for Online Mechanism in Dynamic Environment Auctions
Proc. of 6th International Congress on Advanced Applied Informatics, 1, 1, 919-922, Jul. 2017, Peer-reviwed
International conference proceedings, English

A Dynamic Programming Method for A Reverse Auction Model in Service Choice Markets
Keita Tsuji; Satoshi Takahashi
Proc. of 6th International Congress on Advanced Applied Informatics, 1, 1, 1057-1058, Jul. 2017, Peer-reviwed
International conference proceedings, English

Experiments for Online Mechanism in EV Charge Markets
Satoshi Takahashi
Proc. of 2nd International Conference on Electric Vehicle, Smart Grid, and Information Technology, 1, 1, 30-31, Mar. 2017, Peer-reviwed
International conference proceedings, English

Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
Yuki Sukenari; Kunihito Hoki; Satoshi Takahashi; Masakazu Muramatsu
DISCRETE APPLIED MATHEMATICS, ELSEVIER SCIENCE BV, 215, 31-40, Dec. 2016, Peer-reviwed, We consider a competitive diffusion process for two players on two-dimensional toroidal grid graphs. Pure Nash equilibria for the game are completely characterized; i.e., for arbitrary-sized toroidal grid graphs, we list all the initial positions that are pure Nash equilibria. (C) 2016 Elsevier B.V. All rights reserved.
Scientific journal, English

Goods sharing problems for emergency supply
Hirofumi Mizuno; Satoshi Takahashi
Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016, Institute of Electrical and Electronics Engineers Inc., 1168-1173, 31 Aug. 2016, Peer-reviwed, According to national government white paper, about four hundred thousand people have used two thousand shelters at the Great East Japan Earthquake in 2011. In this white paper, almost shelters did not have enough relief goods for evacuees, and also transportation capacities of relief goods were not enough by fuel shortage. Since it is difficult to estimate how many evacuees will come to the shelter, we can consider that the necessary relief goods satisfaction of each shelter is not same. Furthermore, it is necessary to consume the relief goods efficiently under the disaster. In this paper, we propose a goods sharing model based on demand and priority of shelters, which considers multiple relief goods. Also we formulate this problem as a mathematical optimization problem based on vehicle routing problems. To evaluate our model, we investigate a computational experiment by using Chofu city (in Tokyo) data.
International conference proceedings, English

Fundamental Protocol of Electricity Power Trades in Smart Grid
Tokuro Matsuo; Satoshi Takahashi
1st International Conference on Electric Vehicle, Smart Grid, and Information Technology, 1, 1, 24-25, 2016, Peer-reviwed
International conference proceedings, English

Optimal Strategy for Sellers in VCG based Electric Power Market
Satoshi Takahashi; Tokuro Matsuo
1st International Conference on Electric Vehicle, Smart Grid, and Information Technology, 1, 1, 28-29, 2016, Peer-reviwed
International conference proceedings, English

A revenue improvement auction protocol for advertisement transactions
Satoshi Takahashi; Tokuro Matsuo
31st International Conference on Computers and Their Applications, 1, 1, In press-In Press, 2016, Peer-reviwed
International conference proceedings, English

An agent based heuristics for large synchronized task allocation
S. Takahashi; T. Matsuo
Information Engineering Express, 1, 1, 29-36, 2015, Peer-reviwed
Scientific journal, English

目標値が不明確な場合の近最適化アルゴリズム
稲田禎一; 高橋里司; 松尾徳朗
パーソナルコンピュータ利用技術学会論文誌, パーソナルコンピュータ利用技術学会論文誌編集委員会, 9, 1--2, 34-39, 2015, Peer-reviwed
Scientific journal, Japanese

配合と特性の線形関係の次元解析
稲田禎一; 高橋里司; 松尾徳朗
パーソナルコンピュータ利用技術学会論文誌, パーソナルコンピュータ利用技術学会論文誌編集委員会, 9, 1--2, 28-33, 2015, Peer-reviwed
Scientific journal, Japanese

特性の時間依存性を考慮した配合の数理設計
稲田禎一; 高橋里司; 松尾徳朗
パーソナルコンピュータ利用技術学会論文誌, パーソナルコンピュータ利用技術学会論文誌編集委員会, 9, 1--2, 21-27, 2015, Peer-reviwed
Scientific journal, Japanese

An Evaluation Method for Similarity of Materials Combination
Satoshi Takahashi; Teiichi Inada; Tokuro Matsuo
28th International Conference on Computer Applications in Industry and Engineering, 1, 1, 217-220, 2015, Peer-reviwed
International conference proceedings, English

An optimal ordering problem for juggling
Yusuke Sato; Satoshi Takahashi
2015 International Conference on Computer Application Technologies (CCATS), IEEE, 1, 1, 154-155, 2015, Peer-reviwed, The juggling is a one of physical skills involving the manipulation of objects for recreation, entertainment, art, or sport. In our research, we focus on the toss juggling. Our research is a mathematical modeling for optimal ordering for toss juggling.
International conference proceedings, English

An optimal routing problem for attraction with a fast pass constraint
Kyohei Sakayori; Satoshi Takahashi
2015 International Conference on Computer Application Technologies (CCATS), IEEE, 1, 1, 156-157, 2015, Peer-reviwed, There are some recommendation sites for many popular amusement parks. It is difficult for visitors to find the best way of moving about with enjoyment, excitement and relaxation. Our research is to model to find an optimal routing of amusement parks with fast pass constraint.
International conference proceedings, English

Revenue improvement mechanism based on advertisement’s values and layouts
Satoshi Takahashi; Tokuro Matsuo
International Workshop on Collective intelligence and crowd/social computing in The Tenth International Conference on Knowledge, Information and Creativity Support Systems, 1, 1, 248-256, 2015, Peer-reviwed
International conference proceedings, English

New Trading Evaluation Mechanism on Incentive Design
T. Matsuo; K. Murakata; S. Takahashi
International Journal of Hybrid Information Technology, 7, 5, 213-224, 2014, Peer-reviwed
Scientific journal, English

Power Efficient Virtual Machine Packing for Green Datacenter
Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise
International Journal of Next-Generation Computing, 4, 2, 162-181, Jul. 2013, Peer-reviwed
Scientific journal, English

An Approach to Co-Dependent Value Based Internet Advertisement Auction
S. Takahashi; T. Matsuo; R.Y. Lee
International Journal of Software Innovation, 1, 2, 1-15, 2013, Peer-reviwed
Scientific journal, English

Advertisement Pricing and Layout Mechanism in GlobalAd
Satoshi TAKAHASHI; Tokuro MATSUO; Roger Y. LEE
Information Journal, 16, 2(B), 1547-1554, 2013, Peer-reviwed
Scientific journal, English

省電力化のためのマッチングに基づく仮想計算機パッキングアルゴリズム
高橋 里司; 竹房 あつ子; 繁野 麻衣子; 中田 秀基; 工藤 知宏; 吉瀬 章子
SACSIS2012論文集, 333-340, May 2012, Peer-reviwed
Japanese

Virtual Machine Packing Algorithms for Lower Power Consumption
Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise
2012 SC COMPANION: HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SCC), IEEE, 1517-+, 2012, Peer-reviwed
International conference proceedings, English

隣接数に着目したハイパーグラフ上のコミュニティ抽出 (最適化手法の深化と広がり)
Miyagawa,Hiroyuki; Shigeno,Maiko; Takahashi,Satoshi; Zhang,Mingchao
RIMS Kokyuroku, Kyoto University, 1773, 0, 121-131, Jan. 2012
Research institution, Japanese

Virtual Machine Packing Algorithms for Lower Power Consumption
Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise
2012 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM), IEEE, 161-168, 2012, Peer-reviwed, Virtual Machine(VM)-based flexible capacity management is an effective scheme to reduce total power consumption in the data centers. However, there remain the following issues, trade-off between power-saving and user experience, decision on VM packing plans within a feasible calculation time, and collision avoidance for multiple VM live migration processes. In order to resolve these issues, we propose two VM packing algorithms, a matching-based (MBA) and a greedy-type heuristic (GREEDY). MBA enables to decide an optimal plan in polynomial time, while GREEDY is an aggressive packing approach faster than MBA. We investigate the basic performance and the feasibility of proposed algorithms under both artificial and realistic simulation scenarios, respectively. The basic performance experiments show that the algorithms reduce total power consumption by between 18% and 50%, and MBA makes suitable VM packing plans within a feasible calculation time. The feasibility experiments show that the proposed algorithms are feasible to make packing plans for an actual supercomputer, and GREEDY has the advantage in power consumption, but MBA shows the better performance in user experience.
International conference proceedings, English

A Winner Determination Method on Global Ad Service: Model and Formulation
Satoshi Takahashi; Yuji Hashiura; Roger Y. Lee; Tokuro Matsuo
SOFTWARE AND NETWORK ENGINEERING, SPRINGER-VERLAG BERLIN, 413, 67-+, 2012, Peer-reviwed, The Global Ad is a system to be used when users apply to publish their advertisement on newspapers. The advertisement is registered and uploaded on database that can be viewed by advertising agency. In actual use by multiple users, the system needs to allocate advertising spaces on the newspaper and to calculate the cost to publish the advertisements. Also, the system need to solve a problem like a packing problem with publishing costs/bid value. To solve the problems, in this paper, we propose a winner determination method using 2-dimensional knapsack problem.
International conference proceedings, English

Effects of Computational Mechanism Design in User Evaluation System
T. Matsuo; K. Murakata; S. Takahashi
Proc. of the 11th International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government, 237-247, 2012, Peer-reviwed
International conference proceedings, English

A Fundamental Modeling of Wireless Mesh Network for Emergency Communications
S. Takahashi; T. Matsuo
Proc. of the 11th International Conference on Wireless Networks, 239-243, 2012, Peer-reviwed
International conference proceedings, English

Reassuring Electronic Commerce Mechanism Design in User Evaluation System
S. Takahashi; K. Murakata; T. Matsuo
Proc. of the 27th International Conference on Computers and Their Applications, 222-229, 2012, Peer-reviwed
International conference proceedings, English

A decision method in B2B E-commerce model based on multi-items auction
Satoshi Takahashi; Tokuro Matsuo
Journal of Information Processing, 20, 3, 649-654, 2012, Peer-reviwed, This paper proposes a new B2B electronic commerce model from bidding information in double auctions. In B2B electronic commerce, buyers try to purchase multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase multiple items in the model. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. To find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps
first the mechanism determines winners of buyers' side, second the mechanism determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. Advantages of this paper are that each d eveloper can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. Contribution of this paper includes two parts. One is creating a mathematical model of procurement auction, which is able to apply to practical situation. The other is proposing dynamic mechanism for the procurement auction. © 2012 Information Processing Society of Japan.
Scientific journal, English

Virtual Machine Packing Algorithms for Lower Power Consumption
Satoshi Takahashi; Atsuko Takefusa; Maiko Shigeno; Hidemoto Nakada; Tomohiro Kudoh; Akiko Yoshise
2012 SC COMPANION: HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SCC), IEEE, 5, 5, 1519-+, 2012, Peer-reviwed
International conference proceedings, English

AN EFFICIENT TRADING MODEL FOR HYBRID TRADERS
Satoshi Takahashi; Tokuro Matsuo
APPLIED ARTIFICIAL INTELLIGENCE, TAYLOR & FRANCIS INC, 26, 8, 715-732, 2012, Peer-reviwed, The Intelligent agent technology has been developing and makes a contribution to efficient trading of items. In this article, we define a hybrid trader as a type of new user who behaves as both the buyer and the seller. Also, we analyze the trading models and develop a trading mechanism. In the volume-discount trading scheme, hybrid traders form coalitions to purchase items, because a coalition has a greater budget for purchases than a single hybrid trader does. Therefore, we create an incentive for coalitions by using a side payment policy and propose a decision-making method for efficient side payment values. To analyze decisions about side payment value's, we consider two situations: one is a dynamic mechanism based on participation probability, and the other is a systematic mechanism based on the coalition's contribution. Also, in multiple-item trading, we discuss the strategy analyses.
Scientific journal, English

Effects of Value-Based Mechanism in Online Advertisement Auction
Yosuke Motoki; Satoshi Takahashi; Yoshihito Saito; Tokuro Matsuo
COMPUTER AND INFORMATION SCIENCE 2011, SPRINGER-VERLAG BERLIN, 364, 179-+, 2011, Peer-reviwed, In recent years, the listing service is widely used in search site such as Yahoo!, Google, and MSN. In the service, advertising fee and advertising order are decided by the auction that is called Generalized Second Price Auction (GSP) and the auction is actually employed in a lot of search service sites. There are a lot of researches on GSP in order to analyze and clarify its feature and advantages. However, in those researches, the advertisement is mutually independent. Additionally, the value of advertisement is not considered. In this paper, we propose a new mechanism based on GSP that is used in advertisement auctions. Each advertisement has some value, because users click the advertisement when it may be useful for them. We analyze the auctioneer's profit in comparison between normal GSP, normal VCG (Vickrey-Clarke-Groves Mechanism) and our proposed mechanism. The contribution of our research includes to clarify the features and advantages of advertisement auctions and effects to website owner's profit rate.
International conference proceedings, English

学務情報機構における多属性嗜好表明システムデザイン
橋浦悠二; 藤本貴之; 寺島賢紀; 高橋里司; 齋藤義人; 松尾徳朗
パーソナルコンピュータ利用技術学会論文誌, パーソナルコンピュータ利用技術学会編集委員会, 5, 1, 8-17, 2011, Peer-reviwed
Scientific journal, Japanese

Approximation algorithms for a winner determination problem of single-item multi-unit auctions
S. Takahashi; M. Shigeno
JSIAM letters, 3, 29-32, 2011, Peer-reviwed
Scientific journal, English

Effective electronic advertisement auction system
Tokuro Matsuo; Satoshi Takahashi
Communications in Computer and Information Science, 266, 2, 169-178, 2011, Peer-reviwed, A structure of the Internet advertisement is that the service providers decide order of placement of many advertisements and advertising fees by auctions when advertisers offer their promotions. It is known that Generalized Second Price Auction (GSP) mechanism is most efficient auction mechanism of the advertisement auction. Some searching sites employ GSP mechanism basically. There are a lot of researches on GSP in order to analyze and clarify its feature and advantages. However, these researches assume that traded advertisements are mutually independent. That is means that each advertisement does not influence other advertisements. Also these researches do not consider a value of advertisement, which means some criterions of a name value of a company, an effectiveness and an importance, that is dependently each other. This paper proposes a new advertisement auction mechanism based on GSP with considering the value of advertisement. We analyze the auctioneer's profit in comparison between normal GSP, normal VCG (Vickrey-Clarke-Groves Mechanism) and our proposed mechanism. The contribution of our research includes to clarify the features and advantages of advertisement auctions and effects to search service sites' profit rate. © 2011 Springer-Verlag.
International conference proceedings, English

An Effectiveness Analysis of Value-Based Mechanism in the Internet Advertisement Auction
Tokuro Matsuo; Satoshi Takahashi
COMMUNICATION AND NETWORKING, PT II, SPRINGER-VERLAG BERLIN, 266, 169-+, 2011, Peer-reviwed, A structure of the Internet advertisement is that the service providers decide order of placement of many advertisements and advertising fees by auctions when advertisers offer their promotions. It is known that Generalized Second Price Auction (GSP) mechanism is most efficient auction mechanism of the advertisement auction. Some searching sites employ GSP mechanism basically. There are a lot of researches on GSP in order to analyze and clarify its feature and advantages. However, these researches assume that traded advertisements are mutually independent. That is means that each advertisement does not influence other advertisements. Also these researches do not consider a value of advertisement, which means some criterions of a name value of a company, an effectiveness and an importance. that is dependently each other. This paper proposes a new advertisement auction mechanism based on GSP with considering the value of advertisement. We analyze the auctioneer's profit in comparison between normal GSP. normal VCG (Vickrey-Clarke-Groves Mechanism) and our proposed mechanism. The contribution of our research includes to clarify the features and advantages of advertisement auctions and effects to search service sites' profit rate.
International conference proceedings, English

Reassuring Electronic Commerce Mechanism based on User Evaluation Controlling
K. Murakata; S. Takahashi; T. Matsuo
International Journal of Computer and Information Science, 12, 2, 1-8, 2011, Peer-reviwed
Scientific journal, English

最大密度部分集合問題と近似2分探索による解法
張明超; 高橋里司; 繁野麻衣子
日本オペレーションズ・リサーチ学会和文論文誌, The Operations Research Society of Japan, 53, 1-13, 2010, Peer-reviwed, This paper deals with a problem of finding maximum density subsets on a set system, which is a generalization of a maximum density subgraph problem. Some examples show a set system model detects communities different from a graph model, which says that a generalization of a density subgraph problem and its algorithm to on a set system is important. By combining approximate binary search and a maximum flow algorithm, an efficient algorithm for finding maximum density subsets is developed. We also discuss how a framework of the proposed approximate binary search algorithm can be applied for a weighted version of the problem and for a maximum mean cut problem.
Scientific journal, Japanese

An agent simulation heuristics for snowplowing problems
S. Takahashi; T. Matsuo
Proc. of the 21st International Conference on System Engineering, 159-161, 2010, Peer-reviwed
International conference proceedings, English

An approach to multi-stage calculation method for multiple items B2B E-commerce
Satoshi Takahashi; Tokuro Matsuo
Proceedings - 9th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2010, 317-322, 2010, Peer-reviwed, This paper proposes a new B2B electronic commerce model by using bidding information in double auctions. In B2B electronic commerce, buyers try to purchase in multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase in multiple items. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. But to find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps, first a mechanism determines winners of buyers' side, then, determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. The auction protocol trees are expressed by all possible results of auctions. The result of each auction is recorded and stored with bidding data and conditions for subsequent auctions. Advantages of this paper are that each developer can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. © 2010 IEEE.
International conference proceedings, English

A Coalition Structure-based Decision Method in B2B E-Commerce Model with Multiple-Items
S. Takahashi; T. Matsuo
New Trends in Agent-Based Complex Automated Negotiations, Studies in Computational Intelligence (T. Ito, M. Zhang, V. Robu, S. Fatima and T. Matsuo eds.), 383, 99-109, 2010, Peer-reviwed
Scientific journal, English

Community Extraction in Hypergraphs Based on Adjacent Numbers
Hiroyuki Miyagawa; Maiko Shigeno; Satoshi Takahashi; Mingchao Zhang
OPERATIONS RESEARCH AND ITS APPLICATIONS, WORLD PUBLISHING CORPORATION, 12, 309-316, 2010, Peer-reviwed, Community extraction plays an important role in network analysis. This paper discusses communities in hypergraphs. Since hypergraphs can represent multi-relational networks, they are important structures in many domains. In this study, the definition of communities based on the number of adjacent links/nodes is extended to a hypergraph. Four extended models are proposed. The adequacy of these models for hypergraph communities is investigated by using a hypergraph obtained from joint work relationships.
International conference proceedings, English

A virtual distributed computing system based on multi-steps task allocation
Satoshi Takahashi; Tokuro Matsuo
2010 IEEE International Conference on Information Reuse and Integration, IRI 2010, 405-406, 2010, Peer-reviwed, We propose a network based virtual distributed computing system and multi-steps task allocation method considered divided and integration of the problem. In this paper, we formulate a task allocation problem with complication condition and propose a multi-steps allocation method for speed-up. Also we discuss information integration particularly omputation result data. © 2010 IEEE.
International conference proceedings, English

A Trading Mechanism Based on Interpersonal Relationship in Agent-Based Electronic Commerce
Tokuro Matsuo; Takaaki Narabe; Yoshihito Saito; Satoshi Takahashi
NEW CHALLENGES IN COMPUTATIONAL COLLECTIVE INTELLIGENCE, SPRINGER, 244, 291-302, 2009, Peer-reviwed, Recently, electronic commerce has been increasing and is also a promising field of applied multiagent technology. In the automated electronic marketplace, agents can trade as buyers and sellers. Buyers and sellers agents evaluate each tradable item with each other, and buy/sell the item. Many electronic commerce sites provide high anonymity for sellers and buyers. Even though there is a special relationship between them such as friends in real world, they generally can not know their individual information in electronic commerce. In actual trade in real world, item's price is sometimes affected by the relationship between them. This paper focuses on the trading in which buyers and sellers have an asserted relationship such as colleague in a company. This paper analyzes items' values which is defined by items' prices and the relationships. Also, we propose a trading protocol including the relationship between sellers and buyers based on the analysis. In the protocol. first, the seller and the buyer evaluate the relationship. Then, the successful trader is determined based oil synthesis evaluations. Finally, the seller and successful buyers trade with each other in the calculated price. The Advantage of our protocol is that appropriate evaluations of trading partners can be obtained by various attributes based on Multi-Attribute Utility Theory.
International conference proceedings, English

Hierarchical Decision Support System based on Scenario analysis
S. Takahashi; T. Matsuo
International Journal of Electronics and Computer Science, 11, 1, 67-74, 2009, Peer-reviwed
Scientific journal, English

A Cooperation Trading Method with Hybrid Traders
Satoshi Takahashi; Tokuro Matsuo
PRINCIPLES OF PRACTICE IN MULTI-AGENT SYSTEMS, SPRINGER-VERLAG BERLIN, 5925, 608-+, 2009, Peer-reviwed, We present a new trading scheme in e-commerce in which end-users behave both buyers and sellers. We define hybrid traders as new users, analyze their trading models. and develop a trading mechanism. In our trading scheme. hybrid traders forge coalition formations to put-chase items. since hybrid traders do not have enough money purchase extensive items. We create an incentive or coalitions using a side payment policy. We propose a side payment value decision mechanism based on the coalition's contribution. Also, in multiple-item trading, we discuss the strategy analyses.
International conference proceedings, English

An electronic economic mechanism based on interpersonal relationship
Takaaki Narabe; Yoshihito Saito; Satoshi Takahashi; Tokuro Matsuo
2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009, 431-438, 2009, Peer-reviwed, Recently, electronic commerce has been increasing. In the electronic marketplace, buyers and sellers evaluate each item with each other, and buy/sell the item. The history of trading are stored in the database and can be used it by traders in subsequent trading. Human relationships information of traders can also be stored by applying and change the database in the electronic commerce system. In actual trade in real world, item's price is sometimes affected by the relationship between them. This paper focuses on the trading in which buyers and sellers have an asserted relationship such as friend on the Internet. This paper analyzes items' values which is defined by items' prices and the relationships. Also, we propose a trading protocol including the relationship between sellers and buyers based on the analysis. In the protocol, first, the seller and the buyer evaluate the relationship. Then, the successful trader is determined based on synthesis evaluations. Finally, the seller and successful buyers trade with each other in the calculated price. The Advantage of our protocol is that appropriate evaluations of trading partners can be obtained by various attributes based on Multi-Attribute Utility Theory. © 2009 IEEE.
International conference proceedings, English

企業における危機管理教育のための支援システムの検討
高橋里司; 藤本貴之; 松尾徳朗
コンピュータ&エデュケーション, CIEC, 25, 100-105, 2008, Peer-reviwed, In this paper, we propose the system design about risk management education support system used by companies' staffs. We sort the risks systematically, and analyze cause of it. Our system architectures are based on this analysis. We consider staff education is important of risk perception. However, risk perception processes are different from experts and amateurs. We must design the system for amateurs, since the companies' staffs are amateurs. Therefore, we propose education method based on perception of amateurs. Also, we indicate the problem of traditional staff education, and describe the efficiency of an interactive education method.
Scientific journal, Japanese

A Cooperation Dealing Model of Hybrid Traders based on Volume Discount
S. Takahashi; T. Matsuo
Electronic Commerce: Theory and Practice (M. Yokoo, T. Ito, M. Zhang, J. Lee and T. Matsuo eds.), 1, 100-112, 2008, Peer-reviwed
Scientific journal, English

An Approach to Efficient Trading Model of Hybrid Traders Based on Volume Discount
Satoshi Takahashi; Tokuro Matsuo
NEW CHALLENGES IN APPLIED INTELLIGENCE TECHNOLOGIES, SPRINGER, 134, 45-54, 2008, Peer-reviwed, This paper proposes a new cooperation business model in which hybrid traders exist. We define hybrid traders as new traders on the Internet. Hybrid traders can become both buyers and sellers. We assume that hybrid traders do not have enough money. To buy items cheaply, hybrid traders cooperate with other traders. In regard to buying items, we consider a volume discount-based trading. We propose a mechanism in which trader cooperates, buys in a lot of goods, and increases own utility. Our mechanism adopts side payment to promote increasingly cooperation with traders. Cooperative traders commit participation based on a value of side payment. We extend mechanism which hybrid traders deal with multiple items. This mechanism shows new decision of side payment and proposer's strategy.
International conference proceedings, English

A formalization of quantity based double auction mechanism
Satoshi Takahashi
ICSENG 2008: INTERNATIONAL CONFERENCE ON SYSTEMS ENGINEERING, IEEE COMPUTER SOC, 201-204, 2008, Peer-reviwed, Auction researches are promising field of applied autonomous agent technologies. In this paper, we formalize a double auction, which uses non-linear value function including divides items trading. In this trading, the valuation of the item is decided by quantum of the trading. In this regard, we consider multiple situations, because buyers' and sellers' value functions are not uniquely decided. In this paper, we give some feature examples, and suggest an analysis method. To solve the discontinuous function problem, we propose supplementation presumption method.
International conference proceedings, English

Risk management education support system in company
Satoshi Takahashi; Muhammad Dzulqarnain; Takayuki Fujimoto; Tokuro Matsuo
PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION, IEEE, 137-+, 2008, Peer-reviwed, In resent years, many companies engender fraudulences and affairs, and affront several crises. Such situations are defined as risks and are classified with some parts and hierarchies. Low-leveled risk does not relate with company, management directly, however, it sometimes develops the high-leveled risk, such as the company, bankruptcy, and the matter of controversy. Studies on risk management attract a high level of interest for company consultants and risk analyzers. It is important for a company to obtain a high level of efficiency, since bankruptcy, often occurs when a small problem develops into a crisis due to inefficient management. Our system detects low-level risks and reasons a high level it, which is very important. Further, in this paper, we propose a novel staff education system concerned with risks, which includes staff's tasks and duties. Staffs sometimes are not aware of learning issues in which they should study, about risks, because most of traditional learning methods for occupants are based on lectures and audiovisual aids. Our system provides appropriate information to enhance their consciousness of risk management on their operations.
International conference proceedings, English

Negotiation Process based on Hybrid Trader with Side Payment
S. Takahashi; T. Matsuo
Proc. of the first International Joint Conference on Knowledge Science, 179-184, 2007, Peer-reviwed
International conference proceedings, English

1-G-4 さまざまなグラフにおける情報拡散ゲームのナッシュ均衡に関する考察(学生セッション:意思決定)
櫻井 亮佑; 村松 正和; 高橋 里司; 保木 邦仁
公益社団法人日本オペレーションズ・リサーチ学会, 26 Mar. 2015, 日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集, 2015, 144-145, Japanese, 110009981417, AN00351206

完全正値性の判定に関する数値実験 (最適化アルゴリズムの進展 : 理論・応用・実装)
田口 良典; 高橋 里司; 村松 正和
京都大学, Jan. 2015, 数理解析研究所講究録, 1931, 37-46, Japanese, 1880-2818, 110009881112, AN00061013

2-F-2 低ランク整数完全正値行列の判定について(連続最適化(3))
川瀬 弘樹; 村松 正和; 高橋 里司
公益社団法人日本オペレーションズ・リサーチ学会, 06 Mar. 2014, 日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集, 2014, 236-237, Japanese, 110009830812, AN00351206

A Decision Method in B2B E-Commerce Model based on Multi-Items Auction
Satoshi Takahashi; Tokuro Matsuo
This paper proposes a new B2B electronic commerce model from bidding information in double auctions. In B2B electronic commerce, buyers try to purchase multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase multiple items in the model. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. To find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps; first the mechanism determines winners of buyers' side, second the mechanism determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. Advantages of this paper are that each d eveloper can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. Contribution of this paper includes two parts. One is creating a mathematical model of procurement auction, which is able to apply to practical situation. The other is proposing dynamic mechanism for the procurement auction.------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.649------------------------------This paper proposes a new B2B electronic commerce model from bidding information in double auctions. In B2B electronic commerce, buyers try to purchase multiple items at the same time, since a buyer develops something products by using purchased items. Also suppliers have an incentive of making coalitions, since buyers want to purchase multiple items in the model. A mechanism designer has to consider an optimal mechanism which calculates an optimal matching between buyers and suppliers. To find an optimal matching is very hard, since a mechanism calculates all combinations between buyers and suppliers. Consequently, we propose a calculation method which has two steps; first the mechanism determines winners of buyers' side, second the mechanism determines coalitions and winners of suppliers by using the result of buyers' side. This paper also discusses the improved method with dynamical mechanism design by using the bidding information. Advantages of this paper are that each d eveloper can procure the components to develop a certain item and tasks are allocated to suppliers effectively. The previous result of auction data can be available to shorten the period of winner determinations. Contribution of this paper includes two parts. One is creating a mathematical model of procurement auction, which is able to apply to practical situation. The other is proposing dynamic mechanism for the procurement auction.------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.20.649------------------------------, 15 May 2012, 情報処理学会論文誌, 53, 5, English, 1882-7764, 110009423615, AN00116647

消費電力削減のための仮想計算機パッキング問題に対する解法
高橋里司; 竹房あつ子; 繁野麻衣子; 中田秀基; 工藤知宏; 吉瀬章子
27 Mar. 2012, 日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集, 2012, 62-63, Japanese, 1883-1893, 201202291837832510

除雪車スケジューリング問題に対するエージェントシミュレーションヒューリスティック (第6回パーソナルコンピュータ利用技術学会全国大会)
高橋 里司; 松尾 徳朗
パーソナルコンピュータ利用技術学会, 27 Nov. 2011, パーソナルコンピュータ利用技術学会全国大会講演論文集, 6, 53-56, Japanese, 1881-8005, 40019204979

階層的データベースに基づくシナリオ分析型意思決定支援手法
高橋 里司; 松尾 徳朗
パーソナルコンピュータ利用技術学会, 28 Nov. 2010, パーソナルコンピュータ利用技術学会全国大会講演論文集, 5, 195-198, Japanese, 1881-8005, 40017437492

A Cooperated Agent Simulation for Huge Task Allocation Problem
TAKAHASHI Satoshi; MATSUO Tokuro
26 Nov. 2010, 電気学会研究会資料. IS, 情報システム研究会, 2010, 73, 35-39, Japanese, 10027632681, AA11471762

A decision support method based on scenario analysis for SMEs
TAKAHASHI Satoshi; MATSUO Tokuro
07 Sep. 2009, 電気学会研究会資料. IS, 情報システム研究会, 2009, 55, 15-19, Japanese, 10026072585, AA11471762

F-030 Multiple Items B2B E-Commerce Model with Bidding Information
Takahashi Satoshi; Matsuo Tokuro
Forum on Information Technology, 20 Aug. 2009, 情報科学技術フォーラム講演論文集, 8, 2, 457-458, Japanese, 110008100444, AA1242354X

A Distributed Calculation Method for Risk Management System
TAKAHASHI Satoshi; DATE Hiroshi; HATANO Norihiko; DZULQARNAIN Muhammad; SAITO Yoshihito; OZAWA Jun; MATSUO Tokuro
13 Mar. 2008, 全国大会講演論文集, 70, 437-438, Japanese, 110006867755, AN00349328

A Dicision Making of Hybrid Traders in Multiple Items Dealing
TAKAHASHI Satoshi; MATSUO Tokuro
13 Mar. 2008, 全国大会講演論文集, 70, 257-258, Japanese, 110006865434, AN00349328

The Proceedings of 2015 International Conference on Computer Application Technologies
Satoshi Takahashi; Antoine Bossard; Yohei Shiraki; Toshiyuki Tanaka
Others, English, Joint editor, IEEE CPS, 31 Aug. 2015, 9781467382113

The Proceedings of 15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2014
J. Y. Jo; S. Takahashi
Scholarly book, English, Joint editor, IEEE CPS, 30 Jun. 2014

The Proceedings of 14th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2014
R.Y. Lee; S. Takahashi
Scholarly book, English, Joint editor, IEEE CPS, 02 Jul. 2013

A Study of the Parking Lot Matching Problem
Mai Fujita; Satoshi Takahashi
Oral presentation, English, International Symposium on Applied Information Technologies and Innovative Applications
06 Mar. 2024
06 Mar. 2024- 07 Mar. 2024

Finding Feasible Crowdfunding Mechanism Using Duality Theory
Yuki Wakayama; Satoshi Takahashi
Oral presentation, English, International Symposium on Applied Information Technologies and Innovative Applications
06 Mar. 2024
06 Mar. 2024- 07 Mar. 2024

Social optimization
Satoshi Takahashi
Keynote oral presentation, English, International Forum on ICT Research Professionals 2023, Invited
21 Aug. 2023
21 Aug. 2023- 25 Aug. 2023

Class selection problem in university using optimization problem
Hiroyuki Maruyama; Satoshi Takahashi; Tokuro Matsuo
Oral presentation, English, 14th International Congress on Advanced Applied Informatics, Peer-reviewed
13 Jul. 2023
08 Jul. 2023- 13 Jul. 2023

An Experimental Study of an Approximate DGS Auction
Satoshi Takahashi
Invited oral presentation, English, International Forum on Smart Systems and Service Management, Invited
16 Mar. 2023
15 Mar. 2023- 17 Mar. 2023

Multi-objective Searching on Multimodal Transportation Networks
Yuta Hatano; Satoshi Takahashi
Oral presentation, English, 13th International Congress on Advanced Applied Informatics, Peer-reviewed
12 Dec. 2022
12 Dec. 2022- 14 Dec. 2022

Multi-objective Optimization for Multimodal Transport Problems
Satoshi Takahashi
Invited oral presentation, English, ISAAI2022, Invited, IIAI, Koriyama, Japan, International conference
22 Sep. 2022

社会最適化における理想と課題
高橋里司
Invited oral presentation, Japanese, 人間行動科学とサービス応用に関するシンポジウム, Invited, Research Team on Convention & Service studies, 東京都品川区, http://rtcss.org/pbl2022-symp/, Domestic conference
17 Sep. 2022

Game theoretic and social optimization approach to traffic control and design
Satoshi Takahashi
Invited oral presentation, Japanese, International Symposium on Applied Informatics Innovations, Invited, Domestic conference
22 Mar. 2022

あなたの強さは何番目？
高橋里司
Public discourse, Japanese, 社会システム分析シンポジウム, Invited, 東京都立産業技術大学院大学人工知能とサービス科学研究所
05 Mar. 2022

身近にできる最適化
高橋里司
Public discourse, Japanese, 応用最適化技術セミナー, Invited, 東京都立産業技術大学院大学人工知能とサービス科学研究所
26 Feb. 2022

Crowdfunding mechanism design based on duality theorem
Invited oral presentation, English, International Forum on Applied Information Technology and Social Informatics, Invited, International conference
12 Jan. 2022

国際会議における地域の魅力の提示と参加者の満足度向上
高橋里司
Invited oral presentation, Japanese, 第８回国際観光コンベンションシンポジウム, Invited, 東京都立産業技術大学院大学 人工知能とサービス科学研究所, 特定非営利活動法人 国際応用情報学研究機構（IIAI）, Research Team on Convention & Service studies（RTCSS）, Domestic conference
26 Oct. 2021

Game theory approach to solve traffic congestion
Satoshi Takahashi
Invited oral presentation, English, AIIT / DCS-BINUS International Symposium On Decision Science And Consensus Formation, Invited, AIIT / DCS-BINUS, International conference
14 Feb. 2021

My approaches to traffic design
Satoshi Takahashi
Invited oral presentation, English, IIAI AIT 2020, Invited, International conference
19 Dec. 2020

Beat the traffic jam – computation and game theoretic approach-
Satoshi Takahashi
Invited oral presentation, English, IIAI International Applied Informatics Congress, Invited, International conference
01 Nov. 2019

Invited lecture in ICT Human Capital Development Program in South Asia Country
Public discourse, English, Invited, ICT Human Capital Development Program in South Asia Country, Walailak University in Nakhon Si Thammarat, Thailand
13 Mar. 2018

産業の中の数理最適化:組合せ最適化とその応用
高橋里司
Invited oral presentation, Japanese, 自動車技術会フォーラム「数学・数理科学の最近の進展に基づく自動車の制御・モデリングの新展開, Invited, Domestic conference
2017

Hard to compute in the world - Connection between discrete optimization and computation theory-
Satoshi Takahashi
Invited oral presentation, Japanese, 自動車技術会自動車制御とモデル研究専門委員会, Invited, 自動車技術会自動車制御とモデル研究専門委員会, 化学会館, 本チュートリアルでは，離散最適化の基礎から，世の中の様々な問題をモデル化する事例を紹介し，計算量理論と離散アルゴリズムについて解説を行う．, Domestic conference
11 Oct. 2016

Invited lecture in ICT Human Capital Development Program in South Asia Country
Satoshi Takahashi
Public discourse, English, Invited, ICT Human Capital Development Program in South Asia Country, Bina Nusantara University in Jakarta, Indonesia
28 Apr. 2016

災害発生時における物資共有計画問題
水野博文; 高橋里司
Oral presentation, Japanese, 日本オペレーションズ・リサーチ学会春季研究発表会, 日本オペレーションズ・リサーチ, 慶応義塾大学日吉キャンパス, Domestic conference
18 Mar. 2016

広告価値と配置に基づくリベニュー改善
高橋里司
Oral presentation, Japanese, 電気学会情報システム研究会, 電気学会情報システム研究会, 長崎, Domestic conference
11 Sep. 2015

横断的研究によるオークションシステムの実用化
高橋里司
Invited oral presentation, Japanese, 文部科学省委託事業「数学協働プログラム」ワークショップ社会システムデザインのための数理と社会実装へのアプローチ, Invited, 九州大学 マス・フォア・インダストリ研究所, 九州大学 マス・フォア・インダストリ研究所, Domestic conference
11 Feb. 2015

An optimal routing problem for attraction with a fast pass constraint
Satoshi Takahashi
Poster presentation, English, International Conference on Computer Application Technologies, International conference
2015

An optimal ordering problem for juggling
Satoshi Takahashi
Poster presentation, English, International Conference on Computer Application Technologies, International conference
2015

Social Optimization with Computational Methods
Satoshi Takahashi; Tokuro Matsuo
Public discourse, English, International Conference on Computers and Their Applications, International conference
29 Mar. 2014

Social Optimization with Computational Methods
Satoshi Takahashi; Tokuro Matsuo
Public discourse, English, International Conference on Computers and Their Applications, International Conference on Computers and Their Applications, International conference
29 Mar. 2014

ジャグリングにおける最適演技順序決定
佐藤優介; 高橋里司
Oral presentation, Japanese, 第9回パーソナルコンピュータ利用技術学会全国大会, パーソナルコンピュータ利用技術学会, Domestic conference
2014

Mathematical Optimization Techniques in Algorithmic Social Design
S. Takahashi
Public discourse, English, SEITI meeting on Central Michigan University, Invited, Software Engineering and Information Technology Institute, Central Michigan University, International conference
2013

GlobalAd: Online On-Demand Advertising - Material Handling Module
Vitesh C. SHAH; Satoshi TAKAHASHI; Tokuro MATSUO; Roger LEE
Oral presentation, English, The 11th International Conference on Foundations of Computer Science
2012

省電力化のためのマッチングに基づく仮想計算機パッキングアルゴリズム
高橋里司; 竹房あつ子; 繁野麻衣子; 中田秀基; 工藤知宏; 吉瀬章子
Oral presentation, Japanese, 先進的計算基盤システムシンポジウム論文集,SACSIS2012 - 先進的計算基盤システムシンポジウム
2012

消費電力削減のための仮想計算機パッキング問題に対する解法
高橋里司; 竹房あつ子; 繁野麻衣子; 中田秀基; 工藤知宏; 吉瀬章子
Oral presentation, Japanese, 日本オペレーションズリサーチ学会春季研究発表会
2012

Risk Management Support System for Organization
Satoshi Takahashi
Invited oral presentation, English, International Symposium on Applied Informatics
2011

除雪車スケジューリング問題に対するエージェントシミュレーションヒューリスティック
高橋里司; 松尾徳朗
Oral presentation, Japanese, 第6回JPCATS全国大会
2011

従業員の勤務時間を平準化するシフトの作成
竹口哲平; 高橋里司; 岡田幸彦; 吉瀬章子
Oral presentation, Japanese, 日本オペレーションズ・リサーチ学会秋季研究発表会
2011

VCGメカニズムによるオークションの最適供給量に関する一考察
高橋里司; 繁野麻衣子
Oral presentation, English, 日本オペレーションズ・リサーチ学会秋季研究発表会
2011

隣接数に着目したハイパーグラフ上のコミュニティ抽出
高橋里司; 宮川裕幸; 繁野麻衣子; 張明超
Oral presentation, English, 京都大学数理解析研究所研究集会-最適化手法の深化と広がり-
2011

階層的データベースに基づくシナリオ分析型意思決定支援手法
高橋里司; 松尾徳朗
Oral presentation, Japanese, 第5回JPCATS全国大会
2010

大規模タスク割当て問題に対する協調的エージェントシミュレーション
高橋里司; 松尾徳朗
Oral presentation, Japanese, 電気学会情報システム研究会
2010

単一財複数ユニットオークションの勝者決定問題に対する高速近似解法
高橋里司
Oral presentation, Japanese, 日本応用数理学会 2010年 研究部会 連合発表会，離散システム研究会
2010

An Algorithm for a Maximum Density Subset Problem based on Approximate Binary Search
Satoshi TAKAHASHI; Mingchao ZHANG; Maiko SHIGENO
Oral presentation, English, 20th International Symposium on Mathematical Programming
2009

単一財複数ユニットオークションの勝者決定問題に対する高速近似解法
高橋里司
Invited oral presentation, Japanese, 制度・政策デザインワークショップ
2009

中小企業向けシナリオ分析に基づく意思決定支援手法
高橋里司; 松尾徳朗
Oral presentation, Japanese, 電気学会情報システム研究会
2009

入札情報を利用した複数財B2B取引モデル
高橋里司; 松尾徳朗
Oral presentation, Japanese, 情報技術フォーラム(FIT2009)
2009

企業におけるリスクマネジメント支援システム
高橋里司; 藤本貴之; 松尾徳朗
Oral presentation, Japanese, インタラクティブ2009
2009

複数財を扱うハイブリッドトレーダーの意思決定について
高橋里司; 松尾徳朗
Oral presentation, Japanese, 第７０回情報処理学会全国大会
2008

組織におけるリスク管理教育支援システム
高橋里司; Muhammad Dzulqarnain; 藤本貴之; 松尾徳朗
Oral presentation, Japanese, 電子情報通信学会教育工学研究会
2008

組織のリスク管理支援のための分割計算手法について
高橋里司; 松尾徳朗; Muhammad Dzulqarnain; 伊達浩; 波多野紀彦; 齋藤義人; 小澤潤
Oral presentation, Japanese, 第７０回情報処理学会全国大会
2008

組織におけるリスク管理のための簡易計算手法の提案
高橋里司; Muhammad Dzulqarnain; 松尾徳朗
Oral presentation, Japanese, 第2回JPCATS全国大会
2007

Operations Research
Apr. 2023 - Present
Seikei University

大学院技術英語
The University of Electro-Communications

大学院技術英語
電気通信大学

離散数学
The University of Electro-Communications

離散数学
電気通信大学

コンピュータサイエンス実験第二
The University of Electro-Communications

情報数理工学実験第二
The University of Electro-Communications

コンピュータサイエンス実験第二
The University of Electro-Communications

コンピュータサイエンス実験第二
電気通信大学

情報数理工学実験第二
The University of Electro-Communications

情報数理工学実験第二
電気通信大学

情報領域演習第一
The University of Electro-Communications

情報数理工学実験第一
The University of Electro-Communications

Mathematical Models in Games
The University of Electro-Communications

ゲームの数理
電気通信大学

情報領域演習第一
The University of Electro-Communications

情報領域演習第一
電気通信大学

情報・通信演習２
The University of Electro-Communications

情報・通信演習２
電気通信大学

情報領域演習第二
The University of Electro-Communications

情報領域演習第二
電気通信大学

情報・通信演習１
The University of Electro-Communications

情報・通信演習１
電気通信大学

情報工学工房
The University of Electro-Communications

情報工学工房
The University of Electro-Communications

情報工学工房
電気通信大学

情報・通信工学演習１
The University of Electro-Communications

コンピュータサイエンス実験第一
The University of Electro-Communications

総合コミュニケーション科学
The University of Electro-Communications

総合コミュニケーション科学
電気通信大学

情報・通信工学演習２
The University of Electro-Communications

情報・通信工学演習２
電気通信大学

情報工学演習第二
The University of Electro-Communications

情報工学演習第二
電気通信大学

情報・通信工学演習１
The University of Electro-Communications

情報・通信工学演習１
電気通信大学

情報数理工学実験第一
The University of Electro-Communications

情報数理工学実験第一
電気通信大学

コンピュータサイエンス実験第一
The University of Electro-Communications

コンピュータサイエンス実験第一
電気通信大学

情報処理学会

日本オペレーションズリサーチ学会

日本応用数理学会

ACM

ACIS

経路選択ゲームを用いた交通渋滞の定量評価と交通施策基盤の整備
高橋里司
交通渋滞において，交通網全体の混雑度を測ることは交通政策立案上重要である.その上で，混雑の適切な分散により混雑の緩和を実現する施 策が必要である.この問題の解決のために，混雑の均衡状態を分析する利己的経路選択ゲームによるモデル化を用いた分析や，公共政策のため のインセンティブ設計などを行う必要がある.本研究の目的は，(1)利己的経路選択ゲームを現実の交通をモデル化できるように拡張し，(2)そ の均衡状態を効率よく計算できるアルゴリズムを開発し，(3)適切な交通政策を立案できる機構を構築することである.
01 Apr. 2020 - 31 Mar. 2025

Duality and error analysis on conic programming through facial reduction algorithms
Muramatsu Masakazu
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), There are two major achievements in this project. The first one is to show that the upper bound of the iterations of Facial Reduction Algorithms (FRA) applied to a (nonlinear) cone containing polyhedral cones, depends only on that of the nonlinear part; in other words, we can safely ignore the polyhedral cones at least from the viewpoint of FRA. The other is to extend two of Chubanov's algorithms proposed for homogeneous LPs using projection and rescaling to symmetric cones and semi-infinite polyhedral cones, respectively. For these algorithms, we implemented them only for the semidefinite programming problem and conducted numerical experiments. The latter algorithm evaluates the number of iterations using the "volume" of the feasible region as the conditional number. Especially if if the condition number is zero, then FRA, the main theme of this project, should be applied to the conic programming problem., 17K00031
01 Apr. 2017 - 31 Mar. 2021

産業における人工知能の応用研究
open DNA, 研究助成
20 Jan. 2020

英語教育アプリケーションの評価とデータ分析
高橋里司
（株）ＯｐｅｎＤＮＡ, 研究助成
27 Dec. 2019

観光産業に対する数理工学の応用に関する研究
株式会社JBE
19 Aug. 2019

電子市場における取引者信頼度向上を実現する自動制度設計機構の開発
松尾徳朗
01 Apr. 2015 - 31 Mar. 2019

産業における人工知能の応用研究
open DNA, 研究助成
01 Jun. 2018

実用的オークションシステム構築の理論及び実験的発展
高橋里司
Principal investigator
01 Apr. 2014 - 31 Mar. 2016

実問題への適応能力のあるネットワーク最適化アルゴリズムと構造解析手法の発展的展開
繁野麻衣子
01 Apr. 2013 - 31 Mar. 2016

出張講義
Appearance, 東京都立上野高等学校, Visiting lecture
20 Sep. 2023 - 20 Sep. 2023

14th International Congress on Advanced Applied Informatics
Academic society etc, Planning etc, 14th International Institute of Advanced Applied Informatics, 08 Jul. 2023 - 13 Jul. 2023

奨学寄付金(1,000,000円)
2019 - 2019

奨学寄付金(700,000)
2018 - 2018