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

Nimrod Megiddo

Personal Details

First Name:Nimrod
Middle Name:
Last Name:Megiddo
Suffix:
RePEc Short-ID:pme242
[This author has chosen not to make the email address public]
http://theory.stanford.edu/~megiddo/bio.html

Research output

as
Jump to: Working papers Articles

Working papers

  1. N. Megiddo, 2010. "On Repeated Games with Incomplete Information Played with Non-Bayesian Players," Levine's Working Paper Archive 480, David K. Levine.
  2. Nimrod Megiddo & Eitan Zemel, 1984. "An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center Problem," Discussion Papers 613, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  3. N. Meggido & A. Tamir, 1981. "On the Complexity of Point Covering and Line Covering," Discussion Papers 475, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  4. Nimrod Megiddo, 1981. "The Maximum Coverage Location Problem," Discussion Papers 490, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  5. Nimrod Megiddo, 1981. "Towards a Genuinely Polynomial Algorithm for Linear Programming," Discussion Papers 493, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  6. Nimrod Megiddo, 1979. "On Repeated Games with Incomplete Information Played by Non-Bayesian Players," Discussion Papers 373, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  7. N. Megiddo, 1979. "An O(n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems," Discussion Papers 379, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  8. Ehud Kalai & Nimrod Megiddo, 1978. "Path Independent Choices," Discussion Papers 361, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  9. Nimrod Megiddo & S.L. Hakimi, 1978. "Pursuing Mobile Hiders in a Graph," Discussion Papers 360, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

