information and knowledge management have become crucial to the development of a competitive edge on the market. this requires the gathering of complete and consistent information in an environment where companies are working increasingly with a vast network of partners. in this paper, we investigate the case of platforms on the tourism market selling trips in boxes thanks to a wide network of ...

Let m, q, ` be positive integers such that m ≥ ` ≥ q. A family H of functions from [m] to [q] is said to be an (m, q, `)-family if for every subset S of [m] with ` elements, there is an h ∈ H such that h(S) = [q]. Let, N(m, q, `) be the size of the smallest (m, q, `)-family. We show that for all q, ` ≤ 1.58q and all sufficiently large m, we have N(m, q, `) = exp(Ω(q)) logm. Special cases of thi...

I study dynamic games where players may be unaware of some fundamentals of the game itself, such as actions or players, and such unawareness may be lifted by other players’ actions during the play. Based on Li (2006a, 2006b), I propose a framework to deal with such games using standard tools of game theory. I construct examples to show that unawareness is distinctly different from assigning zer...

The intersection of the genetics era and information age poses unique and daunting challenges for health consumers who may not have the health literacy to keep pace. While rapid advances in genetics research promise enhanced care, the inherent complexities and individualistic nature of genetic information have resulted in a challenging information environment. The technical possibilities for ac...

For n-person perfect inlbrmation stochastic games and for n-person stochastic games with Additive Rcwards and Additive Transitions (ARAT) we show the existence of pure limiting average equilibria. Using a similar approach we also derive the existence of limiting average e-equilibria for two-person switching control stochastic games. The orderfield property holds for each of the classes mentione...

We consider a two-person zero-sum stochastic game with an innnite time horizon. The payoo is a linear combination of expected total discounted rewards with diierent discount factors. For a model with a countable state space and compact action sets, we characterize the set of persistently optimal (sub-game perfect) policies. For a model with nite state and action sets and with perfect informatio...

We consider n–player perfect information games with payoff functions having a finite image. We do not make any further assumptions, so in particular we refrain from making assumptions on the cardinality or the topology of the set of actions and assumptions like continuity or measurability of payoff functions. We show that there exists a best response cycle of length four, that is, a sequence (σ...

The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...