%0 Journal Article %J Comptes Rendus Mathematique 348 (2010) 613-618 %D 2010 %T On optimality of c-cyclically monotone transference plans %A Stefano Bianchini %A Laura Caravenna %X Abstract. This note deals with the equivalence between the optimality of a transport plan for the Monge-Kantorovich problem and the condition of c-cyclical monotonicity, as an outcome of the construction in [7]. We emphasize the measurability assumption on the hidden structure of linear preorder, applied also to extremality and uniqueness problems. Resume. Dans la presente note nous decrivons brievement la construction introduite dans [7] a propos de l\\\'equivalence entre l\\\'optimalite d\\\'un plan de transport pour le probleme de Monge-Kantorovich et la condition de monotonie c-cyclique ainsi que d\\\'autres sujets que cela nous amene a aborder. Nous souhaitons mettre en evidence l\\\'hypothese de mesurabilite sur la structure sous-jacente de pre-ordre lineaire. %B Comptes Rendus Mathematique 348 (2010) 613-618 %I Elsevier %G en_US %U http://hdl.handle.net/1963/4023 %1 379 %2 Mathematics %3 Functional Analysis and Applications %$ Submitted by Andrea Wehrenfennig (andreaw@sissa.it) on 2010-09-02T09:13:11Z\\nNo. of bitstreams: 1\\ncmonoNoteCRM.pdf: 154086 bytes, checksum: f2efc74ccfedd2e335ff99ff279b5cfd (MD5) %R 10.1016/j.crma.2010.03.022