Articles

  1. Agrawal, Shipra & Megiddo, Nimrod & Armbruster, Benjamin, 2010. "Equilibrium in prediction markets with buyers and sellers," Economics Letters, Elsevier, vol. 109(1), pages 46-49, October.
  2. Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
  3. Koller, Daphne & Megiddo, Nimrod, 1996. "Finding Mixed Strategies with Small Supports in Extensive Form Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(1), pages 73-92.
  4. Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
  5. Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.
  6. Kalai, Ehud & Megiddo, Nimrod, 1980. "Path Independent Choices," Econometrica, Econometric Society, vol. 48(3), pages 781-784, April.
  7. Kamien, Morton I. & Megiddo, Nimrod, 1979. "An intergenerational cake eating game," Economics Letters, Elsevier, vol. 2(1), pages 5-7.

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. N. Megiddo, 2010. "On Repeated Games with Incomplete Information Played with Non-Bayesian Players," Levine's Working Paper Archive 480, David K. Levine.

    Cited by:

    1. Drew Fudenberg & David K. Levine, 1997. "Conditional Universal Consistency," Levine's Working Paper Archive 471, David K. Levine.

  2. Nimrod Megiddo, 1981. "The Maximum Coverage Location Problem," Discussion Papers 490, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    2. Vladimir Marianov & H. A. Eiselt & Armin Lüer-Villagra, 2020. "The Follower Competitive Location Problem with Comparison-Shopping," Networks and Spatial Economics, Springer, vol. 20(2), pages 367-393, June.
    3. Peker, Meltem & Kara, Bahar Y., 2015. "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, Elsevier, vol. 54(C), pages 158-172.
    4. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    5. Ekaterina Alekseeva & Yury Kochetov & Alexandr Plyasunov, 2015. "An exact method for the discrete $$(r|p)$$ ( r | p ) -centroid problem," Journal of Global Optimization, Springer, vol. 63(3), pages 445-460, November.
    6. D. Santos-Peñate & R. Suárez-Vega & P. Dorta-González, 2007. "The Leader–Follower Location Model," Networks and Spatial Economics, Springer, vol. 7(1), pages 45-61, March.
    7. Tolga H. Seyhan & Lawrence V. Snyder & Ying Zhang, 2018. "A New Heuristic Formulation for a Competitive Maximal Covering Location Problem," Transportation Science, INFORMS, vol. 52(5), pages 1156-1173, October.
    8. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka, 2016. "Maximal Covering Location Problems on networks with regional demand," Omega, Elsevier, vol. 64(C), pages 77-85.
    9. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    10. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    11. Haris Aziz & Hau Chan & Barton E. Lee & Bo Li & Toby Walsh, 2019. "Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives," Papers 1911.09813, arXiv.org.
    12. Matthew Johnson & Alexander Gutfraind & Kiyan Ahmadizadeh, 2014. "Evader interdiction: algorithms, complexity and collateral damage," Annals of Operations Research, Springer, vol. 222(1), pages 341-359, November.
    13. Abdullah Dasci & Gilbert Laporte, 2005. "A Continuous Model for Multistore Competitive Location," Operations Research, INFORMS, vol. 53(2), pages 263-280, April.
    14. Boaz Farbstein & Asaf Levin, 2017. "Maximum coverage problem with group budget constraints," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 725-735, October.
    15. T Drezner & Z Drezner & P Kalczynski, 2011. "A cover-based competitive location model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 100-113, January.
    16. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
    17. Yajing Liu & Zhenliang Zhang & Edwin K. P. Chong & Ali Pezeshki, 2018. "Performance Bounds with Curvature for Batched Greedy Optimization," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 535-562, May.
    18. Cordeau, Jean-François & Furini, Fabio & Ljubić, Ivana, 2019. "Benders decomposition for very large scale partial set covering and maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 882-896.
    19. H.A. Eiselt, 2000. "Subsidy Competition in Networks," Computational and Mathematical Organization Theory, Springer, vol. 6(1), pages 99-111, May.
    20. Berman, Oded & Drezner, Zvi & Krass, Dmitry & Wesolowsky, George O., 2009. "The variable radius covering problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 516-525, July.

  3. Nimrod Megiddo, 1979. "On Repeated Games with Incomplete Information Played by Non-Bayesian Players," Discussion Papers 373, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    2. LOVO, Stefano & HÖRNER, Johanes, 2006. "Belief-free Equilibria in games with incomplete information," HEC Research Papers Series 845, HEC Paris.
    3. Drew Fudenberg & David K. Levine, 1997. "Conditional Universal Consistency," Levine's Working Paper Archive 471, David K. Levine.
    4. Nicolas Vieille & Olivier Gossner, 2003. "Strategic learning in games with symmetric information," Post-Print hal-00464978, HAL.
    5. Rustichini, A., 1998. "Minimizing Regret : The General Case," Discussion Paper 1998-41, Tilburg University, Center for Economic Research.
    6. Rustichini, A., 1998. "Minimizing Regret : The General Case," Other publications TiSEM 153ae7a9-8442-4484-9214-f, Tilburg University, School of Economics and Management.
    7. Sergiu Hart & Andreu Mas-Colell, 2013. "A Simple Adaptive Procedure Leading To Correlated Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 2, pages 17-46, World Scientific Publishing Co. Pte. Ltd..
    8. P. Auer & N. Cesa-Bianchi & Y. Freund & R. Schapire, 2010. "Gambling in a rigged casino: The adversarial multi-armed bandit problem," Levine's Working Paper Archive 462, David K. Levine.
    9. Otto Keck, 1987. "The Information Dilemma," Journal of Conflict Resolution, Peace Science Society (International), vol. 31(1), pages 139-163, March.
    10. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2005. "Stochastic Approximations and Differential Inclusions; Part II: Applications," Working Papers hal-00242974, HAL.
    11. Rustichini, Aldo, 1999. "Minimizing Regret: The General Case," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 224-243, October.
    12. Sergiu Hart & Andreu Mas-Colell, 1999. "A general class of adaptative strategies," Economics Working Papers 373, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Gabor Lugosi & Shie Mannor & Gilles Stoltz, 2008. "Strategies for prediction under imperfect monitoring," Post-Print hal-00124679, HAL.
    14. Eric Friedman & Scott Shenker & Amy Greenwald, 1998. "Learning in Networks Contexts: Experimental Results from Simulations," Departmental Working Papers 199825, Rutgers University, Department of Economics.
    15. N. Megiddo, 2010. "On Repeated Games with Incomplete Information Played with Non-Bayesian Players," Levine's Working Paper Archive 480, David K. Levine.
    16. E. J. Anderson & T. D. H. Cau, 2009. "Modeling Implicit Collusion Using Coevolution," Operations Research, INFORMS, vol. 57(2), pages 439-455, April.
    17. Nadège Bault & Giorgio Coricelli & Aldo Rustichini, 2008. "Interdependent Utilities: How Social Ranking Affects Choice Behavior," PLOS ONE, Public Library of Science, vol. 3(10), pages 1-10, October.

  4. N. Megiddo, 1979. "An O(n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems," Discussion Papers 379, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Haris Aziz & Hau Chan & Barton E. Lee & Bo Li & Toby Walsh, 2019. "Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives," Papers 1911.09813, arXiv.org.
    2. Arie Tamir & Eitan Zemel, 1979. "Locating Centers on a Tree with Discontinuous Supply and Demand Regions," Discussion Papers 397, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Sven de Vries & Marc Posner & Rakesh Vohra, 2003. "Polyhedral Properties of the K -median Problem on a Tree," Discussion Papers 1367, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Eitan Zemel, 1980. "On Search Over Rationals," Discussion Papers 455, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

  5. Ehud Kalai & Nimrod Megiddo, 1978. "Path Independent Choices," Discussion Papers 361, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Biung-Ghi Ju, 2005. "A characterization of plurality-like rules based on non-manipulability, restricted efficiency, and anonymity," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 335-354, September.
    2. Ahn, David S. & Echenique, Federico & Saito, Kota, 2018. "On path independent stochastic choice," Theoretical Economics, Econometric Society, vol. 13(1), January.
    3. Doğan, Serhat & Yıldız, Kemal, 2021. "Odds supermodularity and the Luce rule," Games and Economic Behavior, Elsevier, vol. 126(C), pages 443-452.

