Show simple item record

Simultaneous Search

dc.contributor.authorChade, Hectoren_US
dc.contributor.authorSmith, Lonesen_US
dc.date.accessioned2010-06-01T22:37:55Z
dc.date.available2010-06-01T22:37:55Z
dc.date.issued2006-09en_US
dc.identifier.citationChade, Hector; Smith, Lones (2006). "Simultaneous Search." Econometrica 74(5): 1293-1307. <http://hdl.handle.net/2027.42/75607>en_US
dc.identifier.issn0012-9682en_US
dc.identifier.issn1468-0262en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/75607
dc.format.extent154491 bytes
dc.format.extent3109 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.publisherBlackwell Publishing Ltden_US
dc.rightsThe Econometric Society 2006en_US
dc.subject.otherSearchen_US
dc.subject.otherPortfolio Choiceen_US
dc.subject.otherSubmodularen_US
dc.subject.otherGreedy Algorithmen_US
dc.titleSimultaneous Searchen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDept. of Economics, University of Michigan, Ann Arbor, MI 48109-1220, U.S.A.; lones@umich.edu , http://www.umich.edu/~lones .en_US
dc.contributor.affiliationotherDept. of Economics, Arizona State University, Tempe, AZ 85287-3806, U.S.A.; hector.chade@asu.eduen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/75607/1/j.1468-0262.2006.00705.x.pdf
dc.identifier.doi10.1111/j.1468-0262.2006.00705.xen_US
dc.identifier.sourceEconometricaen_US
dc.identifier.citedreferenceAlbrecht, J., P. Gautier, and S. Vroman ( 2002 ): “Equilibrium Directed Search with Multiple Applications,” Mimeo, Georgetown. [ 1294 ].en_US
dc.identifier.citedreferenceBurdett, K., K. Judd ( 1983 ): “ Equilibrium Price Dispersion,” Econometrica, 51, 955 – 969. [ 1294 ].en_US
dc.identifier.citedreferenceBurdett, K., S. Shi, and R. Wright ( 2001 ): “ Pricing and Matching with Frictions,” Journal of Political Economy, 109, 1060 – 1085. [ 1294 ].en_US
dc.identifier.citedreferenceChade, H., L. Smith ( 2005 ): “Simultaneous Search,” Mimeo, Michigan and Arizona State. [1294,1301,1304].en_US
dc.identifier.citedreferenceGul, F., E. Stacchetti ( 1999 ): “ Walrasian Equilibrium with Gross Substitutes,” Journal of Economic Theory, 87, 95 – 124. [ 1300 ].en_US
dc.identifier.citedreferenceKelso, A. S. J., V P. Crawford ( 1982 ): “ Job Matching, Coalition Formation, and Gross Substitutes,” Econometrica, 50, 1483 – 1504. [ 1300 ].en_US
dc.identifier.citedreferenceLovÁsz, L. ( 1982 ): “ Submodular Functions and Convexity,” in Mathematical Programming: The State of the Art, ed. A. Bachem, M. Grotschel, and B. Korte Berlin: Springer-Verlag, 235 – 257. [ 1300 ].en_US
dc.identifier.citedreferenceMilgrom, P., C. Shannon ( 1994 ): “ Monotone Comparative Statistics,” Econometrica, 62, 157 – 180. [ 1306 ].en_US
dc.identifier.citedreferenceMurota, K., A. Shioura ( 2003 ): “ Quasi M-Convex and L-Convex Functions—Quasi-convexity in Discrete Optimization,” Discrete Applied Mathematics, 131, 467 – 494. [ 1301 ].en_US
dc.identifier.citedreferenceStigler, G. ( 1961 ): “ The Economics of Information,” Journal of Political Economy, 69, 213 – 225.[ 1293 ].en_US
dc.identifier.citedreferenceTopkis, D. ( 1998 ): Supermodularity and Complementarity. Princeton, NJ: Princeton University Press. [ 1303 ].en_US
dc.identifier.citedreferenceWeitzman, M. ( 1979 ): “ Optimal Search for the Best Alternative,” Econometrica, 47, 641 – 654.[ 1293 – 1302 ].en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.