Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Backward Induction

Sortuj według:

Ogranicz wyniki do:

Coopetition in international maritime shipping

Lin D. Y., Huang C. C.

Polish Maritime Research

2013

S 1

5--12

The increasingly competitive nature of maritime freight transport has stimulated carriers to improve efficiency and lower costs. The industry has gradually matured, and it has recently become the case that the larger a carrier is, the more competitive advantage it has. Therefore, carriers form strategic alliances to collaborate with each other so that they can reduce their operational costs due to economies of scale. At the same time, such alliances allow carriers to improve the quality of their service by increasing their network coverage. Although carriers collaborate to improve their operational efficiency, they compete with each other simultaneously. In other words, a game of coopetition among carriers has developed in international maritime freight transport in recent years. In this study, we propose a theoretical framework for characterizing coopetition in international maritime shipping and investigating how carriers can manage their business models. Empirical studies, together with salient analytical results, are presented and discussed.

Public Announcement Logic in Geometric Frameworks

Başkent C.

Fundamenta Informaticae

2012

Vol. 118, nr 3

207-223

In this paper, we introduce public announcement logic in different geometric frameworks. First, we consider topological models, and then extend our discussion to a more expressive model, namely, subset space models. Furthermore, we prove the completeness of public announcement logic in those frameworks. After that, we apply our results to different issues: announcement stabilization, backward induction and persistence.

Game Solution, Epistemic Dynamics and Fixed-Point Logics

van Benthem J., Gheerbrant A.

Fundamenta Informaticae

2010

Vol. 100, nr 1/4

19-41

Current methods for solving games embody a form of "procedural rationality" that invites logical analysis in its own right. This paper is a brief case study of Backward Induction for extensive games, replacing earlier static logical definitions by stepwise dynamic ones. We consider a number of analysis from recent years that look different conceptually, and find that they are all mathematically equivalent. This shows how an abstract logical perspective can bring out basic invariant structure in games. We then generalize this to an exploration of fixed-point logics on finite trees that best fit game-theoretic equilibria. We end with some open questions that suggest a broader program for merging current computational logics with notions and results from game theory. This paper is largely a program for opening up an area: an extended version of the technical results will be found in the forthcoming dissertation [26].