IDEAS home Printed from https://ideas.repec.org/f/pca586.html
   My authors  Follow this author

Jean-François Caulier
(Jean-Francois Caulier)

Personal Details

First Name:Jean-Francois
Middle Name:
Last Name:Caulier
Suffix:
RePEc Short-ID:pca586
http://centres.fusl.ac.be/CEREC/document/people/caulier.html
43 Bd du Jardin Botanique, 1000 Bruxelles Belgium

Affiliation

(in no particular order)

Centre de Recherche en Économie (CEREC) (Economics Research Center)
Université Saint-Louis (Saint Louis University)

Bruxelles/Brussel, Belgium
https://cerec.be/
RePEc:edi:cefslbe (more details at EDIRC)

Centre d'Économie de la Sorbonne (Sorbonne Economic Centre)
Université Paris 1 (Panthéon-Sorbonne) (University of Paris 1)

Paris, France
https://centredeconomiesorbonne.cnrs.fr/
RePEc:edi:cenp1fr (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Alvin Roth, 2017. "Les marchés où l'argent ne fait pas la loi," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01766690, HAL.
  2. Jean-François Caulier, 2014. "Fondements mathématiques pour l'économie et la gestion," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01070812, HAL.
  3. CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2013. "Allocation rules for coalitional network games," LIDAM Discussion Papers CORE 2013032, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. Jean-François Caulier & A. Mauleon & Jose J. Sempere-Monerris & Vincent Vannetelbosch, 2013. "Stable and efficient coalitional networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00854094, HAL.
  5. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Documents de travail du Centre d'Economie de la Sorbonne 13063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  6. Jean-François Caulier, 2011. "The Interpretation of the Laakso-Taagepera Effective Number of Parties," Documents de travail du Centre d'Economie de la Sorbonne 11006, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  7. Jean-François Caulier, 2010. "On the measurement of Fragmentation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633613, HAL.
  8. Jean-François Caulier, 2009. "A note on the monotonicity and superadditivity of TU cooperative games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633612, HAL.
  9. Jean-Francois Caulier & Ana Mauleon & Vincent VAnnetelbosch, 2007. "Contractually Stable Networks," NajEcon Working Paper Reviews 843644000000000084, www.najecon.org.
  10. Caulier, Jean-François & Dumont, Patrick, 2005. "The effective number of relevant parties : how voting power improves Laakso-Taagepera’s index," MPRA Paper 17846, University Library of Munich, Germany.
    repec:hal:pseose:halshs-01207823 is not listed on IDEAS

Articles

  1. Jean-François Caulier & Alexandre Skoda & Emily Tanimura, 2017. "Allocation Rules for Networks Inspired by Cooperative Game-Theory," Revue d'économie politique, Dalloz, vol. 127(4), pages 517-558.
  2. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
  3. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
  4. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "Editorial: Contributions to game theory and social choice," Annals of Operations Research, Springer, vol. 225(1), pages 1-2, February.
  5. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
  6. Jean-François Caulier & Ana Mauleon & Jose Sempere-Monerris & Vincent Vannetelbosch, 2013. "Stable and efficient coalitional networks," Review of Economic Design, Springer;Society for Economic Design, vol. 17(4), pages 249-271, December.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Alvin Roth, 2017. "Les marchés où l'argent ne fait pas la loi," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01766690, HAL.

    Cited by:

    1. Romain Biard & Marc Deschamps, 2020. "Quel impact pour les taxis si la loi supprimait toute différence règlementaire entre taxis et VTC ?," Working Papers 2020-03, CRESE.

  2. CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2013. "Allocation rules for coalitional network games," LIDAM Discussion Papers CORE 2013032, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. Manuel Förster & Ana Mauleon & Vincent Vannetelbosch, 2013. "Trust and Manipulation in Social Networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881145, HAL.
    2. Ana Mauleon & Vincent Vannetelbosch, 2013. "Relative Concerns and Delays in Bargaining with Private Information," Games, MDPI, vol. 4(3), pages 1-10, June.
    3. PAPAVASILIOU, Anthony & HE, Yi & SVOBODA, Alva, 2013. "Self-commitment of combined cycle units under electricity price uncertainty," LIDAM Discussion Papers CORE 2013051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Kirchsteiger, Georg & Mantovani, Marco & Mauleon, Ana & Vannetelbosch, Vincent, 2016. "Limited farsightedness in network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 128(C), pages 97-120.
    5. LAMAS, Alejandro & MLINAR, Tanja & CHEVALIER, Philippe, 2013. "Revenue management for operations with urgent orders," LIDAM Discussion Papers CORE 2013046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Chih‐Sheng Hsieh & Lung‐Fei Lee & Vincent Boucher, 2020. "Specification and estimation of network formation and network interaction models with the exponential probability distribution," Quantitative Economics, Econometric Society, vol. 11(4), pages 1349-1390, November.
    7. AVELLA, Pasquale & BOCCIA, Maurizio & WOLSEY, Laurence, 2013. "Single item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances," LIDAM Discussion Papers CORE 2013045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Mohammad Abu-Zaineh & Sameera Awawda, 2022. "Measurement of Social Welfare and Inequality in Presence of Partially-ordered Variables," AMSE Working Papers 2231, Aix-Marseille School of Economics, France.
    9. DUJARDIN, Claire & lorant, VINCENT & THOMAS, Isabelle, 2013. "Self-assessed health of elderly people in Brussels: does the built environment matter?," LIDAM Discussion Papers CORE 2013048, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. José María Alonso-Meijide & Mikel à lvarez-Mozos & Maria Gloria Fiestras-Janeiro & Andres Jiménez-Losada, 2022. "Two families of values for global games," UB School of Economics Working Papers 2022/428, University of Barcelona School of Economics.
    11. Sokolov, Denis, 2022. "Shapley value for TU-games with multiple memberships and externalities," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 76-90.

  3. Jean-François Caulier & A. Mauleon & Jose J. Sempere-Monerris & Vincent Vannetelbosch, 2013. "Stable and efficient coalitional networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00854094, HAL.

    Cited by:

    1. CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2015. "Allocation rules for coalitional network games," LIDAM Reprints CORE 2718, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. SEMPERE-MONERRIS, J.J. & MAULEON, Ana & VANNETELBOSCH, Vincent, 2016. "Contractually Stable Alliances," LIDAM Reprints CORE 2739, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2019. "Paths to stability for overlapping group structures," LIDAM Reprints CORE 3001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Ana Mauleon & Jose J. Sempere-Monerris & Vincent Vannetelbosch, 2023. "Limited Farsightedness in R &D Network Formation," Dynamic Games and Applications, Springer, vol. 13(2), pages 549-565, June.
    5. de Callatay, Pierre & Mauleon, Ana & Vannetelbosch, Vincent, 2023. "Local Farsightedness in Network Formation," LIDAM Discussion Papers CORE 2023003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2018. "Constitutions and groups," LIDAM Reprints CORE 2935, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2022. "Coalition-proof stable networks," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 185-209, June.
    8. Pierre Callataÿ & Ana Mauleon & Vincent Vannetelbosch, 2024. "Minimal farsighted instability," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 493-523, June.
    9. de Callatay, Pierre & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "Minimally Farsighted Unstable Networks," LIDAM Discussion Papers CORE 2021012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. Dollinger, Jérôme & Mauleon, Ana & Vannetelbosch, Vincent, 2023. "R&D and Market Sharing Agreements," LIDAM Discussion Papers CORE 2023004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Luo, Chenghong & Mauleon, Ana & Vannetelbosch, Vincent, 2024. "Destabilizing segregation in friendship networks with farsighted agents," Journal of Economic Behavior & Organization, Elsevier, vol. 221(C), pages 1-16.
    12. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.

  4. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Documents de travail du Centre d'Economie de la Sorbonne 13063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

    Cited by:

    1. Gómez-Rúa, María & Vidal-Puga, Juan, 2015. "A monotonic and merge-proof rule in minimum cost spanning tree situations," MPRA Paper 62923, University Library of Munich, Germany.

  5. Jean-François Caulier, 2011. "The Interpretation of the Laakso-Taagepera Effective Number of Parties," Documents de travail du Centre d'Economie de la Sorbonne 11006, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

    Cited by:

    1. Paola Azar Dufrechou, 2018. "Electoral politics and the diffusion of primary schooling: evidence from Uruguay, 1914-1954," Working Papers wpdea1801, Department of Applied Economics at Universitat Autonoma of Barcelona.

  6. Jean-François Caulier, 2010. "On the measurement of Fragmentation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633613, HAL.

    Cited by:

    1. Nasrudin, Rus'an, 2015. "Does Soft Corruption Make Grease or Sand for Development? Evidence from Road's Special Allocation Fund for Indonesian Districts," MPRA Paper 80578, University Library of Munich, Germany, revised 08 Aug 2017.

  7. Jean-Francois Caulier & Ana Mauleon & Vincent VAnnetelbosch, 2007. "Contractually Stable Networks," NajEcon Working Paper Reviews 843644000000000084, www.najecon.org.

    Cited by:

    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
    2. CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2015. "Allocation rules for coalitional network games," LIDAM Reprints CORE 2718, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2019. "Paths to stability for overlapping group structures," LIDAM Reprints CORE 3001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Ana Mauleon & Jose J. Sempere-Monerris & Vincent Vannetelbosch, 2023. "Limited Farsightedness in R &D Network Formation," Dynamic Games and Applications, Springer, vol. 13(2), pages 549-565, June.
    5. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers CIE 73, Paderborn University, CIE Center for International Economics.
    6. de Callatay, Pierre & Mauleon, Ana & Vannetelbosch, Vincent, 2023. "Local Farsightedness in Network Formation," LIDAM Discussion Papers CORE 2023003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2018. "Constitutions and groups," LIDAM Reprints CORE 2935, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2022. "Coalition-proof stable networks," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 185-209, June.
    9. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers Dissertations 01, Paderborn University, Faculty of Business Administration and Economics.
    10. Antoni Rubí-Barceló, 2017. "Structural Holes in Social Networks with Exogenous Cliques," Games, MDPI, vol. 8(3), pages 1-13, August.
    11. Pierre Callataÿ & Ana Mauleon & Vincent Vannetelbosch, 2024. "Minimal farsighted instability," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 493-523, June.
    12. de Callatay, Pierre & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "Minimally Farsighted Unstable Networks," LIDAM Discussion Papers CORE 2021012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Dollinger, Jérôme & Mauleon, Ana & Vannetelbosch, Vincent, 2023. "R&D and Market Sharing Agreements," LIDAM Discussion Papers CORE 2023004, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Ping Sun & Elena Parilina, 2022. "Impact of Utilities on the Structures of Stable Networks with Ordered Group Partitioning," Dynamic Games and Applications, Springer, vol. 12(4), pages 1131-1162, December.
    15. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.

  8. Caulier, Jean-François & Dumont, Patrick, 2005. "The effective number of relevant parties : how voting power improves Laakso-Taagepera’s index," MPRA Paper 17846, University Library of Munich, Germany.

    Cited by:

    1. Agryzkov, Taras & Tortosa, Leandro & Vicent, Jose F., 2018. "An algorithm to compute data diversity index in spatial networks," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 63-75.
    2. Scott L. Feld & Bernard Grofman, 2007. "The Laakso-Taagepera Index in A Mean and Variance Framework," Journal of Theoretical Politics, , vol. 19(1), pages 101-106, January.

Articles

  1. Jean-François Caulier & Alexandre Skoda & Emily Tanimura, 2017. "Allocation Rules for Networks Inspired by Cooperative Game-Theory," Revue d'économie politique, Dalloz, vol. 127(4), pages 517-558.

    Cited by:

    1. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    2. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    3. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    4. Zhong, Xiaoqing & Zhong, Weifeng & Liu, Yi & Yang, Chao & Xie, Shengli, 2023. "A communication-efficient coalition graph game-based framework for electricity and carbon trading in networked energy hubs," Applied Energy, Elsevier, vol. 329(C).

  2. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    See citations under working paper version above.
  3. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
    See citations under working paper version above.
  4. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    See citations under working paper version above.
  5. Jean-François Caulier & Ana Mauleon & Jose Sempere-Monerris & Vincent Vannetelbosch, 2013. "Stable and efficient coalitional networks," Review of Economic Design, Springer;Society for Economic Design, vol. 17(4), pages 249-271, December.
    See citations under working paper version above.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 9 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-CDM: Collective Decision-Making (8) 2009-04-05 2009-04-25 2009-07-28 2011-02-19 2013-09-28 2013-11-14 2013-11-16 2016-04-23. Author is listed
  2. NEP-GTH: Game Theory (8) 2007-06-11 2009-04-05 2009-04-25 2009-07-28 2013-09-28 2013-11-14 2013-11-16 2016-04-23. Author is listed
  3. NEP-NET: Network Economics (8) 2007-06-11 2009-04-05 2009-04-25 2009-07-28 2013-09-28 2013-11-14 2013-11-16 2016-04-23. Author is listed
  4. NEP-SOC: Social Norms and Social Capital (4) 2007-06-11 2009-04-05 2009-04-25 2009-07-28
  5. NEP-TRE: Transport Economics (2) 2013-11-14 2013-11-16
  6. NEP-CIS: Confederation of Independent States (1) 2011-02-19
  7. NEP-ENE: Energy Economics (1) 2009-04-05
  8. NEP-HPE: History and Philosophy of Economics (1) 2016-04-23

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Jean-Francois Caulier
(Jean-Francois Caulier) should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.