Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Shao Chin Sung"'
Publikováno v:
Proceedings of the 31st European Safety and Reliability Conference (ESREL 2021).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e674912b9bce17995f7cbc945bcb3ff8
https://doi.org/10.3850/978-981-18-2016-8_648-cd
https://doi.org/10.3850/978-981-18-2016-8_648-cd
Publikováno v:
2020 Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modeling (APARM).
In the real world, many infrastructures, for example, the internet, power/water supply and traffics, are network systems where high reliability is required. Independently, these systems may need costs for the construction or maintenance of components
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6adb962d348cde6b5412989f08e8fe0
https://doi.org/10.1109/aparm49247.2020.9209355
https://doi.org/10.1109/aparm49247.2020.9209355
Autor:
Shao Chin Sung1 son@jaist.ac.jp, Vlach, Milan2 mvlach@ksi.ms.m ..cuni.cz
Publikováno v:
Social Choice & Welfare. Aug2004, Vol. 23 Issue 1, p103-111. 9p.
Publikováno v:
Asia-Pacific Journal of Operational Research. Nov2002, Vol. 19 Issue 2, p195. 10p.
Autor:
Mayuko Miyata, Shao Chin Sung
Publikováno v:
Journal of Advanced Computational Intelligence and Intelligent Informatics. 16:430-435
In this paper, we propose game theoretical models for developing staffing strategies, i.e., strategies which support managers’ decision making on hiring, head hunting, staff reassignment, and implementation of staff development policy in enterprise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8673158cefc636d7483bb969f1547b16
https://doi.org/10.20965/jaciii.2012.p0430
https://doi.org/10.20965/jaciii.2012.p0430
Publikováno v:
Journal of Advanced Computational Intelligence and Intelligent Informatics. 16:420-424
We are concerned with a model of network formation games, called local connection games, in which networks are formed based on players’ strategies. Each player may decide to build links to other players by paying a certain cost fixed in advance, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37ee313fc2853fe65b55c5aa9794b176
https://doi.org/10.20965/jaciii.2012.p0420
https://doi.org/10.20965/jaciii.2012.p0420
Autor:
Shao Chin Sung, Dinko Dimitrov
Publikováno v:
Journal of Mathematical Economics. 43:130-134
Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869–887] introduce a top responsiveness condition on players’ preferences in hedonic games and show that it guarantees the existence of a core stable partition. In the present note
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d373482b07cf49b9956bbac57e7ddb22
https://doi.org/10.1016/j.jmateco.2006.11.001
https://doi.org/10.1016/j.jmateco.2006.11.001
Autor:
Dinko Dimitrov, Shao Chin Sung
Publikováno v:
Theory and Decision. 62:31-45
We present a unified look at myopic stability concepts for hedonic games, and discuss the status of the existence problems of stable coalition structures. In particular, we show that contractual strictly core stable coalition structures always exist,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2741d9aceee84678486d9239c10323a3
https://doi.org/10.1007/s11238-006-9022-2
https://doi.org/10.1007/s11238-006-9022-2
Publikováno v:
Social Choice and Welfare. 26:421-433
In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79863d6943b1de53cf96eff31af5903c
https://doi.org/10.1007/s00355-006-0104-4
https://doi.org/10.1007/s00355-006-0104-4
Autor:
Ondřej Epek, Shao Chin Sung
Publikováno v:
Computers & Operations Research. 32:3265-3271
In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d7b830d45d708b05303d778a8f9fb9c
https://doi.org/10.1016/j.cor.2004.05.011
https://doi.org/10.1016/j.cor.2004.05.011