Show simple item record

dc.contributor.advisorDimitri Bertsekas.en_US
dc.contributor.authorPatek, Stephen D. (Stephen David)en_US
dc.date.accessioned2005-08-18T22:51:52Z
dc.date.available2005-08-18T22:51:52Z
dc.date.copyright1997en_US
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/10209
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.en_US
dc.descriptionIncludes bibliographical references (leaves 132-138).en_US
dc.description.statementofresponsibilityby Stephen David Patek.en_US
dc.format.extent138 leavesen_US
dc.format.extent8836489 bytes
dc.format.extent8836247 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Scienceen_US
dc.titleStochastic and shortest path games : theory and algorithmsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc38277367en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record