Добірка наукової літератури з теми "Infinitely repeated game"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Infinitely repeated game".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Infinitely repeated game"
PETROSJAN, L. A., and L. V. GRAUER. "STRONG NASH EQUILIBRIUM IN MULTISTAGE GAMES." International Game Theory Review 04, no. 03 (September 2002): 255–64. http://dx.doi.org/10.1142/s0219198902000689.
Повний текст джерелаAndersen, Garrett, and Vincent Conitzer. "Fast Equilibrium Computation for Infinitely Repeated Games." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 53–59. http://dx.doi.org/10.1609/aaai.v27i1.8573.
Повний текст джерелаRubinstein, Ariel, and Asher Wolinsky. "Remarks on Infinitely Repeated Extensive-Form Games." Games and Economic Behavior 9, no. 1 (April 1995): 110–15. http://dx.doi.org/10.1006/game.1995.1007.
Повний текст джерелаWatson, Joel. "Cooperation in the Infinitely Repeated Prisoners′ Dilemma with Perturbations." Games and Economic Behavior 7, no. 2 (September 1994): 260–85. http://dx.doi.org/10.1006/game.1994.1049.
Повний текст джерелаDal Bó, Pedro, and Guillaume R. Fréchette. "On the Determinants of Cooperation in Infinitely Repeated Games: A Survey." Journal of Economic Literature 56, no. 1 (March 1, 2018): 60–114. http://dx.doi.org/10.1257/jel.20160980.
Повний текст джерелаLehrer, Ehud. "Finitely Many Players with Bounded Recall in Infinitely Repeated Games." Games and Economic Behavior 7, no. 3 (November 1994): 390–405. http://dx.doi.org/10.1006/game.1994.1058.
Повний текст джерелаHäckner, Jonas. "Endogenous product design in an infinitely repeated game." International Journal of Industrial Organization 13, no. 2 (June 1995): 277–99. http://dx.doi.org/10.1016/0167-7187(94)00451-7.
Повний текст джерелаLiu, Jian, Yinzhen Li, and Jun Li. "Coopetition in Intermodal Freight Transport Services." Discrete Dynamics in Nature and Society 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/680685.
Повний текст джерелаKufel, Tadeusz, Sławomir Plaskacz, and Joanna Zwierzchowska. "Strong and Safe Nash Equilibrium in Some Repeated 3-Player Games." Przegląd Statystyczny 65, no. 3 (January 30, 2019): 271–95. http://dx.doi.org/10.5604/01.3001.0014.0540.
Повний текст джерелаDargaj, Jakub, and Jakob Grue Simonsen. "Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria." ACM Transactions on Economics and Computation 10, no. 1 (March 31, 2022): 1–39. http://dx.doi.org/10.1145/3505585.
Повний текст джерелаДисертації з теми "Infinitely repeated game"
Tse, Tsz Kwan. "Strategy Analysis of Infinitely Repeated Public Goods Game and Infinitely Repeated Transboundary Public Goods Game." Kyoto University, 2019. http://hdl.handle.net/2433/245306.
Повний текст джерелаKyoto University (京都大学)
0048
新制・課程博士
博士(経済学)
甲第22111号
経博第604号
新制||経||291(附属図書館)
京都大学大学院経済学研究科経済学専攻
(主査)教授 依田 高典, 教授 岡 敏弘, 講師 五十川 大也
学位規則第4条第1項該当
Ben, Henda Noomene. "Infinite-state Stochastic and Parameterized Systems." Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8915.
Повний текст джерелаA major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization.
Systems with unbounded data structure are natural models for reasoning about communication protocols, concurrent programs, real-time systems, etc. While parameterized systems are more suitable if the system consists of an arbitrary number of identical processes which is the case for cache coherence protocols, distributed algorithms and so forth.
In this thesis, we consider model checking problems for certain fundamental classes of probabilistic infinite-state systems, as well as the verification of safety properties in parameterized systems. First, we consider probabilistic systems with unbounded data structures. In particular, we study probabilistic extensions of Lossy Channel Systems (PLCS), Vector addition Systems with States (PVASS) and Noisy Turing Machine (PNTM). We show how we can describe the semantics of such models by infinite-state Markov chains; and then define certain abstract properties, which allow model checking several qualitative and quantitative problems.
Then, we consider parameterized systems and provide a method which allows checking safety for several classes that differ in the topologies (linear or tree) and the semantics (atomic or non-atomic). The method is based on deriving an over-approximation which allows the use of a symbolic backward reachability scheme. For each class, the over-approximation we define guarantees monotonicity of the induced approximate transition system with respect to an appropriate order. This property is convenient in the sense that it preserves upward closedness when computing sets of predecessors.
Книги з теми "Infinitely repeated game"
Datta, Saikat. On connections betwen renegotiation proof sets of long finitely and infinitely repeated games with low discounting. London: Suntory and Toyota International Centres for Economics and Related Disciplines, 1996.
Знайти повний текст джерелаЧастини книг з теми "Infinitely repeated game"
Velner, Yaron. "The Complexity of Infinitely Repeated Alternating Move Games." In Automata, Languages, and Programming, 816–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39206-1_69.
Повний текст джерелаLam, Ka-man, and Ho-fung Leung. "Formalizing Risk Strategies and Risk Strategy Equilibrium in Agent Interactions Modeled as Infinitely Repeated Games." In Agent Computing and Multi-Agent Systems, 138–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11802372_16.
Повний текст джерела"Infinitely repeated games." In The Theory of Social Situations, 146–56. Cambridge University Press, 1990. http://dx.doi.org/10.1017/cbo9781139173759.010.
Повний текст джерелаТези доповідей конференцій з теми "Infinitely repeated game"
Fang, Yong. "Optimal Strategy of Service Recovery for On-line Shops: Based on Infinitely Repeated Game." In 2011 Fourth International Joint Conference on Computational Sciences and Optimization (CSO). IEEE, 2011. http://dx.doi.org/10.1109/cso.2011.191.
Повний текст джерелаFeldotto, Matthias, and Alexander Skopalik. "A Simulation Framework for Analyzing Complex Infinitely Repeated Games." In 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications. SCITEPRESS - Science and Technology Publications, 2014. http://dx.doi.org/10.5220/0005110406250630.
Повний текст джерелаZhang Xianzhe and Ni Yanling. "Mechanism of agent evaluation based on infinite repeated game." In 2016 13th International Conference on Service Systems and Service Management (ICSSSM). IEEE, 2016. http://dx.doi.org/10.1109/icsssm.2016.7538545.
Повний текст джерелаDong, Hongcheng, and Yifen Mu. "The optimal strategy against Fictitious Play in infinitely repeated games." In 2022 41st Chinese Control Conference (CCC). IEEE, 2022. http://dx.doi.org/10.23919/ccc55666.2022.9902863.
Повний текст джерелаMadhumidha, K., N. Vijayarangan, K. Padmanabhan, B. Satish, N. Kartick, and Viswanath Ganesan. "Probabilistic Tit-for-Tat Strategy versus Nash Equilibrium for Infinitely Repeated Games." In 2017 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2017. http://dx.doi.org/10.1109/csci.2017.26.
Повний текст джерелаJianye Hao and Ho-Fung Leung. "Incorporating Fairness into Infinitely Repeated Games with Conflicting Interests for Conflicts Elimination." In 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012). IEEE, 2012. http://dx.doi.org/10.1109/ictai.2012.50.
Повний текст джерелаLam, Ka-man, and Ho-fu Leung. "Incorporating Risk Attitude and Reputation into Infinitely Repeated Games and an Analysis on the Iterated Prisoner's Dilemma." In 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007). IEEE, 2007. http://dx.doi.org/10.1109/ictai.2007.61.
Повний текст джерелаWang, Zhen, Chunjiang Mu, Shuyue Hu, Chen Chu, and Xuelong Li. "Modelling the Dynamics of Regret Minimization in Large Agent Populations: a Master Equation Approach." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/76.
Повний текст джерелаDargaj, Jakub, and Jakob Grue Simonsen. "A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff." In EC '20: The 21st ACM Conference on Economics and Computation. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3391403.3399520.
Повний текст джерела