Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01j9602070b
Title: Upper Bounds For Convergence Times in RAT Selection Games
Authors: An, Eric Boyang
Advisors: Chiang, Mung
Contributors: Fickenscher, Jon
Department: Mathematics
Class Year: 2013
Extent: 20 pages
URI: http://arks.princeton.edu/ark:/88435/dsp01j9602070b
Access Restrictions: Walk-in Access. This thesis can only be viewed on computer terminals at the Mudd Manuscript Library.
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Mathematics, 1934-2016

Files in This Item:
File SizeFormat 
Eric Boyang An Thesis.pdf396.8 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.