ÿþ<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"> <head> <meta http-equiv=Content-Type content="text/html; charset=unicode"> <meta name=ProgId content=Word.Document> <meta name=Generator content="Microsoft Word 15"> <meta name=Originator content="Microsoft Word 15"> <link rel=File-List href="index_files/filelist.xml"> <link rel=Edit-Time-Data href="index_files/editdata.mso"> <!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--> <title>Untitled Document</title> <!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Author>Eva</o:Author> <o:LastAuthor>Eva Tardos</o:LastAuthor> <o:Revision>26</o:Revision> <o:TotalTime>121</o:TotalTime> <o:Created>2017-01-28T17:23:00Z</o:Created> <o:LastSaved>2019-05-11T21:17:00Z</o:LastSaved> <o:Pages>10</o:Pages> <o:Words>5463</o:Words> <o:Characters>31144</o:Characters> <o:Company>Cornell University</o:Company> <o:Lines>259</o:Lines> <o:Paragraphs>73</o:Paragraphs> <o:CharactersWithSpaces>36534</o:CharactersWithSpaces> <o:Version>16.00</o:Version> </o:DocumentProperties> <o:OfficeDocumentSettings> <o:AllowPNG/> </o:OfficeDocumentSettings> </xml><![endif]--> <link rel=themeData href="index_files/themedata.thmx"> <link rel=colorSchemeMapping href="index_files/colorschememapping.xml"> <!--[if gte mso 9]><xml> <w:WordDocument> <w:View>Print</w:View> <w:SpellingState>Clean</w:SpellingState> <w:GrammarState>Clean</w:GrammarState> <w:TrackMoves>false</w:TrackMoves> <w:TrackFormatting/> <w:ValidateAgainstSchemas/> <w:SaveIfXMLInvalid>false</w:SaveIfXMLInvalid> <w:IgnoreMixedContent>false</w:IgnoreMixedContent> <w:AlwaysShowPlaceholderText>false</w:AlwaysShowPlaceholderText> <w:DoNotPromoteQF/> <w:LidThemeOther>EN-US</w:LidThemeOther> <w:LidThemeAsian>X-NONE</w:LidThemeAsian> <w:LidThemeComplexScript>X-NONE</w:LidThemeComplexScript> <w:Compatibility> <w:BreakWrappedTables/> <w:SplitPgBreakAndParaMark/> </w:Compatibility> <w:BrowserLevel>MicrosoftInternetExplorer4</w:BrowserLevel> <m:mathPr> <m:mathFont m:val="Cambria Math"/> <m:brkBin m:val="before"/> <m:brkBinSub m:val="&#45;-"/> <m:smallFrac m:val="off"/> <m:dispDef/> <m:lMargin m:val="0"/> <m:rMargin m:val="0"/> <m:defJc m:val="centerGroup"/> <m:wrapIndent m:val="1440"/> <m:intLim m:val="subSup"/> <m:naryLim m:val="undOvr"/> </m:mathPr></w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="false" DefSemiHidden="false" DefQFormat="false" DefPriority="99" LatentStyleCount="371"> <w:LsdException Locked="false" Priority="0" QFormat="true" Name="Normal"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 1"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 2"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 3"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 4"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 5"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 6"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 7"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 8"/> <w:LsdException Locked="false" Priority="9" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="heading 9"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 6"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 7"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 8"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index 9"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 1"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 2"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 3"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 4"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 5"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 6"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 7"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 8"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" Name="toc 9"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Normal Indent"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="footnote text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="annotation text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="header"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="footer"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="index heading"/> <w:LsdException Locked="false" Priority="35" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="caption"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="table of figures"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="envelope address"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="envelope return"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="footnote reference"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="annotation reference"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="line number"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="page number"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="endnote reference"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="endnote text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="table of authorities"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="macro"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="toa heading"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Bullet"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Number"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Bullet 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Bullet 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Bullet 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Bullet 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Number 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Number 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Number 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Number 5"/> <w:LsdException Locked="false" Priority="10" QFormat="true" Name="Title"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Closing"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Signature"/> <w:LsdException Locked="false" Priority="1" SemiHidden="true" UnhideWhenUsed="true" Name="Default Paragraph Font"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text Indent"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Continue"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Continue 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Continue 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Continue 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="List Continue 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Message Header"/> <w:LsdException Locked="false" Priority="11" QFormat="true" Name="Subtitle"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Salutation"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Date"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text First Indent"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text First Indent 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Note Heading"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text Indent 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Body Text Indent 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Block Text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Hyperlink"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="FollowedHyperlink"/> <w:LsdException Locked="false" Priority="22" QFormat="true" Name="Strong"/> <w:LsdException Locked="false" Priority="20" QFormat="true" Name="Emphasis"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Document Map"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Plain Text"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="E-mail Signature"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Top of Form"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Bottom of Form"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Normal (Web)"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Acronym"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Address"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Cite"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Code"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Definition"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Keyboard"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Preformatted"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Sample"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Typewriter"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="HTML Variable"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Normal Table"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="annotation subject"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="No List"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Outline List 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Outline List 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Outline List 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Simple 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Simple 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Simple 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Classic 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Classic 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Classic 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Classic 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Colorful 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Colorful 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Colorful 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Columns 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Columns 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Columns 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Columns 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Columns 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 6"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 7"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Grid 8"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 4"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 5"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 6"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 7"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table List 8"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table 3D effects 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table 3D effects 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table 3D effects 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Contemporary"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Elegant"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Professional"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Subtle 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Subtle 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Web 1"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Web 2"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Web 3"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Balloon Text"/> <w:LsdException Locked="false" Priority="59" Name="Table Grid"/> <w:LsdException Locked="false" SemiHidden="true" UnhideWhenUsed="true" Name="Table Theme"/> <w:LsdException Locked="false" SemiHidden="true" Name="Placeholder Text"/> <w:LsdException Locked="false" Priority="1" QFormat="true" Name="No Spacing"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading"/> <w:LsdException Locked="false" Priority="61" Name="Light List"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3"/> <w:LsdException Locked="false" Priority="70" Name="Dark List"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 1"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 1"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 1"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 1"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 1"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 1"/> <w:LsdException Locked="false" SemiHidden="true" Name="Revision"/> <w:LsdException Locked="false" Priority="34" QFormat="true" Name="List Paragraph"/> <w:LsdException Locked="false" Priority="29" QFormat="true" Name="Quote"/> <w:LsdException Locked="false" Priority="30" QFormat="true" Name="Intense Quote"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 1"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 1"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 1"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 1"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 1"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 1"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 1"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 1"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 2"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 2"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 2"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 2"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 2"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 2"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 2"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 2"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 2"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 2"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 2"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 2"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 2"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 2"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 3"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 3"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 3"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 3"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 3"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 3"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 3"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 3"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 3"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 3"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 3"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 3"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 3"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 3"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 4"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 4"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 4"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 4"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 4"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 4"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 4"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 4"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 4"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 4"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 4"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 4"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 4"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 4"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 5"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 5"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 5"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 5"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 5"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 5"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 5"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 5"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 5"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 5"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 5"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 5"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 5"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 5"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 6"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 6"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 6"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 6"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 6"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 6"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 6"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 6"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 6"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 6"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 6"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 6"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 6"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 6"/> <w:LsdException Locked="false" Priority="19" QFormat="true" Name="Subtle Emphasis"/> <w:LsdException Locked="false" Priority="21" QFormat="true" Name="Intense Emphasis"/> <w:LsdException Locked="false" Priority="31" QFormat="true" Name="Subtle Reference"/> <w:LsdException Locked="false" Priority="32" QFormat="true" Name="Intense Reference"/> <w:LsdException Locked="false" Priority="33" QFormat="true" Name="Book Title"/> <w:LsdException Locked="false" Priority="37" SemiHidden="true" UnhideWhenUsed="true" Name="Bibliography"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="TOC Heading"/> <w:LsdException Locked="false" Priority="41" Name="Plain Table 1"/> <w:LsdException Locked="false" Priority="42" Name="Plain Table 2"/> <w:LsdException Locked="false" Priority="43" Name="Plain Table 3"/> <w:LsdException Locked="false" Priority="44" Name="Plain Table 4"/> <w:LsdException Locked="false" Priority="45" Name="Plain Table 5"/> <w:LsdException Locked="false" Priority="40" Name="Grid Table Light"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 1"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 1"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 1"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 1"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 1"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 1"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 1"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 2"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 2"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 2"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 2"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 2"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 2"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 2"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 3"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 3"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 3"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 3"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 3"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 3"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 3"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 4"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 4"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 4"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 4"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 4"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 4"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 4"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 5"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 5"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 5"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 5"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 5"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 5"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 5"/> <w:LsdException Locked="false" Priority="46" Name="Grid Table 1 Light Accent 6"/> <w:LsdException Locked="false" Priority="47" Name="Grid Table 2 Accent 6"/> <w:LsdException Locked="false" Priority="48" Name="Grid Table 3 Accent 6"/> <w:LsdException Locked="false" Priority="49" Name="Grid Table 4 Accent 6"/> <w:LsdException Locked="false" Priority="50" Name="Grid Table 5 Dark Accent 6"/> <w:LsdException Locked="false" Priority="51" Name="Grid Table 6 Colorful Accent 6"/> <w:LsdException Locked="false" Priority="52" Name="Grid Table 7 Colorful Accent 6"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 1"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 1"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 1"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 1"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 1"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 1"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 1"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 2"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 2"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 2"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 2"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 2"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 2"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 2"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 3"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 3"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 3"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 3"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 3"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 3"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 3"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 4"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 4"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 4"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 4"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 4"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 4"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 4"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 5"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 5"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 5"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 5"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 5"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 5"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 5"/> <w:LsdException Locked="false" Priority="46" Name="List Table 1 Light Accent 6"/> <w:LsdException Locked="false" Priority="47" Name="List Table 2 Accent 6"/> <w:LsdException Locked="false" Priority="48" Name="List Table 3 Accent 6"/> <w:LsdException Locked="false" Priority="49" Name="List Table 4 Accent 6"/> <w:LsdException Locked="false" Priority="50" Name="List Table 5 Dark Accent 6"/> <w:LsdException Locked="false" Priority="51" Name="List Table 6 Colorful Accent 6"/> <w:LsdException Locked="false" Priority="52" Name="List Table 7 Colorful Accent 6"/> </w:LatentStyles> </xml><![endif]--> <style> <!-- /* Font Definitions */ @font-face {font-family:Wingdings; panose-1:5 0 0 0 0 0 0 0 0 0; mso-font-charset:2; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:0 268435456 0 0 -2147483648 0;} @font-face {font-family:"Cambria Math"; panose-1:2 4 5 3 5 4 6 3 2 4; mso-font-charset:1; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:0 0 0 0 0 0;} @font-face {font-family:Tahoma; panose-1:2 11 6 4 3 5 4 4 2 4; mso-font-charset:0; mso-generic-font-family:swiss; mso-font-pitch:variable; mso-font-signature:-520081665 -1073717157 41 0 66047 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} h1 {mso-style-priority:9; mso-style-unhide:no; mso-style-qformat:yes; mso-style-link:"Heading 1 Char"; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:1; font-size:24.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; font-weight:bold;} h3 {mso-style-priority:9; mso-style-unhide:no; mso-style-qformat:yes; mso-style-link:"Heading 3 Char"; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:3; font-size:13.5pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; font-weight:bold;} a:link, span.MsoHyperlink {mso-style-noshow:yes; mso-style-priority:99; color:blue; text-decoration:underline; text-underline:single;} a:visited, span.MsoHyperlinkFollowed {mso-style-noshow:yes; mso-style-priority:99; color:purple; text-decoration:underline; text-underline:single;} p {mso-style-noshow:yes; mso-style-priority:99; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoAcetate, li.MsoAcetate, div.MsoAcetate {mso-style-noshow:yes; mso-style-priority:99; mso-style-link:"Balloon Text Char"; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:8.0pt; font-family:"Tahoma",sans-serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoListParagraph, li.MsoListParagraph, div.MsoListParagraph {mso-style-noshow:yes; mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoListParagraphCxSpFirst, li.MsoListParagraphCxSpFirst, div.MsoListParagraphCxSpFirst {mso-style-noshow:yes; mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoListParagraphCxSpMiddle, li.MsoListParagraphCxSpMiddle, div.MsoListParagraphCxSpMiddle {mso-style-noshow:yes; mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoListParagraphCxSpLast, li.MsoListParagraphCxSpLast, div.MsoListParagraphCxSpLast {mso-style-noshow:yes; mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} span.Heading1Char {mso-style-name:"Heading 1 Char"; mso-style-priority:9; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Heading 1"; mso-ansi-font-size:14.0pt; mso-bidi-font-size:14.0pt; font-family:"Calibri Light",sans-serif; mso-ascii-font-family:"Calibri Light"; mso-ascii-theme-font:major-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:major-fareast; mso-hansi-font-family:"Calibri Light"; mso-hansi-theme-font:major-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:major-bidi; color:#2E74B5; mso-themecolor:accent1; mso-themeshade:191; font-weight:bold;} span.Heading3Char {mso-style-name:"Heading 3 Char"; mso-style-noshow:yes; mso-style-priority:9; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Heading 3"; mso-ansi-font-size:12.0pt; mso-bidi-font-size:12.0pt; font-family:"Calibri Light",sans-serif; mso-ascii-font-family:"Calibri Light"; mso-ascii-theme-font:major-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:major-fareast; mso-hansi-font-family:"Calibri Light"; mso-hansi-theme-font:major-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:major-bidi; color:#5B9BD5; mso-themecolor:accent1; font-weight:bold;} p.msonormal0, li.msonormal0, div.msonormal0 {mso-style-name:msonormal; mso-style-noshow:yes; mso-style-priority:99; mso-style-unhide:no; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} span.BalloonTextChar {mso-style-name:"Balloon Text Char"; mso-style-noshow:yes; mso-style-priority:99; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Balloon Text"; mso-ansi-font-size:8.0pt; mso-bidi-font-size:8.0pt; font-family:"Tahoma",sans-serif; mso-ascii-font-family:Tahoma; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Tahoma; mso-bidi-font-family:Tahoma;} span.SpellE {mso-style-name:""; mso-spl-e:yes;} span.GramE {mso-style-name:""; mso-gram-e:yes;} .MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; font-size:10.0pt; mso-ansi-font-size:10.0pt; mso-bidi-font-size:10.0pt;} @page WordSection1 {size:8.5in 11.0in; margin:1.0in 1.0in 1.0in 1.0in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.WordSection1 {page:WordSection1;} /* List Definitions */ @list l0 {mso-list-id:427627169; mso-list-template-ids:-1152884662;} @list l0:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l0:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l0:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l0:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1 {mso-list-id:455368504; mso-list-template-ids:1083189402;} @list l1:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l1:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l1:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l1:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2 {mso-list-id:516239968; mso-list-template-ids:-1541888660;} @list l2:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l2:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l2:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l2:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3 {mso-list-id:894777000; mso-list-template-ids:954605550;} @list l3:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l3:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l3:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l3:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4 {mso-list-id:1679622146; mso-list-template-ids:-232610194;} @list l4:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l4:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l4:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l4:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l5 {mso-list-id:1861553214; mso-list-type:hybrid; mso-list-template-ids:-1279854120 67698689 67698691 67698693 67698689 67698691 67698693 67698689 67698691 67698693;} @list l5:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Symbol;} @list l5:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:"Courier New";} @list l5:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Wingdings;} @list l5:level4 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Symbol;} @list l5:level5 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:"Courier New";} @list l5:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Wingdings;} @list l5:level7 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Symbol;} @list l5:level8 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:"Courier New";} @list l5:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:none; mso-level-number-position:left; text-indent:-.25in; font-family:Wingdings;} @list l6 {mso-list-id:1930964843; mso-list-template-ids:-1337289352;} @list l6:level1 {mso-level-number-format:bullet; mso-level-text:·ð; mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Symbol;} @list l6:level2 {mso-level-number-format:bullet; mso-level-text:o; mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:"Courier New"; mso-bidi-font-family:"Times New Roman";} @list l6:level3 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level4 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level5 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level6 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level7 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level8 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} @list l6:level9 {mso-level-number-format:bullet; mso-level-text:§ð; mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in; mso-ansi-font-size:10.0pt; font-family:Wingdings;} ol {margin-bottom:0in;} ul {margin-bottom:0in;} --> </style> <!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman",serif;} </style> <![endif]--><!--[if gte mso 9]><xml> <o:shapedefaults v:ext="edit" spidmax="1026"/> </xml><![endif]--><!--[if gte mso 9]><xml> <o:shapelayout v:ext="edit"> <o:idmap v:ext="edit" data="1"/> </o:shapelayout></xml><![endif]--> </head> <body lang=EN-US link=blue vlink=purple style='tab-interval:.5in'> <div class=WordSection1> <table class=MsoNormalTable border=0 cellspacing=4 cellpadding=0 width=0 style='width:578.25pt;mso-cellspacing:1.5pt;mso-yfti-tbllook:1184;mso-padding-alt: 15.0pt 15.0pt 15.0pt 15.0pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes;mso-yfti-lastrow:yes'> <td style='padding:15.0pt 15.0pt 15.0pt 15.0pt'> <h1><span style='mso-fareast-font-family:"Times New Roman"'>Éva Tardos<o:p></o:p></span></h1> <p>Jacob Gould <span class=SpellE>Schurman</span> Professor of Computer Science, department chair</p> <p style='margin-bottom:12.0pt'><a href="http://www.cs.cornell.edu/"><br> Department of Computer Science<br> </a>402 Gates Hall<br> <a href="http://www.cornell.edu/">Cornell University</a><br> Ithaca, NY 14853<br> phone: (607) 255-0984&nbsp;<br> fax: (607) 255-4428&nbsp;<br> Email:&nbsp;<a href="mailto:eva.tardos@cornell.edu">eva.tardos@cornell.edu</a>&nbsp;.</p> </td> <td width="39%" style='width:39.0%;padding:15.0pt 15.0pt 15.0pt 15.0pt'> <p class=MsoNormal><span style='mso-fareast-font-family:"Times New Roman"; mso-no-proof:yes'><img border=0 width=426 height=289 id="_x0000_i1025" src="http://www.cs.cornell.edu/~eva/Tardos.Eva.Aug2005.nb.JPG" alt="Eva Tardos"></span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> </table> <p style='margin-left:.5in'><br> <span class=SpellE>Dipl.Math</span>. 1981, Ph.D. 1984,&nbsp;<span class=SpellE>Eötvös</span> University, Budapest, Hungary<o:p></o:p></p> <table class=MsoNormalTable border=0 cellspacing=4 cellpadding=0 width=0 style='width:579.75pt;mso-cellspacing:1.5pt;mso-yfti-tbllook:1184;mso-padding-alt: 15.0pt 15.0pt 15.0pt 15.0pt' height=431> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes;mso-yfti-lastrow:yes; height:291.75pt'> <td width=295 style='width:196.5pt;padding:15.0pt 15.0pt 15.0pt 15.0pt; height:291.75pt'> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Current Ph.D. students<o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Chidozie Onyeze <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://giannisfikioris.github.io/">Giannis Fikioris </a><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://emilyryu.github.io/">Emily Ryu </a><o:p></o:p></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Past Ph.D. students<o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://jgaitonde.github.io/">Jason Gaitonde</a> (2022) <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ttps://mitmgmtfaculty.mit.edu/tlykouris/">Thodoris Lykouris</a> (2019)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~hedyeh/">Hedyeh Beyhaghi</a> (2019)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Pooya Jalaly (2017)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://research.microsoft.com/en-us/um/people/vasy/">Vasilis&nbsp; Syrgkanis</a> (2014)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.renatoppl.com/">Renato Paes Leme</a> (2012)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://people.sutd.edu.sg/~georgios/">Georgios Piliouras&nbsp;</a>(2010)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://web.ics.purdue.edu/~nguye161/">Thanh Nguyen</a>&nbsp;(2010)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.dartmouth.edu/~zoya/">Zoya Svitkina&nbsp;</a>(2007)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~ara/">Ara Hayrapetyan&nbsp;</a>(2007)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.oberlin.edu/~wexler/">Tom Wexler&nbsp;</a>(2006)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://martin.palenica.com/">Martin Pal&nbsp;</a>(2004)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://scholar.google.com/citations?user=7-TwsxsAAAAJ&amp;hl=en">Aaron Archer</a>&nbsp;(2004)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://theory.stanford.edu/~tim/">Tim Roughgarden&nbsp;</a>(2002)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.math.ohiou.edu/~vardges/">Vardges Melkonian</a>&nbsp;(2002)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.princeton.edu/~wayne">Kevin Wayne</a>&nbsp;(1999)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Wee Liang Heng (1998)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.dartmouth.edu/~lkf/">Lisa Fleischer&nbsp;</a>(1997)<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://connectedness.blogspot.com/">Bruce Hoppe</a>&nbsp;(1995)<o:p></o:p></span></li> </ul> </td> <td width=478 style='width:320.25pt;padding:15.0pt 15.0pt 15.0pt 15.0pt; height:291.75pt'> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Recent Talks and Activities: <o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Kenote speaker at the Conference on Learning Theory (COLT), at UC Boulder, Colorado, August 2021.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Invited speaker at the SIAM Conference on Discrete Mathematics, Spokane, Washington, July 2021.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Invited speaker at EUROCOMB, Barcelona, September 2021.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Invited speaker at the Stony Brook International Conference on Game Theory, July 2020 and July 2021.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'> <a href="https://youtu.be/feZXPf2LlFE?list=PLm3AdVwMMCqxGUg4E0mGtrDCdGDm4mCcK">Eotvos Lorand University distinguished Alumni Lecture</a>, February 2020.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>CRM Aisenstadt lecture, Montreal January 2020.</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Learning in Games, <span class=SpellE>Kuntzmann</span> prize lecture, Grenoble, France. </span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Learning in Games, McCord Morse Lectureship Award, INFORMS, Phoenix, November 2018</span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Invited speaker at Algorithmic Learning Theory, Lanzarote, Spain, April 2018</span><strong><span style='font-weight:normal'><o:p></o:p></span></strong></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://simons.berkeley.edu/events/openlectures2015-fall-1">Simons Institute Open Lecture: Learning and Efficiency in Games</a>, Sept 14, 2015</span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.iciam.org/olga-taussky-todd-lecture-iciam-2015">The Olga <span class=SpellE>Taussky</span>-Todd Lecture</a> at ICIAM, August 2015<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Abel in Paris talk: <a href="https://www.youtube.com/watch?v=PaIU0UMApD8">Quality of equilibria and effect of learning in Games</a>, January 2015. <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l4 level1 lfo2;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://courses.edx.org/courses/course-v1:CornellX+INFO2040x+1T2016/info-1354"><span class=SpellE>CornellX</span>: INFO2040x: Networks, Crowds and Markets</a> March 2016. <o:p></o:p></span></li> </ul> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in'><span style='mso-fareast-font-family:"Times New Roman"'><o:p>&nbsp;</o:p></span></p> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Research interest:<o:p></o:p></span></h3> <p>Algorithms and algorithmic game theory, the subarea of theoretical computer science theory of designing systems and algorithms for selfish users. My research focuses on algorithms and games on networks and simple auctions.&nbsp; I am mostly interested in designing algorithms and games that provide provably close-to-optimal results.</p> </td> </tr> </table> <p class=MsoNormal><span style='mso-fareast-font-family:"Times New Roman"; display:none;mso-hide:all'><o:p>&nbsp;</o:p></span></p> <table class=MsoNormalTable border=0 cellspacing=4 cellpadding=0 width=0 style='width:611.25pt;mso-cellspacing:1.5pt;mso-yfti-tbllook:1184;mso-padding-alt: 15.0pt 15.0pt 15.0pt 15.0pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes;mso-yfti-lastrow:yes'> <td width=344 style='width:231.0pt;padding:15.0pt 15.0pt 15.0pt 15.0pt'> <p><strong>Books</strong></p> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l0 level1 lfo3;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>J. Kleinberg, E. Tardos.&nbsp;<a href="http://www.aw-bc.com/info/kleinberg/">Algorithm <span class=SpellE>Design.</span></a><span class=SpellE>Addison</span>-Wesley, 2005.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l0 level1 lfo3;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://theory.stanford.edu/~tim/agt/toc_brief.html">Algorithmic Game Theory</a>, co-edited with <a href="http://www.cs.huji.ac.il/~noam/">Noam Nisan</a>,&nbsp;<a href="http://theory.stanford.edu/~tim/">Tim Roughgarden</a>, and&nbsp;<a href="http://www-static.cc.gatech.edu/~vazirani/">Vijay Vazirani</a>&nbsp;(published by Cambridge University Press, expected October 2007.)<o:p></o:p></span></li> </ul> <p><strong>Some&nbsp;Surveys</strong></p> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>T. Roughgarden, V. Syrgkanis, and E. Tardos. <a href="http://arxiv.org/abs/1607.07684">The price of anarchy in auctions</a><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'>R. Paes Leme, V. Syrgkanis, E. Tardos. <a href="http://www.sigecom.org/exchanges/volume_11/2/PAESLEME.pdf">The Dining Bidder Problem: `a la <span class=SpellE>russe</span> et `a la <span class=SpellE>fran¸caise</span></a> ACM <span class=SpellE>SIGecom</span> Exchanges. Volume 11 Issue 2, December 2012.</li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>E. Tardos and V. Vazirani,&nbsp;<a href="http://www.cs.cornell.edu/~eva/agtchap1.pdf">Basic Solution Concepts and Computational Issues in Games</a>, in&nbsp;<a href="http://theory.stanford.edu/~tim/agt/toc_brief.html">Algorithmic Game Theory</a> (Cambridge University Press, expected 2007).<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>T. Roughgarden and E. Tardos:&nbsp;<a href="http://www.cs.cornell.edu/~eva/agtchap17.pdf">Introduction to the Inefficiency of Equilibria</a>.&nbsp; In <a href="http://theory.stanford.edu/~tim/agt/toc_brief.html">Algorithmic Game Theory</a>&nbsp;(Cambridge University Press, expected 2007).<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>E. Tardos and T. Wexler:&nbsp;<a href="http://www.cs.cornell.edu/~eva/agtchap19.pdf">Network Formation Games</a>, in&nbsp;<a href="http://theory.stanford.edu/~tim/agt/toc_brief.html">Algorithmic Game Theory</a>&nbsp;(Cambridge University Press, expected 2007).<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/stoc04.pdf">Games in Networks</a>, presented at STOC 2004.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l3 level1 lfo4;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/focs02.ppt">Tutorial on Approximation Algorithms</a>, presented at FOCS 2002.<o:p></o:p></span></li> </ul> </td> <td width=471 style='width:317.25pt;padding:15.0pt 15.0pt 15.0pt 15.0pt'> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Courses<o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><b style='mso-bidi-font-weight: normal'></b><span style='mso-fareast-font-family:"Times New Roman"'> <a href="http://www.cs.cornell.edu/Courses/cs4820/2019fa">Introduction to Algorithms</a> fall 2019, : 4820 see also fall 2018, 2017, spring 2016, 2015, and CS 482, spring 1999, 2001, 2002<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/Courses/CS6840/2021sp/">Algorithmic Game Theory</a> Spring 2020, and also Spring 2017 CS6840<a href="http://www.cs.cornell.edu/courses/cs6840/2010sp/index.htm">,</a>&nbsp;(past runs: <a href="http://www.cs.cornell.edu/courses/cs6840/2014sp/">spring 2014</a>, spring 2012, spring 2010, CS 684, spring 2008, fall 2005, spring 2004.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="https://courses.cit.cornell.edu/cs2850_2016fa/">Networks</a> fall 2016: Info2040/econ2040/cs2085/soc2090, see also Fall 2013,2012,2011<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/Courses/cs681/">Design and Analysis of Algorithms</a>, fall 2014 CS6820, see also CS 681, fall 2000, fall 2002, fall 2003, fall 2006.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/courses/cs280/2005sp/">Discrete Structures</a>, CS280, spring 2005<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/courses/cs481/2004fa/">Introduction to Theory of Computing</a>, CS 481 fall 2004<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/Courses/cs684/2001fa/">Approximation and Network Algorithms</a>, CS 684, fall 2001<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.orie.cornell.edu/~or739">Seminar on Approximation Algorithms</a>, spring 1999<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.orie.cornell.edu/~eva/or630/or630.html">Mathematical Programming</a>, OR 630, fall 1998<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Optimization,&nbsp; OR 321, spring 1998<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l1 level1 lfo5;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>Data Structures, CS 410, fall 1997<o:p></o:p></span></li> </ul> </td> </tr> </table> <p class=MsoNormal><span style='mso-fareast-font-family:"Times New Roman"; display:none;mso-hide:all'><o:p>&nbsp;</o:p></span></p> <table class=MsoNormalTable border=0 cellspacing=4 cellpadding=0 width=0 style='width:614.25pt;mso-cellspacing:1.5pt;mso-yfti-tbllook:1184;mso-padding-alt: 15.0pt 15.0pt 15.0pt 15.0pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes;mso-yfti-lastrow:yes'> <td width=773 style='width:548.25pt;padding:15.0pt 15.0pt 15.0pt 15.0pt'> <h3><span style='mso-fareast-font-family:"Times New Roman"'>See <a href="https://dblp.uni-trier.de/pers/hd/t/Tardos:=Eacute=va">DBLP</a> and <a href="https://scholar.google.com/citations?user=h6jljQQAAAAJ&amp;hl=en">Google Scholar</a> for up to date lists of publications. <o:p></o:p></span></h3> <h3><span style='mso-fareast-font-family:"Times New Roman"'> Publications Grouped by Area<o:p></o:p></span></h3> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Learning in Games<o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Giannis Fikioris, Eva Tardos. <a href="https://arxiv.org/pdf/2302.14686.pdf">Approximately Stationary Bandits with Knapsacks</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the proceedings of the 36th Annual Conference on Learning Theory (COLT 2023).<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Giannis Fikioris, Eva Tardos. <a href="https://arxiv.org/pdf/2210.07502.pdf">Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 24th Annual Conference on Economics and Computing (EC'23), July 2023.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Jason Gaitonde and Eva Tardos. <a href="https://arxiv.org/pdf/2011.10205.pdf">Virtues of Patience in Strategic Queuing Systems</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 22st Annual Conference on Economics and Computing (EC'20), July 2021.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Jason Gaitonde and Eva Tardos. <a href="https://arxiv.org/pdf/2003.07009.pdf">Stability and Learning in Strategic Queuing Systems</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 21st Annual Conference on Economics and Computing (EC'20), July 2020.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Thodoris Lykouris, Eva Tardos and Dristi Wali. <a href="https://arxiv.org/pdf/1905.09898.pdf">Feedback graph regret bounds for Thompson Sampling and UCB</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 31st International Conference on Algorithmic Learning Theory (ALT'20), Feb 2020.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Thodoris Lykouris, Karthik Sridharan, and Eva Tardos. <a href="https://arxiv.org/abs/1711.03639">Small-loss bounds for online learning with partial information</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 31st Annual Conference on Learning Theory (COLT'18), July 2018.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Pooya Jalaly, Denis Nekipelov, and Eva Tardos, Learning and Trust in Auction Markets, EC'18 workshop on Frontiers of Market Design, June 2018.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Dylan Foster, <span class=SpellE><span class=GramE>Zhiyuan</span></span><span class=GramE><span style='mso-spacerun:yes'>  </span>Li</span>, Thodoris Lykouris, Karthik Sridharan, and Eva Tardos. Learning in Games: Robustness of Fast Convergence. In the Proceedings of Neural Information Processing Systems (NIPS), 2016.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Thodoris Lykouris, Vasilis Syrgkanis, and Eva Tardos, <a href="http://arxiv.org/abs/1505.00391">Learning and Efficiency in Games with Dynamic Population</a>, Preliminary version in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016. <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Jason Hartline, Vasilis Syrgkanis, Eva Tardos. <a href="http://arxiv.org/abs/1507.00418">No-regret learning in repeated Bayesian Games</a>, in the Proceedings of Neural Information Processing Systems (NIPS), December 2015.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Denis Nekipelov, Vasilis Syrgkanis, Eva Tardos, <a href="http://arxiv.org/abs/1505.00720">Econometrics for Learning Agents</a>, preliminary version appeared in the proceedings of the ACM Conference on Economics and Computation, Portland, OR June 2015 (best paper award). <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Paul Duetting, Thomas Kesselheim, Eva Tardos, <a href="http://paulduetting.com/pubs/ec14-correlated.pdf">Mechanisms with Unique Learnable Equilibria</a>, in the Proceedings of the ACM Conference on Electronic Commerce, June 2014, Palo Alto, CA. <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~gpil/papers/podc129.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Robert Kleinberg, Katrina Ligett, Georgios Piliouras, and Eva Tardos. <span style='mso-field-code:" HYPERLINK \0022http\:\/\/users\.cms\.caltech\.edu\/~katrina\/papers\/nashbarrier\.pdf\0022 "'><u><span style='color:blue'>Beyond the Nash Equilibrium Barrier</span></u></span> Innovations in Computer Science, 2011</span></a></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cam.cornell.edu/~thanh/paper/game.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Robert Kleinberg, Georgios Piliouras, and Eva Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~gpil\/papers\/stoc09\.pdf\0022 "'><u><span style='color:blue'>Multiplicative Updates Outperform Generic No-Regret Learning in Congestion Games</span></u></span>, in the proceedings of the ACM Symposium on Theory of Computing, 2009.</span></a></span><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~gpil/papers/stoc09.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Robert Kleinberg, Georgios Piliouras, and Eva Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~gpil\/papers\/podc129\.pdf\0022 "'><u><span style='color:blue'>Load Balancing Without Regret in the Bulletin Board Model</span></u></span>, in the Proceedings of ACM Symposium on Principles of Distributed Computing, August 2009.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Network Games:<o:p></o:p></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Jon Kleinberg, Emily Ryu, Éva Tardos. <a href="https://arxiv.org/pdf/2302.03239.pdf">Calibrated Recommendations for Users with Decaying Attention</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span></span><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Jon Kleinberg, Emily Ryu, Éva Tardos. <a href="https://arxiv.org/pdf/2203.00233.pdf">Ordered Submodularity and its Applications to Diversifying Recommendations</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span></span><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l6 level1 lfo1;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'>J. Massey Cashore, Peter I. Frazier, Eva Tardos. <a href="https://www.orie.cornell.edu/research/grad-students/massey-cashore">Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span> In</span> Mathematics of Operations Research} 2023. Preliminary version appeared in the proceedings of the ACM Conference on Economics and Computing (EC'22), 2022. <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Jason Gaitinde, Jon Kleinberg and Eva Tardos Tardos:&nbsp;<a href="https://arxiv.org/pdf/2106.12459.pdf"> Polarization in Geometric Opinion Dynamics</span></a>. Preliminary version has appeared in the Proceedings of the 22nd Annual ACM Conference on Economics and Computing (EC'21), 2021 .&nbsp;<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Jason Gaitinde, Jon Kleinberg and Eva Tardos Tardos:&nbsp;<a href="https://arxiv.org/pdf/2003.07010.pdf"> Adversarial Perturbation of Opinion Dynamics in Networks</span></a>. Preliminary version has appeared in the Proceedings of the 21st Annual ACM Conference on Economics and Computing (EC'20), 2020 .&nbsp;<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Hedyeh Beyhagi and Eva Tardos &nbsp; <a href="https://home.ttic.edu/~hedyeh/limited_interviews.pdf"> Randomness and Fairness in Two-Sided Matching with Limited Interviews</span></a> in the Proceedings of Proceedings of Innovations in Theoretical Computer Science, 2021.&nbsp;<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://theory.stanford.edu/~tim/">T. Roughgarden</a>&nbsp;and E. Tardos:&nbsp;<a href="http://www.cs.cornell.edu/~eva/routing.ps">How Bad is Selfish <span class=GramE>Routing?</span></a><a href="http://portal.acm.org/citation.cfm?id=506153">&nbsp;Journal of the ACM,&nbsp;2002, Volume <span class=GramE>49 ,</span>&nbsp; Issue 2</a>. Preliminary version has appeared in the Proceedings of the 41st Annual IEEE Symposium on the Foundations of Computer Science, 2000.&nbsp;<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://theory.stanford.edu/~tim/">T. Roughgarden</a>&nbsp;and E. Tardos:&nbsp;<a href="http://www.cs.cornell.edu/~eva/ncg.ps"><em>Bounding the Inefficiency of Equilibria in <span class=SpellE>Nonatomic</span> Congestion <span class=SpellE>Games.</span></em></a><span class=SpellE><em>Games</em></span><em> and Economic <span class=SpellE>Behaviour</span>, Volume 47, Issue 2, May 2004, Pages 389-403.</em><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.eecs.berkeley.edu/~henrylin/">H. Lin</a>,&nbsp;<a href="http://theory.stanford.edu/~tim/">T. Roughgarden</a>, and E. Tardos,&nbsp;<a href="http://www.cs.cornell.edu/~eva/bp1.ps">Bounding <span class=SpellE>Braess's</span> Paradox</a>, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.eecs.berkeley.edu/~henrylin/">H. Lin</a>,&nbsp;<a href="http://theory.stanford.edu/~tim/">T. Roughgarden</a>,<span class=GramE>&nbsp; E</span>. Tardos, and A. Walkover.&nbsp;<span class=SpellE><a href="http://www.cs.cornell.edu/~eva/theory.stanford.edu/~tim/papers/mcbp.ps">Braess's</a></span><span class=MsoHyperlink> Paradox, Fibonacci Numbers, and Exponential <span class=SpellE>Inapproximability</span></span>, in the 32nd International Colloquium on Automata, Languages and Programming (ICALP<span class=GramE>,05</span>) July, 2005.</span><span style='font-size:10.0pt; mso-fareast-font-family:"Times New Roman"'> </span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/theory.stanford.edu/~tim/papers/mcbp.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.rpi\.edu\/~eanshel\/\0022 "'><u><span style='color:blue'>E. Anshelevich</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/research\.yahoo\.com\/~anirban\/\0022 "'><u><span style='color:blue'>A. Dasgupta</span></u></span>, É. Tardos,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~wexler\/\0022 "'><u><span style='color:blue'>T. Wexler</span></u></span>,&nbsp;<em><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/grad\/phd\/www\.cs\.cornell\.edu\/~wexler\/ndsa_STOC03\.ps\0022 "'><u><span style='color:blue'>Near-optimal network design with selfish agents</span></u></span></em>, in the proceedings of the Annual ACM Symposium on the Theory of Computing, 2003.</span></a></span><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/grad/phd/www.cs.cornell.edu/~wexler/ndsa_STOC03.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.rpi\.edu\/~eanshel\/\0022 "'><u><span style='color:blue'>E. Anshelevich</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/research\.yahoo\.com\/~anirban\/\0022 "'><u><span style='color:blue'>A. Dasgupta</span></u></span>,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/kleinber\/\0022 "'><u><span style='color:blue'>J. Kleinberg</span></u></span>, E. Tardos,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~wexler\/\0022 "'><u><span style='color:blue'>T. Wexler</span></u></span>, and&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/theory\.stanford\.edu\/~tim\/\0022 "'><u><span style='color:blue'>T. Roughgarden</span></u></span>.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/fairgame\.pdf\0022 "'><u><span style='color:blue'>The Price of Stability for Network Design with Fair Cost Allocation</span></u></span>, Annual IEEE Symposium on Foundations of Computer Science, 2004.&nbsp;</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/fairgame.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Eva Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/games\.pdf\0022 "'><u><span style='color:blue'>Network Games</span></u></span>. Proceedings of the Annual ACM Symposium on Theory of Computing, 2004.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/games.pdf"><span style='color:windowtext; text-decoration:none;text-underline:none'><span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~ara\/\0022 "'><u><span style='color:blue'>Ara Hayrapetyan</span></u></span>,&nbsp;Éva Tardos&nbsp;and&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~wexler\/\0022 "'><u><span style='color:blue'>Tom Wexler</span></u></span>&nbsp;-&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/pricing\.ps\0022 "'><u><span style='color:blue'>A Network Pricing Game for Selfish Traffic&nbsp;</span></u></span>&nbsp;Distributed Computing, (PODC'05 special issue).Preliminary version appeared in the Proceedings of<br> 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'05), July 2005.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/pricing.ps"><span style='color: windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~ara\/\0022 "'><u><span style='color:blue'>Ara Hayrapetyan</span></u></span>,&nbsp;Éva Tardos&nbsp;<span class=GramE>and&nbsp;</span><span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~wexler\/\0022 "'><u><span style='color:blue'>Tom Wexler</span></u></span>:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~ara\/papers\/htw06stoc\.pdf\0022 "'><u><span style='color:blue'>Effect of Collusion in Congestion Games</span></u></span>. Proceedings of the ACM Symposium on the Theory of Computing (STOC), 2006.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~ara/papers/htw06stoc.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>L. Blume, D. Easley, J. Kleinberg and E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/traders\.pdf\0022 "'><u><span style='color:blue'>Trading Networks with Price-Setting Agents</span></u></span>&nbsp; in the ACM Conference on Electronic Commerce, EC'07.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/traders.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Thanh Nguyen and E. Tardos,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cam\.cornell\.edu\/~thanh\/paper\/game\.pdf\0022 "'><u><span style='color:blue'>Approximately Maximizing Efficiency and&nbsp; Revenue in Convex Environments,</span></u></span>&nbsp;in the ACM Conference on Electronic Commerce, EC'07.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://users.cms.caltech.edu/~katrina/papers/nashbarrier.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Renato Paes Leme, Vasilis Syrgkanis, Eva Tardos,&nbsp;<span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~vasilis\/spoa-itcs\.pdf\0022 "'><u><span style='color:blue'>The Curse of Simultaneity</span></u></span> Innovations in Theoretical Computer Science, 2012</span></a></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span class=MsoHyperlink><span style='mso-fareast-font-family:"Times New Roman";color:windowtext; text-decoration:none;text-underline:none'>Saeed Alaei, Pooya Jalaly, and Eva Tardos, <a href="https://arxiv.org/abs/1703.10689">Computing Equilibrium in Matching Markets</a>, in the Proceedings of the ACM Conference on Economics and Computation, Cambridge, MA, June 2017.</span></span><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'>Simple Auctions</span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Siddhartha Banerjee, Giannis Fikioris, Eva Tardos. <a href="https://arxiv.org/pdf/2302.09127.pdf">Robust Pseudo-Markets for Reusable Public Resources</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>preliminary</span> version appeared in the 24th Annual Conference on Economics and Computing (EC'23), July 2023.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Siddhartha Banerjee, Giannis Fikioris, Eva Tardos. <a href="https://arxiv.org/pdf/2310.08881.pdf">Online Resource Sharing via Dynamic Max-Min Fairness: Efficiency, Robustness and Non-Stationarity</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span></span><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'> Midhul Vuppalapati, Giannis Fikioris, Rachit Agarwal, Asaf Cidon, Anurag Khandelwal, Eva Tardos. <a href="https://arxiv.org/pdf/2302.09127.pdf">Karma: Resource Allocation for Dynamic Demands</a><span class=GramE>,<span style='mso-spacerun:yes'>  </span>In the</span> 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI'23) 2023.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Pooya Jalaly, and Eva Tardos, <a href="https://arxiv.org/abs/1703.10681">Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations</a>, The 14th Conference on Web and Internet Economics, Oxford, December 2018. <o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Thomas Kesselheim, Robert Kleinberg, Eva Tardos, Smooth Online Mechanisms, in the proceedings of the ACM Conference on Economics and Computation, Portland, OR June 2015.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Paul Duetting, Thomas Kesselheim, Eva Tardos, <a href="http://arxiv.org/abs/1511.09208"><span class=GramE>Algorithms</span> as Mechanisms: The Price of Anarchy of Relax-and-Round</a>, preliminary version appeared in the proceedings of the ACM Conference on Economics and Computation, Portland, OR June 2015.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Thomas Kesselheim, Robert Kleinberg, Eva Tardos, <a href="http://dl.acm.org/citation.cfm?id=2764487"><span class=GramE>Smooth</span> online mechanisms: A game-theoretic problem in renewable energy markets</a>, in the proceedings of the ACM Conference on Economics and Computation, Portland, OR June 2015.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Ioannis Caragiannis, Christos <span class=SpellE>Kaklamanis</span>, Panagiotis <span class=SpellE>Kanellopoulos</span>, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, Éva Tardos, <a href="http://arxiv.org/abs/1201.6429">Bounding the inefficiency of outcomes in generalized second price auctions</a>, Journal of Economic Theory (JET), Volume 156, March 2015, Pages 343-388.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Vasilis Syrgkanis, Eva Tardos, <a href="http://arxiv.org/pdf/1211.1325.pdf"><span class=SpellE>Composable</span> and Efficient Mechanisms</a>, Preliminary version appeared in Symposium on the Theory of Computing, <a href="http://theory.stanford.edu/stoc2013/">STOC'13</a><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Brendan Lucier, Yaron Singer, Vasilis Syrgkanis, and Eva Tardos, <a href="http://www.cs.cornell.edu/~vasilis/eq_cpp_lncs.pdf">Equilibrium in Combinatorial Public Projects</a>, Conference on Web and Internet Economics, WINE 2013.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>David Kempe, Vasilis Syrgkanis, Eva Tardos. <a href="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2255268">Information Asymmetries in Common-Value Auctions with Discrete Signals</a>, <span class=SpellE>Arxiv</span> 2013. <span class=SpellE>AdAuction</span> workshop, Philadelphia, PA, June 2013.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Nishanth Dikkala and Eva Tardos. Can Credit Increase Revenue? Conference on Web and Internet Economics, WINE 2013.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Vasilis Syrgkanis, Eva Tardos, <a href="http://arxiv.org/pdf/1206.4771.pdf">Bayesian Sequential Auctions</a>, ACM Conference on electronic Commerce, <a href="http://www.sigecom.org/ec12/">EC'12</a><o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Renato Paes Leme, Vasilis Syrgkanis, Eva Tardos, <a href="http://arxiv.org/pdf/1108.2452.pdf">Sequential Auctions and Externalities</a>,&nbsp;SODA 2012<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Renato Paes Leme, Vasilis Syrgkanis, Eva Tardos, <a href="http://www.sigecom.org/exchanges/volume_11/2/PAESLEME.pdf">The Dining Bidder Problem: a la <span class=SpellE>russe</span> et a la <span class=SpellE>francais</span></a>&nbsp;<span class=SpellE>SIGecom</span> Exchanges, December 2012<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Tim Roughgarden and Eva Tardos, Do Externalities Degrade GSPs Efficiency? <span class=SpellE>AdAuction</span><br> workshop, <span class=SpellE>Valenia</span>, Spain, June 2012.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Brendan Lucier, Renato Paes Leme, Eva Tardos, <a href="http://www2012.wwwconference.org/proceedings/proceedings/p361.pdf">On Revenue in the Generalized Second Price Auction</a>, Proceedings of WWW'12, April 2012, Lyon, France.<o:p></o:p></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'>Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou,<br> Brendan Lucier, Renato Paes Leme, Eva Tardos. <a href="http://arxiv.org/abs/1201.6429">Bounding the inefficiency of equilibria in generalized second price auctions</a>. Preliminary versions include: Renato Paes Leme and Eva Tardos,<span class=GramE>&nbsp; Pure</span> and Bayes-Nash Price of Anarchy for Generalized Second Price Auction, 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010).<o:p></o:p></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~vasilis/spoa-itcs.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Mechanism Design</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~vasilis/spoa-itcs.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.orie\.cornell\.edu\/~aarcher\/\0022 "'><u><span style='color:blue'>A. Archer&nbsp;</span></u></span><span class=GramE>and</span> 'E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/fpJalg-rev\.ps\0022 "'><u><span style='color:blue'>Frugal Path mechanisms</span></u></span>, to appear in Transaction on Algorithms. Preliminary version appeared in the Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 991-999.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/fpJalg-rev.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.orie\.cornell\.edu\/~aarcher\/\0022 "'><u><span style='color:blue'>A. Archer&nbsp;</span></u></span>&nbsp;<span class=GramE>and</span> E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cis\.upenn\.edu\/~mkearns\/teaching\/SponsoredSearch\/ArcherTardos\.pdf\0022 "'><u><span style='color:blue'>Truthful mechanisms for one-parameter agents</span></u></span>,&nbsp;<em>Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science</em>&nbsp;(2001) 482-491.&nbsp;&nbsp;&nbsp;</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cis.upenn.edu/~mkearns/teaching/SponsoredSearch/ArcherTardos.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.orie\.cornell\.edu\/~aarcher\/\0022 "'><u><span style='color:blue'>A. Archer</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.berkeley\.edu\/~christos\/\0022 "'><u><span style='color:blue'>Christos Papadimitriou</span></u></span>,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/research\.microsoft\.com\/~kunal\/\0022 "'><u><span style='color:blue'>Kunal Talwar</span></u></span>, Eva Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/papers\/soda03\.pdf\0022 "'><u><span style='color:blue'>An approximate truthful mechanism for combinatorial auctions with single parameter agents</span></u></span>.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.internetmathematics\.org\/volumes\/1\/2\/pp129_150\.pdf\0022 "'><u><span style='color:blue'>Internet Mathematics, Volume 1 Issue 2, 2004</span></u></span>. <span class=SpellE>Prleiminary</span> version appeared in the Proceedings of<span class=GramE>&nbsp; the</span> Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 205 - 214.&nbsp;</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.internetmathematics.org/volumes/1/2/pp129_150.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/martin\.palenica\.com\/\0022 "'><u><span style='color:blue'>M. Pal</span></u></span>&nbsp;<span class=GramE>and</span> E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/xmono_FOCS03camera\.ps\0022 "'><u><span style='color:blue'>Group Strategyproof Mechanisms via Primal-Dual Algorithms</span></u></span>, in the Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, 2003.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/xmono_FOCS03camera.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www-2\.cs\.cmu\.edu\/~anupamg\/\0022 "'><u><span style='color:blue'>A. Gupta</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.umd\.edu\/~srin\/\0022 "'><u><span style='color:blue'>A. Srinivasan</span></u></span>, and E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/derand\.ps\0022 "'><u><span style='color:blue'>Cost-Sharing Mechanisms for Network Design.</span></u></span>&nbsp;Proceedings of APPROX 2004.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/derand.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Social Networks</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/derand.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'><span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.washington\.edu\/homes\/kempe\/\0022 "'><u><span style='color:blue'>David Kempe</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/kleinber\/\0022 "'><u><span style='color:blue'>Jon Kleinberg</span></u></span>, Éva Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/diffuse\.pdf\0022 "'><u><span style='color:blue'>Maximizing the Spread of Influence in a Social Network.</span></u></span><br> <em>Proceedings of&nbsp; KDD 2003, Washington DC</em>.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/diffuse.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.washington\.edu\/homes\/kempe\/\0022 "'><u><span style='color:blue'>David Kempe</span></u></span><span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/kleinber\/\0022 "'><u><span style='color:blue'>Jon Kleinberg</span></u></span>, Éva Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www-rcf\.usc\.edu\/~dkempe\/publications\/influential-nodes\.pdf\0022 "'><u><span style='color:blue'>Influential Nodes in a Diffusion Model for Social Networks.</span></u></span>&nbsp;<span class=SpellE>In<em>Proceedings</em></span><em> of ICALP 2005, <span class=SpellE>Lisboa</span>, Portugal</em>.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www-rcf.usc.edu/~dkempe/publications/influential-nodes.pdf"><span class=GramE><span style='color:windowtext;text-decoration:none; text-underline:none'>on</span></span><span style='color:windowtext; text-decoration:none;text-underline:none'> Kleinberg, Sid Suri and Eva Tardos,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.sidsuri\.com\/About_Me_files\/holes-final\.pdf\0022 "'><u><span style='color:blue'>Strategic Network Formation with Structural Holes</span></u></span>, in the proceedings of the ACM Conference on Electronic Commerce 2008.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.sidsuri.com/About_Me_files/holes-final.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Jon Kleinberg and Eva Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/kleinber\/stoc08-exchange\.pdf\0022 "'><u><span style='color:blue'>Balanced Outcomes in Social Exchange Networks</span></u></span>. ACM Symposium on the Theory of Computing (STOC), 2007.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/kleinber/stoc08-exchange.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Classification</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/kleinber/stoc08-exchange.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/kleinber\/\0022 "'><u><span style='color:blue'>J. Kleinberg</span></u></span>&nbsp;<span class=GramE>and</span> E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/Info\/People\/eva\/papers\/vision\.ps\0022 "'><u><span style='color:blue'>Approximation Algorithms for Classification Problems with Pairwise Relationships:<br> Metric Partitioning and Markov Random Fields</span></u></span>,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/portal\.acm\.org\/citation\.cfm?id=585268\0022 "'><u><span style='color:blue'>Journal of the ACM,&nbsp;2002, Volume 49, &nbsp; Issue 5, pp, 616-639</span></u></span>. Preliminary version has appeared in the Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://portal.acm.org/citation.cfm?id=585268"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www-2\.cs\.cmu\.edu\/~anupamg\/\0022 "'><u><span style='color:blue'>A. Gupta</span></u></span>&nbsp;<span class=GramE>and</span> E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/Info\/People\/eva\/papers\/stoc00\.ps\0022 "'><u><span style='color:blue'>A Constant Factor Approximation Algorithm for a Class of Classification Problems</span></u></span>, In the Proceedings of the ACM Symposium on the Theory of Computing, May 2000.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/Info/People/eva/papers/stoc00.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.orie\.cornell\.edu\/~aarcher\/\0022 "'><u><span style='color:blue'>A. Archer</span></u></span>&nbsp;J. Fakcharoenphol, C. Harrelson<span class=GramE>,&nbsp;</span><span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.berkeley\.edu\/~robi\/\0022 "'><u><span style='color:blue'>R. Krauthgamer</span></u></span>,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/research\.microsoft\.com\/~kunal\/\0022 "'><u><span style='color:blue'>K. Talvar</span></u></span>&nbsp;and E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/decomposable\.pdf\0022 "'><u><span style='color:blue'>Approximate Classification via Earthmover Metrics,</span></u></span>&nbsp;in the Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/decomposable.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Thanh Nguyen and E. Tardos<span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cam\.cornell\.edu\/~thanh\/paper\/mri\.pdf\0022 "'><u><span style='color:blue'>Parallel Imaging Problem</span></u></span>, European Symposium on Algorithms, 2008: 684-695.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cam.cornell.edu/~thanh/paper/mri.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Clustering and facility location</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cam.cornell.edu/~thanh/paper/mri.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~zoya\/\0022 "'><u><span style='color:blue'>Zoya Svitkina</span></u></span>&nbsp;<span class=GramE>and</span> Eva Tardos:&nbsp;<span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~zoya\/pub\/soda2006\.pdf\0022 "'><u><span style='color:blue'>Facility Location with Hierarchical Facility Costs</span></u></span>. <span class=GramE>in</span> the Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~zoya/pub/soda2006.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/martin\.palenica\.com\/\0022 "'><u><span style='color:blue'>Martin Pál</span></u></span>, Éva Tardos<span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/Tom%20Wexler\0022 "'><u><span style='color:blue'>Tom Wexler</span></u></span>.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/People\/mpal\/papers\/fl_hard\.ps\0022 "'><u><span style='color:blue'>Facility Location with Hard Capacities.</span></u></span>&nbsp;In the Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, 2001.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/People/mpal/papers/fl_hard.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/legacy\.orie\.cornell\.edu\/~shmoys\/\0022 "'><u><span style='color:blue'>D. B. Shmoys,</span></u></span>&nbsp; E. Tardos and K. Aardal.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/facility\.ps\0022 "'><u><span style='color:blue'>Approximation algorithms for the facility location problem</span></u></span>.<br> In the Proc. of the 29th Annual ACM Symposium on the Theory of Computing, 1997, pp. 265-274.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/facility.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.princeton\.edu\/~moses\/\0022 "'><u><span style='color:blue'>M. Charikar</span></u></span>,<span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cis\.upenn\.edu\/~sudipto\/\0022 "'><u><span style='color:blue'>&nbsp;S. Guha</span></u></span><span class=GramE>,</span> E. Tardos and&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/legacy\.orie\.cornell\.edu\/~shmoys\/\0022 "'><u><span style='color:blue'>D. Shmoys</span></u></span>.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/median\.ps\0022 "'><u><span style='color:blue'>A constant-factor approximation algorithm for the k-median problem</span></u></span>. To appear in the JCSS, preliminary version has appeared in the<span class=GramE>&nbsp; Proc</span>. of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 1-10.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/median.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~ara\/\0022 "'><u><span style='color:blue'>Ara Hayrapetyan</span></u></span>,&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.math\.uwaterloo\.ca\/~cswamy\/\0022 "'><u><span style='color:blue'>Chaitanya Swamy</span></u></span>&nbsp;and Éva Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~ara\/papers\/hst05soda\.pdf\0022 "'><u><span style='color:blue'>Network Design for Information Networks</span></u></span>, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~ara/papers/hst05soda.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Network Design</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~ara/papers/hst05soda.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. Williamson<span class=GramE>:&nbsp;</span><span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/design\.ps\0022 "'><u><span style='color:blue'>Improved approximation algorithms for network design problems</span></u></span>. In the proceeding of the <span class=GramE>5th</span> Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994, pp. 223-232.&nbsp;<span style='mso-field-code:" HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR1116\.ps\.Z\0022 "'><u><span style='color:blue'>ORIE TR-1116</span></u></span>.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1116.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>V. Melkonian and E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/dirdesign\.ps\0022 "'><u><span style='color:blue'>Approximation Algorithms for a Directed Network Design Problem</span></u></span>.<br> In the Proceedings of the <span class=GramE>7th</span> International Integer Programming and Combinatorial Optimization Conference (IPCO'99), Graz, 1999.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/dirdesign.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>Ara Hayrapetyan, Chaitanya Swamy and&nbsp;Éva Tardos&nbsp;-&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/FacilityLocation\.ps\0022 "'><u><span style='color:blue'>Network Design for Information Networks</span></u></span></span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/FacilityLocation.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~zoya\/\0022 "'><u><span style='color:blue'>Zoya Svitkina</span></u></span>&nbsp;and Éva Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/facloc\.ps\0022 "'><u><span style='color:blue'>Facility Location with Hierarchical Facility Costs<strong>.</strong></span></u></span></span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/facloc.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Routing Disjoint Paths and Packets in Networks</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/facloc.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>J. Kleinberg, Y. Rabani, and E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/Info\/People\/eva\/papers\/fair\.ps\0022 "'><u><span style='color:blue'>Fairness in Routing and Load Balancing</span></u></span>, In the Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/Info/People/eva/papers/fair.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>J. Kleinberg and E. Tardos<span class=GramE>:&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/routing2\.ps\0022 "'><u><span style='color:blue'>Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks</span></u></span>, Journal of Computer and System Sciences STOC'95 special issue, <span class=SpellE>vol</span> 57, pp 61-73, 1998. Preliminary version has appeared in the Proceedings of the 27th Annual ACM Symposium on the<span class=GramE>&nbsp; Theory</span> of Computing, 1995, pp. 26-35.&nbsp;<span style='mso-field-code:" HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR1121\.ps\.Z\0022 "'><u><span style='color:blue'>ORIE TR-1121</span></u></span>.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1121.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>J. Kleinberg and E. Tardos<span class=GramE>:&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/routing1\.ps\0022 "'><u><span style='color:blue'>Disjoint Paths in Densely Embedded Graphs</span></u></span>, In the Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 1995, pp. 52-61.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/routing1.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>Y. Rabani and E. Tardos<span class=GramE>:&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/STOC96\.ps\0022 "'><u><span style='color:blue'>Distributed Packet Switching in Arbitrary Networks</span></u></span>, in the 28th ACM Symposium on Theory of Computing, May, 1996, pp. 366-376.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/STOC96.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Scheduling</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/STOC96.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>D. Shmoys and E. Tardos<span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/Approx\.Algorithm\.Generalized\.Assignment\.Prob\.pdf\0022 "'><u><span style='color:blue'>An approximation algorithm for the generalized assignment problem</span></u></span>. Mathematical Programming A 62, 1993, 461-474.&nbsp; Preliminary version has appeared in the proceeding of the <span class=GramE>4th</span> Annual ACM-SIAM Symposium on Discrete Algorithms, January 1993.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Approx.Algorithm.Generalized.Assignment.Prob.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>A. Goel, M. Henzinger, S. Plotkin, and E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/transfer\.ps\0022 "'><u><span style='color:blue'>Scheduling Data Transfers in a Network and the Set Scheduling Problem</span></u></span>&nbsp;In the<span class=GramE>&nbsp; Proc</span>. of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp. 189-199.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/transfer.ps"><span style='color: windowtext;text-decoration:none;text-underline:none'>Generalized Flow</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/transfer.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>A. Goldberg, S. Plotkin, E. Tardos<span class=GramE>:<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/genflow\.ps\0022 "'><u><span style='color:blue'>&nbsp;Combinatorial algorithms for the generalized circulation problem</span></u></span>,</span> Mathematics of Operations Research, 16/2, 1991, 351-381. Preliminary version has appeared in the Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science (1988), 432-443.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/genflow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>E. Tardos and K. Wayne. Simple Generalized Maximum Flow Algorithms. Proceedings of the <span class=GramE>6th</span> International Integer Programming and Combinatorial Optimization Conference &nbsp; (IPCO'98), Houston, 1998, pp. 310-324.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/genflow.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Packing and Covering Algorithms</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/genflow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>P. Klein, S. Plotkin, C. Stein and E. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts.&nbsp; SIAM Journal on Computing, 23/3, 1994<span class=GramE>,.</span> 466-487.Preliminary version has appeared in the proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (1990), 310-321.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/genflow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. <span class=SpellE>Tragoudas</span>: Fast Approximation Algorithms for Multicommodity Flow Problems, Journal of Computer and System Sciences, 50 (STOC'91 special issue), 1995, pp. 228--243.&nbsp;Preliminary version has appeared in the Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (1991), 101-110.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/genflow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>S.A. Plotkin, D. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, to appear in Mathematics of Operations Research.&nbsp;<span style='mso-field-code:" HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR999\.ps\.Z\0022 "'><u><span style='color:blue'>ORIE TR-999</span></u></span>.&nbsp;&nbsp;Preliminary version has appeared in the Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science (1991), 495-505.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR999.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>Networks with transit times</span></a><span class=MsoHyperlink><span style='color: windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR999.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>B. Hoppe and E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR1117\.ps\.Z\0022 "'><u><span style='color:blue'>Polynomial Time Algorithms for Some Evacuation Problems.</span></u></span>&nbsp;In the proceeding of the <span class=GramE>5th</span> Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994, pp. 433-441. .</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1117.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>B. Hoppe and E. Tardos:&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/dynflow\.ps\0022 "'><u><span style='color:blue'>The Quickest Transshipment Problem</span></u></span>, journal version of the paper in the proceeding of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995 pp. 512-521.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/dynflow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>L. Fleischer and E. Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/lisa-flow\.ps\0022 "'><u><span style='color:blue'>Efficient Continuous-Time Dynamic Network Flow Algorithms.</span></u></span>&nbsp;Operations Research Letters 23 (1998) pp. 71-80.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/lisa-flow.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Effective bandwidth</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/lisa-flow.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>J. Kleinberg, Y. Rabani and E. Tardos.&nbsp;<span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/home\/eva\/bursty\.ps\0022 "'><u><span style='color:blue'>Allocating Bandwidth for Bursty Connection</span></u></span>. Journal version of the paper in the Proceedings of the 29th ACM Symposium on Theory of Computing, <span class=GramE>May,</span> 1997, pp. 664-673.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/bursty.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Finding cuts in graphs</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/home/eva/bursty.ps"><span style='color:windowtext;text-decoration:none;text-underline:none'>S.A. Plotkin and E. Tardos<span class=GramE>,&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/ORIE%20TR-1042\0022 "'><u><span style='color:blue'>Improved Bounds on the Max-flow Min-cut Ratio for Multicommodity Flows</span></u></span>. Combinatorica.&nbsp;Preliminary version has appeared in the Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 691-697.&nbsp;&nbsp;</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/ORIE%20TR-1042"><span style='color:windowtext;text-decoration:none;text-underline:none'>P. Klein, S. Plotkin, S. Rao and E. Tardos:&nbsp;<span style='mso-field-code: " HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR1119\.ps\.Z\0022 "'><u><span style='color:blue'>Approximation Algorithms for Steiner and Directed Multicuts.&nbsp;</span></u></span></span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1119.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>Zoya <span class=GramE>Svitkina,</span> and Eva Tardos.&nbsp;<span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/approx\.ps\0022 "'><u><span style='color:blue'>Min-Max Multiway Cut</span></u></span>. Proceedings of APPROX 2004.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/approx.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>Separating cutting planes</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/approx.ps"><span style='color:windowtext; text-decoration:none;text-underline:none'>L. Fleischer and E. Tardos<span class=GramE>:&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022ftp\:\/\/ftp\.orie\.cornell\.edu\/pub\/techreps\/TR1150\.ps\.Z\0022 "'><u><span style='color:blue'>Separating Maximally Violated Comb Inequalities in Planar Graphs</span></u></span>, tech report version of the paper in the Proceedings of the 5th International Integer Programming and Combinatorial Optimization Conference (IPCO), June 1996, pp. 475-489.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> </ul> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1150.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>Other Miscellaneous papers</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l5 level1 lfo6'><span style='mso-fareast-font-family:"Times New Roman"'><a href="ftp://ftp.orie.cornell.edu/pub/techreps/TR1150.ps.Z"><span style='color:windowtext;text-decoration:none;text-underline:none'>E. Tardos<span class=GramE>:&nbsp;</span><span style='mso-field-code:" HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/Gap\.Between\.Monotone\.NonMonotone\.Circuit\.Complexity\.is\.Exponential\.pdf\0022 "'><u><span style='color:blue'>The Gap Between Monotone and Non-Monotone Circuit Complexity is Exponential</span></u></span>. Combinatorica, 1987, 7(4) 141-142.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> <p><a href="http://www.cs.cornell.edu/~eva/Gap.Between.Monotone.NonMonotone.Circuit.Complexity.is.Exponential.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>&nbsp;</span></a></p> </td> <td width=46 style='width:3.0pt;padding:15.0pt 15.0pt 15.0pt 15.0pt'></td> </tr> </table> <p class=MsoNormal><span style='mso-fareast-font-family:"Times New Roman"; display:none;mso-hide:all'><o:p>&nbsp;</o:p></span></p> <table class=MsoNormalTable border=0 cellspacing=30 cellpadding=0 width=0 style='width:614.25pt;mso-cellspacing:1.5pt;mso-yfti-tbllook:1184;mso-padding-alt: 15.0pt 15.0pt 15.0pt 15.0pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes;mso-yfti-lastrow:yes'> <td width=819 style='width:548.25pt;padding:15.0pt 15.0pt 15.0pt 15.0pt'> <h3><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Gap.Between.Monotone.NonMonotone.Circuit.Complexity.is.Exponential.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>Older Survey Papers</span></a></span><span class=MsoHyperlink><span style='color:windowtext;font-weight:normal;text-decoration:none;text-underline: none'><o:p></o:p></span></span></h3> <ul type=disc> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Gap.Between.Monotone.NonMonotone.Circuit.Complexity.is.Exponential.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>A. V. Goldberg,&nbsp; E. Tardos, R. E. Tarjan:&nbsp;<span style='mso-field-code: " HYPERLINK \0022http\:\/\/www\.cs\.cornell\.edu\/~eva\/Network\.Flow\.Algorithms\.pdf\0022 "'><u><span style='color:blue'>Network&nbsp; Flow Algorithms</span></u></span>, in &nbsp; Paths, Flows and VLSI-Design (eds. B. Korte, L. Lovasz, H.J. <span class=SpellE>Proemel</span>, and A. Schrijver) Springer Verlag, 1990, 101-164.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Network.Flow.Algorithms.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>E. Tardos: Strongly Polynomial and Combinatorial Algorithms in Optimization, in the Proceedings of the International Congress of&nbsp; Mathematicians Kyoto 1990, Springer-Verlag, Tokyo 1991, 1467-1478.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Network.Flow.Algorithms.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>D. B. Shmoys, E. Tardos: Computational Complexity, In the Handbook of Combinatorics (eds. R. Graham, M. Groetschel, and L. Lovasz) North Holland. An extended version has appeared as Technical Report 918, School of&nbsp; Operations Research and Industrial Engineering, Cornell University.</span></a><span class=MsoHyperlink><span style='color:windowtext; text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Network.Flow.Algorithms.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>L. Lovasz, D. B. Shmoys and E. Tardos: Combinatorics in Computer Science,&nbsp; In the Handbook of Combinatorics (eds. R. Graham, M. Groetschel,&nbsp; and L. Lovasz) North Holland.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none; text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Network.Flow.Algorithms.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>E. Tardos: Approximate Min-Max Theorems and Fast Approximation Algorithms for Multicommodity Flow Problems, annotated bibliography.&nbsp; In Proc. of the Summer School on Combinatorial Optimization, in Maastricht,&nbsp;<br> The Netherlands, Aug. 1993.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> <li class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt: auto;mso-list:l2 level1 lfo7;tab-stops:list .5in'><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.cs.cornell.edu/~eva/Network.Flow.Algorithms.pdf"><span style='color:windowtext;text-decoration:none;text-underline:none'>E. Tardos: Approximate Min-Max Theorems and Fast Approximation&nbsp; Algorithms for Multicommodity Flow Problems, In Proc. Network Optimization&nbsp; Theory and Practice (NETFLOW), in San <span class=SpellE>Miniato</span> (PI) Italy, Oct. 1993.</span></a><span class=MsoHyperlink><span style='color:windowtext;text-decoration:none;text-underline:none'><o:p></o:p></span></span></span></li> </ul> </td> </tr> </table> <p class=MsoNormal><span class=MsoHyperlink><span style='mso-fareast-font-family: "Times New Roman";color:windowtext;text-decoration:none;text-underline:none'><o:p>&nbsp;</o:p></span></span></p> </div> </body> </html>