Advanced Search
MyIDEAS: Login

Nimrod Megiddo

Contents:

This is information that was supplied by Nimrod Megiddo in registering through RePEc. If you are Nimrod Megiddo , you may change this information at the RePEc Author Service. Or if you are not registered and would like to be listed as well, register at the RePEc Author Service. When you register or update your RePEc registration, you may identify the papers and articles you have authored.

Personal Details

First Name: Nimrod
Middle Name:
Last Name: Megiddo
Suffix:

RePEc Short-ID: pme242

Email: [This author has chosen not to make the email address public]
Homepage: http://theory.stanford.edu/~megiddo/bio.html
Postal Address:
Phone:

Affiliation

IBM Research Division
Homepage: http://domino.research.ibm.com/library/cyberdig.nsf/index.html
Location: U.S.A.

Works

as in new window

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. 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.
  4. Nimrod Megiddo, 1981. "The Maximum Coverage Location Problem," Discussion Papers 490, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  5. 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.
  6. 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.
  7. 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.
  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, 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-84, April.
  7. Kamien, Morton I. & Megiddo, Nimrod, 1979. "An intergenerational cake eating game," Economics Letters, Elsevier, vol. 2(1), pages 5-7.

NEP Fields

1 paper by this author was announced in NEP, and specifically in the following field reports (number of papers):
  1. NEP-CTA: Contract Theory & Applications (1) 2010-12-18. Author is listed

Statistics

Most cited item

Most downloaded item (past 12 months)

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

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.