On Knots and Dynamics in Games
Author
Abstract
Suggested Citation
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a for a similarly titled item that would be available.
Other versions of this item:
- Demichelis, Stefano & Germano, Fabrizio, 2002. "On (un)knots and dynamics in games," Games and Economic Behavior, Elsevier, vol. 41(1), pages 46-60, October.
- DE MICHELIS, Stefano & GERMANO, Fabrizio, 2000. "On knots and dynamics in games," LIDAM Discussion Papers CORE 2000010, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bich, Philippe & Fixary, Julien, 2022. "Network formation and pairwise stability: A new oddness theorem," Journal of Mathematical Economics, Elsevier, vol. 103(C).
- David Besanko & Ulrich Doraszelski & Yaroslav Kryukov & Mark Satterthwaite, 2008. "Learning-by-Doing, Organizational Forgetting, and Industry Dynamics," GSIA Working Papers 2009-E22, Carnegie Mellon University, Tepper School of Business.
- DE MICHELIS, Stefano, 2000. "On the index and asymptotic stability of dynamics," LIDAM Discussion Papers CORE 2000018, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Fixary, Julien, 2025. "Unknottedness of graphs of pairwise stable networks & network dynamics," Journal of Mathematical Economics, Elsevier, vol. 120(C).
- Predtetchinski, Arkadi, 2009.
"A general structure theorem for the Nash equilibrium correspondence,"
Games and Economic Behavior, Elsevier, vol. 66(2), pages 950-958, July.
- Predtetchinski, A., 2004. "A general structure theorem for the nash equilibrium correspondence," Research Memorandum 023, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Predtetchinski, A., 2006. "A general structure theorem for the nash equilibrium correspondence," Research Memorandum 010, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Demichelis, Stefano & Ritzberger, Klaus, 2003.
"From evolutionary to strategic stability,"
Journal of Economic Theory, Elsevier, vol. 113(1), pages 51-75, November.
- DEMICHELIS, Stefano & RITZBERGER, Klaus, 2000. "From evolutionary to strategic stability," LIDAM Discussion Papers CORE 2000059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Sun, Ching-jen, 2020. "A sandwich theorem for generic n × n two person games," Games and Economic Behavior, Elsevier, vol. 120(C), pages 86-95.
- DeMichelis, Stefano & Germano, Fabrizio, 2000.
"On the Indices of Zeros of Nash Fields,"
Journal of Economic Theory, Elsevier, vol. 94(2), pages 192-217, October.
- DEMICHELIS, Stefano & GERMANO, Fabrizio, 2000. "On the indices of zeros of Nash fields," LIDAM Reprints CORE 1531, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- DE MICHELIS, Stefano & GERMANO, Fabrizio, 2000. "On the indices of zeros of nash fields," LIDAM Discussion Papers CORE 2000017, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- David Besanko & Ulrich Doraszelski, 2005.
"Learning-by-Doing, Organizational Forgetting, and Industry Dynanmics,"
Computing in Economics and Finance 2005
236, Society for Computational Economics.
- Besanko, David & Doraszelski, Ulrich & Kryukov, Yaroslav & Satterthwaite, Mark, 2007. "Learning-by-Doing, Organizational Forgetting and Industry Dynamics," CEPR Discussion Papers 6160, C.E.P.R. Discussion Papers.
- David Besanko & Ulrich Doraszelski & Yaroslav Kryukov & Mark Satterthwaite, 2007. "Learning-by-Doing, Organizational Forgetting, and Industry Dynamics," Levine's Bibliography 321307000000000903, UCLA Department of Economics.
- Sandholm, William H., 2015. "Population Games and Deterministic Evolutionary Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
- Stefano Demichelis & Amrita Dhillon, 2010.
"Learning in Elections and Voter Turnout,"
Journal of Public Economic Theory, Association for Public Economic Theory, vol. 12(5), pages 871-896, October.
- DEMICHELIS, Stefano & DHILLON, Amrita, 2002. "Learning in elections and voter turnout," LIDAM Discussion Papers CORE 2002045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
More about this item
Keywords
; ;JEL classification:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fth:teavfo:2-2000. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/fotauil.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/p/fth/teavfo/2-2000.html