SUMMARY
We consider a robust variant of Dirac-type problems in kk-uniform hypergraphs. For instance, we prove that if H\mathcal{H} is a kk-uniform hypergraph with minimum codegree at least (12+?)n\left(\frac 12 + \gamma \right)n, ?>0\gamma >0, and nn is sufficiently large, then any edge coloring ?\phi satisfying appropriate local constraints yields a properly colored tight Hamilton cycle in H\mathcal{H}. Similar results for loose cycles are also shown.