Bachelier et son époque : une conversation avec Bernard Bru
Bad(s,t) is hyperplane absolute winning
J. An proved that for any s,t ≥ 0 such that s + t = 1, Bad (s,t) is (34√2)¯¹-winning for Schmidt's game. We show that using the main lemma from [An] one can derive a stronger result, namely that Bad (s,t) is hyperplane absolute winning in the sense of [BFKRW]. As a consequence, one can deduce the full Hausdorff dimension of Bad (s,t) intersected with certain fractals.
Balanced online Ramsey games in random graphs.
Banach-Mazur game played in partially ordered sets
Concepts, definitions, notions, and some facts concerning the Banach-Mazur game are customized to a more general setting of partial orderings. It is applied in the theory of Fraïssé limits and beyond, obtaining simple proofs of universality of certain objects and classes.
Bandwidth Allocation and Pricing Problem for a Duopoly Market
Bank valuation and its connections with the subprime mortgage crisis and basel II capital accord.
Banzhafův index a dvoustupňové hlasovací systémy
V textu představíme tzv. Banzhafův index, který umožňuje kvantifikovat sílu voliče v předepsaném hlasovacím systému. Definice indexu je zcela elementární, podrobnější zkoumání jeho vlastností však vede k zajímavé a hlubší matematice. Výklad je ilustrován řadou konkrétních příkladů ze světa politiky; uvidíme, že díky Banzhafovu indexu se matematika dostala i na stránky novin.
Basic theory of the analytic hierarchy process: How to make a Decision.
Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games
In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of either Bayesian games or deterministic aggregative games. We handle the aggregation function to adapt to incomplete-information situations. Since the feasible strategies are infinite-dimensional functions and lie in a non-compact set, the continuity of types brings barriers to seeking equilibria. To this end, we discretize the continuous...
Beiträge zur Theorie der Vermehrungsformeln
Bertrand oligopoly revisited.
Best proximity sets and equilibrium pairs for a finite family of multimaps.
Biased positional games and small hypergraphs with large covers.
Bifurcation analysis of a Kaldor-Kalecki model of business cycle with time delay.
Bifurcation routes to chaos in an extended Van der Pol's equation applied to economic models.
Bilateral sequential bargaining with perfect information and different protocols
Most research done in the bargaining literature concentrates on the situations in which players get to be proposers alternately, with the first player being the proposer in the first period, the second player being the proposer in the second period, and so on until the cycle ends and the order of proposers is repeated. However, allowing for only this kind of order is a rather simplifying assumption. This paper looks at the situation in which we allow for much more general kind of protocols. We characterize...
Bi-personal stochastic transient Markov games with stopping times and total reward criterion
The article is devoted to a class of Bi-personal (players 1 and 2), zero-sum Markov games evolving in discrete-time on Transient Markov reward chains. At each decision time the second player can stop the system by paying terminal reward to the first player. If the system is not stopped the first player selects a decision and two things will happen: The Markov chain reaches next state according to the known transition law, and the second player must pay a reward to the first player. The first player...
Blocking Wythoff Nim.
Boolean games – Classifying strategies and omitting cardinality assumptions
Borda efficiency of constant scoring rules with large electorates