Page 1

Displaying 1 – 20 of 20

Showing per page

Game saturation of intersecting families

Balázs Patkós, Máté Vizer (2014)

Open Mathematics

We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = 1, 2, …, n alternately, one at each turn, so that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed k-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone...

Generalized Choquet spaces

Samuel Coskey, Philipp Schlicht (2016)

Fundamenta Mathematicae

We introduce an analog to the notion of Polish space for spaces of weight ≤ κ, where κ is an uncountable regular cardinal such that κ < κ = κ . Specifically, we consider spaces in which player II has a winning strategy in a variant of the strong Choquet game which runs for κ many rounds. After discussing the basic theory of these games and spaces, we prove that there is a surjectively universal such space and that there are exactly 2 κ many such spaces up to homeomorphism. We also establish a Kuratowski-like...

Growth-optimal portfolios under transaction costs

Jan Palczewski, Łukasz Stettner (2008)

Applicationes Mathematicae

This paper studies a portfolio optimization problem in a discrete-time Markovian model of a financial market, in which asset price dynamics depends on an external process of economic factors. There are transaction costs with a structure that covers, in particular, the case of fixed plus proportional costs. We prove that there exists a self-financing trading strategy maximizing the average growth rate of the portfolio wealth. We show that this strategy has a Markovian form. Our result is obtained...

GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs

Y. Caseau (2009)

RAIRO - Operations Research

Cet article décrit une approche de la modélisation d'un système d'acteurs, particulièrement adaptée à la modélisation des entreprises, fondée sur la théorie des jeux [11] et sur l'optimisation par apprentissage du comportement de ces acteurs. Cette méthode repose sur la combinaison de trois techniques : la simulation par échantillonnage (Monte-Carlo), la théorie des jeux pour ce qui concerne la recherche d'équilibre entre les stratégies, et les méthodes heuristiques d'optimisation locale,...

Guessing secrets.

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Gδ -sets in topological spaces and games

Winfried Just, Marion Scheepers, Juris Steprans, Paul Szeptycki (1997)

Fundamenta Mathematicae

Players ONE and TWO play the following game: In the nth inning ONE chooses a set O n from a prescribed family ℱ of subsets of a space X; TWO responds by choosing an open subset T n of X. The players must obey the rule that O n O n + 1 T n + 1 T n for each n. TWO wins if the intersection of TWO’s sets is equal to the union of ONE’s sets. If ONE has no winning strategy, then each element of ℱ is a G δ -set. To what extent is the converse true? We show that:  (A) For ℱ the collection of countable subsets of X:   1. There are subsets...

Currently displaying 1 – 20 of 20

Page 1