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

Richard Baron

Personal Details

First Name:Richard
Middle Name:
Last Name:Baron
Suffix:
RePEc Short-ID:pba1634
[This author has chosen not to make the email address public]
https://www.gate.cnrs.fr/spip.php?article831

Affiliation

Groupe d'Analyse et de Théorie Économique Lyon St-Étienne (GATE Lyon St-Étienne)
Université de Lyon

Lyon, France
http://www.gate.cnrs.fr/
RePEc:edi:gateefr (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Richard Baron & Magali Chaudey & Lucas Jouvet, 2020. "Quelques questions soulevées par la mise en œuvre d’un smart contract," Post-Print halshs-03014050, HAL.
  2. Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-contract: a pioneering Approach of inter-firms Relationships? The case of franchise networks," Working Papers halshs-02111603, HAL.
  3. Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-Contract: A Pioneering Approach of Inter-Firm Relationships," Post-Print halshs-02195466, HAL.
  4. Richard Baron, 2018. "Introduction aux technologies blockchain supports des crypto-monnaies," Post-Print halshs-01937231, HAL.
  5. Richard Baron, 2017. "La notion de blockchain pour les nuls," Post-Print halshs-01936771, HAL.
  6. Richard Baron & Mostapha Diss & Eric Rémila & Philippe Solal, 2014. "A geometric examination of majorities based on difference in support," Working Papers 1414, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
  7. Richard Baron & Sylvain Béal & Philippe Solal & Éric Rémila, 2010. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00530610, HAL.
  8. Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008. "Average tree solutions for graph games," MPRA Paper 10189, University Library of Munich, Germany.
  9. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal & Savani Rahul, 2008. "Good neighbors are hard to find: computational complexity of network formation," Post-Print hal-00268851, HAL.
  10. Richard BARON & Jacques DURIEU & Philippe SOLAL, 2003. "Algorythme de fictitious play et cycles," Discussion Papers (REL - Recherches Economiques de Louvain) 2003023, Université catholique de Louvain, Institut de Recherches Economiques et Sociales (IRES).
  11. Richard Baron & Jaçques Durieu & Hans Haller & Philippe Solal, 2002. "Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem," Discussion Papers 02-19, University of Copenhagen. Department of Economics, revised Nov 2002.

Articles

  1. Richard Baron & Mostapha Diss & Eric Rémila & Philippe Solal, 2015. "A geometric examination of majorities based on difference in support," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(1), pages 123-153, June.
  2. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
  3. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
  4. Richard Baron & Philippe Solal, 2006. "Le critère de stabilité stochastique en théorie des jeux évolutionnaires," Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 8-8.
  5. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(2), pages 445-454, January.
  6. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2003. "Control costs and potential functions for spatial games," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(4), pages 541-561, September.
  7. Richard Baron & Jacques Durieu & Philippe Solal, 2003. "Algorithme de fictitious play et cycles," Recherches économiques de Louvain, De Boeck Université, vol. 69(2), pages 167-180.
  8. Philippe Solal & Hans Haller & Richard Baron & Jacques Durieu, 2002. "A note on control costs and logit rules for strategic games," Journal of Evolutionary Economics, Springer, vol. 12(5), pages 563-575.

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. Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-contract: a pioneering Approach of inter-firms Relationships? The case of franchise networks," Working Papers halshs-02111603, HAL.

    Cited by:

    1. Christian Eckert & Christof Neunsinger & Katrin Osterrieder, 2022. "Managing customer satisfaction: digital applications for insurance companies," The Geneva Papers on Risk and Insurance - Issues and Practice, Palgrave Macmillan;The Geneva Association, vol. 47(3), pages 569-602, July.

  2. Richard Baron & Sylvain Béal & Philippe Solal & Éric Rémila, 2010. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00530610, HAL.

    Cited by:

    1. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," PSE - Labex "OSE-Ouvrir la Science Economique" hal-00803233, HAL.
    2. Sylvain Béal & Éric Rémila & Philippe Solal, 2012. "Weighted component fairness for forest games," Post-Print halshs-00678832, HAL.
    3. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Compensations in the Shapley value and the compensation solutions for graph games," MPRA Paper 20955, University Library of Munich, Germany.
    4. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01212115, HAL.
    5. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
    6. Huseynov, T. & Talman, A.J.J., 2012. "The Communication Tree Value for TU-games with Graph Communication," Other publications TiSEM 6ba97d87-1ac6-4af7-a981-a, Tilburg University, School of Economics and Management.
    7. Sylvain Béal & Eric Rémila & Philippe Solal, 2022. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 818-849, May.
    8. Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.

  3. Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008. "Average tree solutions for graph games," MPRA Paper 10189, University Library of Munich, Germany.

    Cited by:

    1. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," PSE - Labex "OSE-Ouvrir la Science Economique" hal-00803233, HAL.
    2. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2008. "The average tree solution for cooperative games with communication structure," Research Memorandum 026, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

  4. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal & Savani Rahul, 2008. "Good neighbors are hard to find: computational complexity of network formation," Post-Print hal-00268851, HAL.

    Cited by:

    1. Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
    2. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
    3. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    4. Robert P. Gilles & Subhadip Chakrabarti & Sudipta Sarangi, 2011. "Nash Equilibria of Network Formation Games under Consent," Economics Working Papers 11-03, Queen's Management School, Queen's University Belfast.
    5. Rahmi İlkılıç & Hüseyin İkizler, 2019. "Equilibrium refinements for the network formation game," Review of Economic Design, Springer;Society for Economic Design, vol. 23(1), pages 13-25, June.
    6. Fabrice Talla Nobibon & Laurens Cherchye & Yves Crama & Thomas Demuynck & Bram De Rock & Frits C. R. Spieksma, 2016. "Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms," Operations Research, INFORMS, vol. 64(6), pages 1197-1216, December.

  5. Richard Baron & Jaçques Durieu & Hans Haller & Philippe Solal, 2002. "Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem," Discussion Papers 02-19, University of Copenhagen. Department of Economics, revised Nov 2002.

    Cited by:

    1. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    2. R. S. Bartholo & C. A. Cosenza & F. A. Doria & M. Doria & A. Teixeira, 2011. "On Exact and Approximate Solutions for Hard Problems: An Alternative Look," ASSRU Discussion Papers 1103, ASSRU - Algorithmic Social Science Research Unit.

Articles

  1. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    See citations under working paper version above.
  2. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
    See citations under working paper version above.
  3. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 23(2), pages 445-454, January.
    See citations under working paper version above.
  4. Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2003. "Control costs and potential functions for spatial games," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(4), pages 541-561, September.

    Cited by:

    1. Berninghaus, Siegfried K. & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Sonderforschungsbereich 504 Publications 05-35, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    2. Costain, James & Nakov, Anton, 2015. "Precautionary price stickiness," Journal of Economic Dynamics and Control, Elsevier, vol. 58(C), pages 218-234.
    3. T. Demuynck & A. Schollaert, 2006. "The nature of the mutation process matters," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/361, Ghent University, Faculty of Economics and Business Administration.
    4. Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific networking," Post-Print halshs-00667662, HAL.
    5. Goyal, Sanjeev, 2003. "Learning in Networks: a survey," Economics Discussion Papers 9983, University of Essex, Department of Economics.
    6. Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005. "Interaction on hypergraphs," Papers 05-34, Sonderforschungsbreich 504.
    7. James Costain, 2017. "Costly decisions and sequential bargaining," Working Papers 1729, Banco de España.
    8. JIMENEZ Edward, 2002. "Unified Game Theory," Computing in Economics and Finance 2002 25, Society for Computational Economics.
    9. T. Demuynck & A. Schollaert, 2006. "Note on State Dependent Mutations as an Equilibrium Refinement Device," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/408, Ghent University, Faculty of Economics and Business Administration.
    10. Berninghaus, Siegfried & Haller, Hans, 2007. "Pairwise interaction on random graphs," Papers 06-16, Sonderforschungsbreich 504.

  5. Philippe Solal & Hans Haller & Richard Baron & Jacques Durieu, 2002. "A note on control costs and logit rules for strategic games," Journal of Evolutionary Economics, Springer, vol. 12(5), pages 563-575.

    Cited by:

    1. Berninghaus, Siegfried K. & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Sonderforschungsbereich 504 Publications 05-35, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    2. Alós-Ferrer, Carlos & Netzer, Nick, 2010. "The logit-response dynamics," Games and Economic Behavior, Elsevier, vol. 68(2), pages 413-427, March.
    3. Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific networking," Post-Print halshs-00667662, HAL.
    4. Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005. "Interaction on hypergraphs," Papers 05-34, Sonderforschungsbreich 504.
    5. Berninghaus, Siegfried & Haller, Hans, 2007. "Pairwise interaction on random graphs," Papers 06-16, Sonderforschungsbreich 504.

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 5 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-GTH: Game Theory (2) 2002-12-17 2008-08-31
  2. NEP-ICT: Information and Communication Technologies (2) 2019-05-06 2019-05-13
  3. NEP-PAY: Payment Systems and Financial Technology (2) 2019-05-06 2019-05-13
  4. NEP-BEC: Business Economics (1) 2019-05-06
  5. NEP-CDM: Collective Decision-Making (1) 2014-05-24
  6. NEP-CTA: Contract Theory and Applications (1) 2019-05-06
  7. NEP-IND: Industrial Organization (1) 2019-05-06
  8. NEP-POL: Positive Political Economics (1) 2014-05-24

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, Richard Baron 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.