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, Francehttp://www.gate.cnrs.fr/
RePEc:edi:gateefr (more details at EDIRC)
Research output
Jump to: Working papers ArticlesWorking papers
- 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.
- 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.
- Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-contract: a pioneering Approach of inter-firms Relationships? The case of franchise networks," Working Papers 1917, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
- Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-Contract: A Pioneering Approach of Inter-Firm Relationships," Post-Print halshs-02195466, HAL.
- Richard Baron, 2018.
"Introduction aux technologies blockchain supports des crypto-monnaies,"
Post-Print
halshs-01937231, HAL.
- Richard Baron, 2019. "Introduction aux technologies blockchain supports des crypto-monnaies," Post-Print halshs-02383272, HAL.
- Richard Baron, 2017. "La notion de blockchain pour les nuls," Post-Print halshs-01936771, HAL.
- 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.
- 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.
- Richard Baron & Mostapha Diss & Eric Rémila & Philippe Solal, 2014. "A geometric examination of majorities based on difference in support," Working Papers halshs-00993015, HAL.
- Richard Baron & Mostapha Diss & Éric Rémila & Philippe Solal, 2015. "A Geometric Examination of Majorities Based on Difference in Support," Post-Print halshs-01107698, HAL.
- 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.
- 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.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00674425, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00617708, HAL.
- Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008.
"Average tree solutions for graph games,"
MPRA Paper
10189, University Library of Munich, Germany.
- Richard Baron & Sylvain Béal & Philippe Solal & Éric Rémila, 2008. "Average tree solution for graph games," Post-Print hal-00332537, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2008. "Average tree solutions for graph games," Post-Print hal-00332570, HAL.
- 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.
- 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.
- 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).
- 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.
- Richard Baron & Jacques Durieu & Philippe Solal, 2003. "Algorithme de fictitious play et cycles," Post-Print halshs-03216538, HAL.
- 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.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Post-Print halshs-03216508, HAL.
Articles
- 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.
- 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.
- Richard Baron & Mostapha Diss & Eric Rémila & Philippe Solal, 2014. "A geometric examination of majorities based on difference in support," Working Papers halshs-00993015, HAL.
- Richard Baron & Mostapha Diss & Éric Rémila & Philippe Solal, 2015. "A Geometric Examination of Majorities Based on Difference in Support," Post-Print halshs-01107698, HAL.
- 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.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
- 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.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00674425, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00617708, HAL.
- 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.
- 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.
- 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.
- Richard Baron & Philippe Solal, 2006. "Le critère de stabilité stochastique en théorie des jeux évolutionnaires," Post-Print halshs-03216493, HAL.
- 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.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Post-Print halshs-03216508, HAL.
- 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.
- Hans Haller & Philippe Solal & Richard Baron & Jacques Durieu, 2003. "Control costs and potential functions for spatial games," Post-Print hal-03423019, HAL.
- Hans Haller & Philippe Solal & Richard Baron & Jacques Durieu, 2003. "Control costs and potential functions for spatial games," Post-Print halshs-03216559, HAL.
- 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.
- 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).
- Richard Baron & Jacques Durieu & Philippe Solal, 2003. "Algorithme de fictitious play et cycles," Post-Print halshs-03216538, HAL.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2002. "A note on control costs and logit rules for strategic games," Post-Print halshs-03216560, HAL.
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
- 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.
- Richard Baron & Magali Chaudey, 2019. "Blockchain and Smart-contract: a pioneering Approach of inter-firms Relationships? The case of franchise networks," Working Papers 1917, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
Cited by:
- 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.
- 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.
- 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.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00674425, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00617708, HAL.
Cited by:
- Huseynov, T. & Talman, A.J.J., 2012.
"The Communication Tree Value for TU-games with Graph Communication,"
Discussion Paper
2012-095, Tilburg University, Center for Economic Research.
- 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.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2012.
"Weighted component fairness for forest games,"
Post-Print
halshs-00678832, HAL.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Weighted Component Fairness for Forest Games," MPRA Paper 17455, University Library of Munich, Germany.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2010.
"Compensations in the Shapley value and the compensation solutions for graph games,"
Post-Print
halshs-00530600, HAL.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2010. "Compensations in the Shapley value and the compensation solutions for graph games," Post-Print halshs-00530602, HAL.
- Sylvain Béal & Philippe Solal & Éric Rémila, 2010. "Compensations in the Shapley Value and the Compensation Solutions for Graph Games," Post-Print halshs-00530607, HAL.
- 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.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 157-178, February.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2012. "Compensations in the Shapley value and the compensation solutions for graph games," Post-Print halshs-00662476, HAL.
- 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.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2021. "Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution," Post-Print hal-03422939, HAL.
- 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," Post-Print hal-04053211, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2015.
"Characterization of the Average Tree solution and its kernel,"
Post-Print
halshs-01212115, HAL.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2015. "Characterization of the Average Tree solution and its kernel," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 159-165.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2014. "Characterization of the Average Tree solution and its kernel," Working Papers 2014-04, CRESE.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01196615, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2014. "Characterization of the Average Tree solution and its kernel," Working Papers hal-01377928, HAL.
- Michel Grabisch, 2013.
"The core of games on ordered structures and graphs,"
Post-Print
hal-00803233, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00803233, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," PSE-Ecole d'économie de Paris (Postprint) hal-00803233, HAL.
- Michel Grabisch, 2009. "The core of games on ordered structures and graphs," Post-Print halshs-00445171, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
- Michel Grabisch, 2009. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445171, HAL.
- 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.
- Suzuki, T. & Talman, A.J.J., 2011.
"Solution Concepts for Cooperative Games with Circular Communication Structure,"
Discussion Paper
2011-100, Tilburg University, Center for Economic Research.
- 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.
- Baron, Richard & Béal, Sylvain & Remila, Eric & Solal, Philippe, 2008.
"Average tree solutions for graph games,"
MPRA Paper
10189, University Library of Munich, Germany.
- Richard Baron & Sylvain Béal & Philippe Solal & Éric Rémila, 2008. "Average tree solution for graph games," Post-Print hal-00332537, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2008. "Average tree solutions for graph games," Post-Print hal-00332570, HAL.
Cited by:
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010.
"The average tree solution for cooperative games with communication structure,"
Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
- P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman & Zaifu Yang, 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Tinbergen Institute Discussion Papers 08-083/1, Tinbergen Institute.
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Discussion Paper 2008-73, Tilburg University, Center for Economic Research.
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Other publications TiSEM 0fe0e3f2-44c2-42b9-a201-c, Tilburg University, School of Economics and Management.
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2010. "The average tree solution for cooperative games with communication structure," Other publications TiSEM 24359ac5-6399-42ee-8f0b-7, Tilburg University, School of Economics and Management.
- 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).
- Michel Grabisch, 2013.
"The core of games on ordered structures and graphs,"
Post-Print
hal-00803233, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00803233, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," PSE-Ecole d'économie de Paris (Postprint) hal-00803233, HAL.
- Michel Grabisch, 2009. "The core of games on ordered structures and graphs," Post-Print halshs-00445171, HAL.
- Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
- Michel Grabisch, 2009. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445171, HAL.
- 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.
- 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.
Cited by:
- Thomas DEMUYNCK, 2011.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Working Papers of Department of Economics, Leuven
ces11.13, KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven.
- Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," ULB Institutional Repository 2013/251999, ULB -- Universite Libre de Bruxelles.
- 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.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Coalition Theory Network Working Papers 46655, Fondazione Eni Enrico Mattei (FEEM).
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- 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.
- 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.
- Demuynck, Thomas, 2011.
"The computational complexity of rationalizing boundedly rational choice behavior,"
Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
- Thomas Demuynck, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," ULB Institutional Repository 2013/252242, ULB -- Universite Libre de Bruxelles.
- Gilles, Robert P. & Chakrabarti, Subhadip & Sarangi, Sudipta, 2012.
"Nash equilibria of network formation games under consent,"
Mathematical Social Sciences, Elsevier, vol. 64(2), pages 159-165.
- 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.
- 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.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Post-Print halshs-03216508, HAL.
Cited by:
- Demuynck, Thomas, 2011.
"The computational complexity of rationalizing boundedly rational choice behavior,"
Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
- Thomas Demuynck, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," ULB Institutional Repository 2013/252242, ULB -- Universite Libre de Bruxelles.
- 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
- 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.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2009. "Average tree solutions and the distribution of Harsanyi dividends," MPRA Paper 17909, University Library of Munich, Germany.
- 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.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00674425, HAL.
- Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00617708, HAL.
- 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.
- 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.
- 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.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Finding a Nash equilibrium in spatial games is an NP-complete problem," Post-Print halshs-03216508, HAL.
- 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.
- Hans Haller & Philippe Solal & Richard Baron & Jacques Durieu, 2003. "Control costs and potential functions for spatial games," Post-Print hal-03423019, HAL.
- Hans Haller & Philippe Solal & Richard Baron & Jacques Durieu, 2003. "Control costs and potential functions for spatial games," Post-Print halshs-03216559, HAL.
Cited by:
- JIMENEZ Edward, 2002. "Unified Game Theory," Computing in Economics and Finance 2002 25, Society for Computational Economics.
- Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005.
"Interaction on Hypergraphs,"
Sonderforschungsbereich 504 Publications
05-34, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005. "Interaction on hypergraphs," Papers 05-34, Sonderforschungsbreich 504.
- Philippe Solal & Jacques Durieu, 2005. "Interaction on Hypergraphs," Post-Print hal-00375568, HAL.
- 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.
- Berninghaus, Siegfried & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Papers 05-35, Sonderforschungsbreich 504.
- Siegfried Berninghaus & Hans Haller & Alexander Outkin, 2006. "Neural networks and contagion," Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 11-11.
- Costain, James & Nakov, Anton, 2015.
"Precautionary price stickiness,"
Journal of Economic Dynamics and Control, Elsevier, vol. 58(C), pages 218-234.
- Costain, James & Nakov, Anton, 2014. "Precautionary price stickiness," CEPR Discussion Papers 9912, C.E.P.R. Discussion Papers.
- Anton Nakov & James Costain, 2010. "Precautionary price stickiness," 2010 Meeting Papers 774, Society for Economic Dynamics.
- Costain, James & Nakov, Anton, 2011. "Precautionary price stickiness," Working Paper Series 1375, European Central Bank.
- James Costain & Anton Nakov, 2011. "Precautionary price stickiness," Working Papers 1122, Banco de España.
- 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.
- Berninghaus, Siegfried & Haller, Hans, 2007. "Pairwise interaction on random graphs," Papers 06-16, Sonderforschungsbreich 504.
- 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.
- Jacques Durieu & Hans Haller & Philippe Solal, 2011.
"Nonspecific networking,"
Post-Print
halshs-00667662, HAL.
- Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific Networking," Games, MDPI, vol. 2(1), pages 1-27, February.
- Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Nonspecific Networking," Game Theory and Information 0403005, University Library of Munich, Germany.
- Goyal, Sanjeev, 2003. "Learning in Networks: a survey," Economics Discussion Papers 9983, University of Essex, Department of Economics.
- James Costain, 2017. "Costly decisions and sequential bargaining," Working Papers 1729, Banco de España.
- 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.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal, 2002. "A note on control costs and logit rules for strategic games," Post-Print halshs-03216560, HAL.
Cited by:
- Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005.
"Interaction on Hypergraphs,"
Sonderforschungsbereich 504 Publications
05-34, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Durieu, Jacques & Haller, Hans & Solal, Philippe, 2005. "Interaction on hypergraphs," Papers 05-34, Sonderforschungsbreich 504.
- Philippe Solal & Jacques Durieu, 2005. "Interaction on Hypergraphs," Post-Print hal-00375568, HAL.
- Carlos Alos-Ferrer & Nick Netzer, 2008.
"The Logit-Response Dynamics,"
TWI Research Paper Series
28, Thurgauer Wirtschaftsinstitut, Universität Konstanz.
- Alós-Ferrer, Carlos & Netzer, Nick, 2010. "The logit-response dynamics," Games and Economic Behavior, Elsevier, vol. 68(2), pages 413-427, March.
- 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.
- Berninghaus, Siegfried & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Papers 05-35, Sonderforschungsbreich 504.
- Siegfried Berninghaus & Hans Haller & Alexander Outkin, 2006. "Neural networks and contagion," Revue d'économie industrielle, De Boeck Université, vol. 0(2), pages 11-11.
- Berninghaus, Siegfried & Haller, Hans, 2007. "Pairwise interaction on random graphs," Papers 06-16, Sonderforschungsbreich 504.
- Jacques Durieu & Hans Haller & Philippe Solal, 2011.
"Nonspecific networking,"
Post-Print
halshs-00667662, HAL.
- Jacques Durieu & Hans Haller & Philippe Solal, 2011. "Nonspecific Networking," Games, MDPI, vol. 2(1), pages 1-27, February.
- Jacques Durieu & Hans Haller & Philippe Solal, 2004. "Nonspecific Networking," Game Theory and Information 0403005, University Library of Munich, Germany.
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.- NEP-GTH: Game Theory (2) 2002-12-17 2008-08-31
- NEP-ICT: Information and Communication Technologies (2) 2019-05-06 2019-05-13
- NEP-PAY: Payment Systems and Financial Technology (2) 2019-05-06 2019-05-13
- NEP-BEC: Business Economics (1) 2019-05-06
- NEP-CDM: Collective Decision-Making (1) 2014-05-24
- NEP-CTA: Contract Theory and Applications (1) 2019-05-06
- NEP-IND: Industrial Organization (1) 2019-05-06
- 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.