[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/e/pva8.html
   My authors  Follow this author

Timothy Van Zandt

Personal Details

First Name:Timothy
Middle Name:
Last Name:Van Zandt
Suffix:
RePEc Short-ID:pva8
http://faculty.insead.edu/vanzandt
INSEAD Boulevard de Constance 77305 Fontainebleau CEDEX France
+33 1 6072 4981

Affiliation

Economic and Political Sciences Area
INSEAD

Fontainebleau, France
http://www.insead.edu/facultyresearch/areas/eps/
RePEc:edi:epinsfr (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Van Zandt, Timothy, 2004. "Balancedness of Real-Time Hierarchical Resource Allocation," CEPR Discussion Papers 4276, C.E.P.R. Discussion Papers.
  2. Van Zandt, Timothy, 2004. "Structure and Returns to Scale of Real-Time Hierarchical Resource Allocation," CEPR Discussion Papers 4277, C.E.P.R. Discussion Papers.
  3. Van Zandt, Timothy, 2003. "Real-Time Hierarchical Resource Allocation with Quadratic Costs," CEPR Discussion Papers 4022, C.E.P.R. Discussion Papers.
  4. Vives, Xavier & Van Zandt, Timothy, 2003. "Monotone Equilibria in Bayesian Games of Strategic Complementarities," CEPR Discussion Papers 4103, C.E.P.R. Discussion Papers.
  5. Van Zandt, Timothy & Orbay, Hakan & Meagher, Kieron J, 2001. "Hierarchy Size and Environmental Uncertainty," CEPR Discussion Papers 2839, C.E.P.R. Discussion Papers.
  6. Van Zandt, Timothy, 2001. "Information Overload in a Network of Targeted Communication," CEPR Discussion Papers 2836, C.E.P.R. Discussion Papers.
  7. Timothy Van Zandt & Roy Radner, 1998. "Real-Time Decentralized Information Processing and Returns to Scale," Discussion Papers 1233, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  8. Anthony Horsley & Timothy Van Zandt & Andrew J Wrobel, 1998. "Berges Maximum Theorem With Two Topologies On The Action Set (Now published in Economics Letters, vol.61 (1999), pp.285-291.)," STICERD - Theoretical Economics Paper Series 347, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
  9. Roy Radner & Timothy Van Zandt, 1997. "Real-Time Decentralized Information Processing Returns to Scale," Working Papers 97-07, New York University, Leonard N. Stern School of Business, Department of Economics.
  10. Timothy Van Zandt, 1997. "Real-Time Hierarchical Resource Allocation," Discussion Papers 1231, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  11. Timothy Van Zandt, 1995. "Continuous Approximations in the Study of Hierarchies," Microeconomics 9503001, University Library of Munich, Germany, revised 16 Dec 1997.
  12. Lettau, M. & Van Zandt, T., 1995. "Robustness of Adaptive Expections as an Equilibrium Selection Device," Papers 9598, Tilburg - Center for Economic Research.
  13. Timothy Van Zandt, 1994. "Hierarchical Computation of the Resource Allocation Problem," Macroeconomics 9412001, University Library of Munich, Germany.

Articles

  1. Timothy Van Zandt, 2007. "Communication Complexity and Mechanism Design," Journal of the European Economic Association, MIT Press, vol. 5(2-3), pages 543-553, 04-05.
  2. Van Zandt, Timothy & Vives, Xavier, 2007. "Monotone equilibria in Bayesian games of strategic complementarities," Journal of Economic Theory, Elsevier, vol. 134(1), pages 339-360, May.
  3. Timothy Van Zandt, 2004. "Information Overload in a Network of Targeted Communication," RAND Journal of Economics, The RAND Corporation, vol. 35(3), pages 542-560, Autumn.
  4. Van Zandt, Timothy, 2002. "Information, measurability, and continuous behavior," Journal of Mathematical Economics, Elsevier, vol. 38(3), pages 293-309, November.
  5. Kieron Meagher & Timothy Van Zandt, 1998. "Managerial costs for one-shot decentralized information processing," Review of Economic Design, Springer;Society for Economic Design, vol. 3(4), pages 329-345.
  6. Horsley, Anthony & Wrobel, A. J. & Van Zandt, Timothy, 1998. "Berge's maximum theorem with two topologies on the action set," Economics Letters, Elsevier, vol. 61(3), pages 285-291, December.
  7. Timothy Van Zandt, 1998. "The scheduling and organization of periodic associative computation: Efficient networks," Review of Economic Design, Springer;Society for Economic Design, vol. 3(2), pages 93-127.
  8. Timothy Van Zandt, 1997. "The scheduling and organization of periodic associative computation: Essential networks," Review of Economic Design, Springer;Society for Economic Design, vol. 3(1), pages 15-27.
  9. Van Zandt, Timothy, 1995. "Hierarchical computation of the resource allocation problem," European Economic Review, Elsevier, vol. 39(3-4), pages 700-708, April.
  10. Timothy Van Zandt, 1995. "Continuous Approximations in the Study of Hierarchies," RAND Journal of Economics, The RAND Corporation, vol. 26(4), pages 575-590, Winter.
  11. Allen, Beth & Van Zandt, Timothy, 1992. "Uniform continuity of information combination : A corrigendum," Journal of Mathematical Economics, Elsevier, vol. 21(5), pages 453-459.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

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, Timothy Van Zandt 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.