Articles

  1. Agrawal, Shipra & Megiddo, Nimrod & Armbruster, Benjamin, 2010. "Equilibrium in prediction markets with buyers and sellers," Economics Letters, Elsevier, vol. 109(1), pages 46-49, October.

    Cited by:

    1. C. O. Iroham & M. E. Emetere & H. I. Okagbue & O. Ogunkoya & O. D. Durodola & N. J. Peter & O. M. Akinwale, 2019. "Modified Pricing Model for Negotiation of Mortgage Valuation Between Estate Surveyors and Valuers and Their Clients," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 20(4), pages 337-347, December.
    2. Gustav Axén & Dominic Cortis, 2020. "Hedging on Betting Markets," Risks, MDPI, vol. 8(3), pages 1-14, August.

  2. Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.

    Cited by:

    1. McDonald, Stuart & Wagner, Liam, 2010. "The Computation of Perfect and Proper Equilibrium for Finite Games via Simulated Annealing," Risk and Sustainable Management Group Working Papers 151191, University of Queensland, School of Economics.
    2. Peter Godfrey-Smith & Manolo Martínez, 2013. "Communication and Common Interest," PLOS Computational Biology, Public Library of Science, vol. 9(11), pages 1-6, November.
    3. 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.
    4. Pahl, Lucas, 2023. "Polytope-form games and index/degree theories for extensive-form games," Games and Economic Behavior, Elsevier, vol. 141(C), pages 444-471.
    5. von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
    6. Stuart McDonald & Liam Wagner, 2013. "A Stochastic Search Algorithm for the Computation of Perfect and Proper Equilibria," Discussion Papers Series 480, School of Economics, University of Queensland, Australia.
    7. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    8. Etessami, Kousha, 2021. "The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game," Games and Economic Behavior, Elsevier, vol. 125(C), pages 107-140.
    9. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
    10. F. Forges & B. von Stengel, 2002. "Computionally Efficient Coordination in Games Trees," THEMA Working Papers 2002-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    11. Nataliya Sokolovska & Olivier Teytaud & Salwa Rizkalla & MicroObese consortium & Karine Clément & Jean-Daniel Zucker, 2015. "Sparse Zero-Sum Games as Stable Functional Feature Selection," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-16, September.
    12. P. Herings & Ronald Peeters, 2010. "Homotopy methods to compute equilibria in game theory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
    13. Theodore Turocy, 2010. "Computing sequential equilibria using agent quantal response equilibria," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 255-269, January.
    14. Benoit Duvocelle & J'anos Flesch & Hui Min Shi & Dries Vermeulen, 2020. "Search for a moving target in a competitive environment," Papers 2008.09653, arXiv.org, revised Aug 2020.
    15. 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.
    16. Peter Miltersen & Troels Sørensen, 2010. "Computing a quasi-perfect equilibrium of a two-player game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 175-192, January.
    17. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications,, Elsevier.
    18. Aurélien Delage & Olivier Buffet & Jilles S. Dibangoye & Abdallah Saffidine, 2024. "HSVI Can Solve Zero-Sum Partially Observable Stochastic Games," Dynamic Games and Applications, Springer, vol. 14(4), pages 751-805, September.
    19. Shimoji, Makoto & Watson, Joel, 1998. "Conditional Dominance, Rationalizability, and Game Forms," Journal of Economic Theory, Elsevier, vol. 83(2), pages 161-195, December.
    20. Rajgopal Kannan & Sudipta Sarangi & S. S. Iyengar, 2002. "Strategic Path Reliability in Information Networks," Discussion Papers of DIW Berlin 298, DIW Berlin, German Institute for Economic Research.
    21. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
    22. Corine M. Laan & Ana Isabel Barros & Richard J. Boucherie & Herman Monsuur & Judith Timmer, 2019. "Solving partially observable agent‐intruder games with an application to border security problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(2), pages 174-190, March.

  3. Koller, Daphne & Megiddo, Nimrod, 1996. "Finding Mixed Strategies with Small Supports in Extensive Form Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(1), pages 73-92.

    Cited by:

    1. McDonald, Stuart & Wagner, Liam, 2010. "The Computation of Perfect and Proper Equilibrium for Finite Games via Simulated Annealing," Risk and Sustainable Management Group Working Papers 151191, University of Queensland, School of Economics.
    2. von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
    3. Stuart McDonald & Liam Wagner, 2013. "A Stochastic Search Algorithm for the Computation of Perfect and Proper Equilibria," Discussion Papers Series 480, School of Economics, University of Queensland, Australia.
    4. Alcocer, Christian Diego & Jeitschko, Thomas D. & Shupp, Robert, 2020. "Naive and sophisticated mixing: Experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 170(C), pages 157-173.
    5. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.

  4. Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.

    Cited by:

    1. Govindan, Srihari & Wilson, Robert, 2009. "Axiomatic Equilibrium Selection for Generic Two-Player Games," Research Papers 2021, Stanford University, Graduate School of Business.
    2. von Stengel, Bernhard & Koller, Daphne, 1997. "Team-Maxmin Equilibria," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 309-321, October.
    3. Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 1-7, January.
    4. 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.
    5. von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
    6. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    7. Etessami, Kousha, 2021. "The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game," Games and Economic Behavior, Elsevier, vol. 125(C), pages 107-140.
    8. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
    9. F. Forges & B. von Stengel, 2002. "Computionally Efficient Coordination in Games Trees," THEMA Working Papers 2002-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    10. Nataliya Sokolovska & Olivier Teytaud & Salwa Rizkalla & MicroObese consortium & Karine Clément & Jean-Daniel Zucker, 2015. "Sparse Zero-Sum Games as Stable Functional Feature Selection," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-16, September.
    11. Stephan Schosser & Bodo Vogt, 2015. "What automaton model captures decision making? A call for finding a behavioral taxonomy of complexity," FEMM Working Papers 150010, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    12. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game," Games, MDPI, vol. 9(2), pages 1-8, June.
    13. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
    14. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications,, Elsevier.
    15. Sam Ganzfried & Max Chiswick, 2019. "Most Important Fundamental Rule of Poker Strategy," Papers 1906.09895, arXiv.org, revised Feb 2020.
    16. Sam Ganzfried & Farzana Yusuf, 2017. "Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy," Games, MDPI, vol. 8(4), pages 1-13, November.
    17. Rajgopal Kannan & Sudipta Sarangi & S. S. Iyengar, 2002. "Strategic Path Reliability in Information Networks," Discussion Papers of DIW Berlin 298, DIW Berlin, German Institute for Economic Research.
    18. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
    19. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game," Papers 1804.04789, arXiv.org.

  5. Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.

    Cited by:

    1. Robin Hanson, 2003. "For Bayesian Wannabes, Are Disagreements Not About Information?," Theory and Decision, Springer, vol. 54(2), pages 105-123, March.
    2. Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
    3. Tsakas, E., 2012. "Rational belief hierarchies," Research Memorandum 004, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Luca Anderlini, 1995. "Communication, Computability and Common Interest Games," Game Theory and Information 9510003, University Library of Munich, Germany.
    5. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Luca Anderlini & Hamid Sabourian, 1995. "The Evolution of Algorithmic Learning Rules: A Global Stability Result," Game Theory and Information 9510001, University Library of Munich, Germany.
    7. Halpern, Joseph Y. & Pass, Rafael, 2015. "Algorithmic rationality: Game theory with costly computation," Journal of Economic Theory, Elsevier, vol. 156(C), pages 246-268.

  6. Kalai, Ehud & Megiddo, Nimrod, 1980. "Path Independent Choices," Econometrica, Econometric Society, vol. 48(3), pages 781-784, April.
    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 1 paper 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-CTA: Contract Theory and Applications (1) 2010-12-18

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, Nimrod Megiddo 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.