Zobrazeno 1 - 10
of 47
pro vyhledávání: '"F. Forgó"'
Autor:
István Joó, F. Forgó
Publikováno v:
Acta Mathematica Hungarica. 77:123-135
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ee44c2b4399a258d10789f13c3e2fb5
https://doi.org/10.1023/a:1006539807749
https://doi.org/10.1023/a:1006539807749
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
R. J. Aumann, L. S. Shapley, E. Baudier, S. D. Bloomfield, F. Forgó, J. P. Kahan, B. Peleg, G. Schwödiauer, Martin Shubik, G. Brewer, F. Szidarovszky, E. O. Thorp, N. N. Vorob'ev
Publikováno v:
International Journal of Game Theory. 1:201-208
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2aa7a1147a8820a5ee6f4964b8824061
https://doi.org/10.1007/bf01753444
https://doi.org/10.1007/bf01753444
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c52dc77bc83602cd903836ce6ea343e
https://doi.org/10.1007/978-94-009-5193-8_20
https://doi.org/10.1007/978-94-009-5193-8_20
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
In previous chapters our investigation of a cooperative game =N, v was based on two fundamental assumptions: (i) each coalition S of players can assure itself a particular amount t;(S) of resource no matter what the remaining players do, (ii) any coa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39a2513ef9b5e20258dc555c7531ae42
https://doi.org/10.1007/978-94-009-5193-8_25
https://doi.org/10.1007/978-94-009-5193-8_25
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
Games played over the unit square can be considered a natural and relatively simple generalization of matrix games. In the case of matrix games each player has a finite number of pure strategies while the pure strategy set of both players engaged in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e312a65e7a90221586c64e6596ca9220
https://doi.org/10.1007/978-94-009-5193-8_16
https://doi.org/10.1007/978-94-009-5193-8_16
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
In the past 10–15 years a new branch of mathematics, mostly referred to as mathematical systems theory, has been developing very fast. It aims at integrating several special mathematical disciplines such as automata theory, theory of dynamic system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a18d00bb5363e50ce010e030739b5382
https://doi.org/10.1007/978-94-009-5193-8_1
https://doi.org/10.1007/978-94-009-5193-8_1
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
Let \(\Gamma = \left\{ {{\Sigma _1},...,{\Sigma _n},{K_1},...,{K_n}} \right\}\) be an n-person game given in normal form. Let \(\sum = {{\sum }_{1}} \times \ldots \times {{\sum }_{n}}\) and $$\Phi = \left\{ {{\bf{f}}\left| {{\bf{f}} = ({K_1}({\bf{x}}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e58b5e750a7c46f2ec45edfbbf2031a8
https://doi.org/10.1007/978-94-009-5193-8_26
https://doi.org/10.1007/978-94-009-5193-8_26
Publikováno v:
Introduction to the Theory of Games ISBN: 9789401087964
Let us assume that the plan of a town can be viewed as a quadratic matrix. The rows and columns represent the streets, the elements of the matrix symbolize the buildings. In one of the buildings a bomb has been hidden. We have enough time to search t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8dc6cd1427fb83cb73d93a3aa37d979
https://doi.org/10.1007/978-94-009-5193-8_15
https://doi.org/10.1007/978-94-009-5193-8_15