Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Guillaume Chèze"'
Autor:
Guillaume Chèze
Publikováno v:
Mathematical Social Sciences
Mathematical Social Sciences, Elsevier, 2019, 102, pp.68-72
Mathematical Social Sciences, 2019, 102, pp.68-72
Mathematical Social Sciences, Elsevier, 2019, 102, pp.68-72
Mathematical Social Sciences, 2019, 102, pp.68-72
International audience; In this article we suggest a model of computation for the cake cutting problem. In this model the mediator can ask the same queries as in the Robertson-Webb model but he or she can only perform algebraic operations as in the B
Autor:
Guillaume Chèze
Publikováno v:
Mathematical Social Sciences
Mathematical Social Sciences, Elsevier, 2019, 100, pp.13-15
Mathematical Social Sciences, 2019, 100, pp.13-15
Mathematical Social Sciences, Elsevier, 2019, 100, pp.13-15
Mathematical Social Sciences, 2019, 100, pp.13-15
In this note we study a problem of fair division in the absence of full information. We give an algorithm that solves the following problem: n ≥ 2 persons want to cut a cake into n shares so that each person will get at least 1 ∕ n of the cake fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97a5e0a33ed5ba182ff3d7bc60fd2b50
https://hal.archives-ouvertes.fr/hal-01891147
https://hal.archives-ouvertes.fr/hal-01891147
Autor:
Guillaume Chèze, Thomas Cluzeau
Publikováno v:
Journal of Nonlinear Mathematical Physics
Journal of Nonlinear Mathematical Physics, Taylor & Francis, 2013, 20 (4), pp.475-479. ⟨10.1080/14029251.2013.868260⟩
Journal of Nonlinear Mathematical Physics, 2013, 20 (4), pp.475-479. ⟨10.1080/14029251.2013.868260⟩
Journal of Nonlinear Mathematical Physics, Taylor & Francis, 2013, 20 (4), pp.475-479. ⟨10.1080/14029251.2013.868260⟩
Journal of Nonlinear Mathematical Physics, 2013, 20 (4), pp.475-479. ⟨10.1080/14029251.2013.868260⟩
International audience; We consider generalized Liénard polynomial differential systems. In their work, Llibre and Valls have shown that, except in some particular cases, such systems have no Liouvillian first integral. In this letter, we give a dir
Autor:
Guillaume Chèze, Thierry Combot
Publikováno v:
Foundations of Computational Mathematics
Foundations of Computational Mathematics, Springer Verlag, 2020, 20 (4), pp.681-752. ⟨10.1007/s10208-019-09437-9⟩
Foundations of Computational Mathematics, 2020, 20 (4), pp.681-752. ⟨10.1007/s10208-019-09437-9⟩
Foundations of Computational Mathematics, Springer Verlag, 2020, 20 (4), pp.681-752. ⟨10.1007/s10208-019-09437-9⟩
Foundations of Computational Mathematics, 2020, 20 (4), pp.681-752. ⟨10.1007/s10208-019-09437-9⟩
In this article, we show how to generalize to the Darbouxian, Liouvillian and Riccati case the extactic curve introduced by J. Pereira. With this approach, we get new algorithms for computing, if it exists, a rational, Darbouxian, Liouvillian or Ricc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ce0d7b02a34b85e62dbed7e27097f2a
https://hal.archives-ouvertes.fr/hal-01619911v2/document
https://hal.archives-ouvertes.fr/hal-01619911v2/document
Autor:
Guillaume Chèze
Publikováno v:
Journal of Differential Equations
Journal of Differential Equations, 2015, ⟨10.1016/j.jde.2015.01.027⟩
Journal of Differential Equations, Elsevier, 2015, ⟨10.1016/j.jde.2015.01.027⟩
Journal of Differential Equations, 2015, ⟨10.1016/j.jde.2015.01.027⟩
Journal of Differential Equations, Elsevier, 2015, ⟨10.1016/j.jde.2015.01.027⟩
International audience; In this article we bound the number of remarkable values of a polynomial vector field. The proof is short and based on Jouanolou's theorem about rational first integrals of planar polynomial derivations. Our bound is given in
Autor:
Luca Amodei, Guillaume Chèze
Publikováno v:
Linear Algebra and its Applications
Linear Algebra and its Applications, Elsevier, 2019, 560
Linear Algebra and its Applications, 2019, 560
Linear Algebra and its Applications, Elsevier, 2019, 560
Linear Algebra and its Applications, 2019, 560
In this article we study a problem of fair division. In particular we study a notion introduced by J. Barbanel that generalizes super envy-free fair division. We call this notion hyper envy-free. We give a new proof for the existence of such fair div
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6dab9efe405e627a9a9aa80d02850e12
Autor:
Guillaume Chèze
Publikováno v:
Mathematical Social Sciences
Mathematical Social Sciences, Elsevier, 2017, ⟨10.1016/j.mathsocsci.2017.03.006⟩
Mathematical Social Sciences, 2017, ⟨10.1016/j.mathsocsci.2017.03.006⟩
Mathematical Social Sciences, Elsevier, 2017, ⟨10.1016/j.mathsocsci.2017.03.006⟩
Mathematical Social Sciences, 2017, ⟨10.1016/j.mathsocsci.2017.03.006⟩
International audience; In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5827406122f606ff3b44a9b9b823ec2d
https://hal.archives-ouvertes.fr/hal-01492494
https://hal.archives-ouvertes.fr/hal-01492494
Autor:
Guillaume Chèze
Publikováno v:
Social Choice and Welfare
Social Choice and Welfare, 2017, ⟨10.1007/s00355-017-1032-1⟩
Social Choice and Welfare, Springer Verlag, 2017, ⟨10.1007/s00355-017-1032-1⟩
Social Choice and Welfare, 2017, ⟨10.1007/s00355-017-1032-1⟩
Social Choice and Welfare, Springer Verlag, 2017, ⟨10.1007/s00355-017-1032-1⟩
Consider the framework of topological aggregation introduced by Chichilnisky (Adv Math 37(2):165–176, 1980). We prove that in this framework the twin paradox and the No Show paradox cannot be avoided. Anonymity and unanimity are not needed to obtai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5aa16e76575e416819d7ab0d8db013e
http://arxiv.org/abs/1608.07410
http://arxiv.org/abs/1608.07410
Autor:
Guillaume Chèze, Laurent Busé
Publikováno v:
Journal of Algebra
Journal of Algebra, Elsevier, 2011, 341 (1), pp.256-278. ⟨10.1016/j.jalgebra.2011.06.006⟩
Journal of Algebra, 2011, 341 (1), pp.256-278. ⟨10.1016/j.jalgebra.2011.06.006⟩
Journal of Algebra, Elsevier, 2011, 341 (1), pp.256-278. ⟨10.1016/j.jalgebra.2011.06.006⟩
Journal of Algebra, 2011, 341 (1), pp.256-278. ⟨10.1016/j.jalgebra.2011.06.006⟩
International audience; In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its a
Publikováno v:
Les cours du CIRM. 2:1-14