<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:05:48Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/56874" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/56874</identifier><datestamp>2026-05-15T19:48:47Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Niazadeh, Rad</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Kleinberg, Robert David</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Sirer, Emin G.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Kleinberg, Jon M.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-04-26T14:17:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-04-26T14:17:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-08-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 10385</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 10606182</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/56874</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/X4MS3QXQ</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">10361551</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Prevalent internet marketplaces and crowdsourcing platforms have started facing new computational challenges. In point of fact, these challenges exist mostly due to the strategic behavior of users, the stochastic nature of these platforms, their real-time computations, and the demand for incorporating the large-scale users data. With these challenges in front of the mechanism designer, the job of the field of algorithmic mechanism design is to find new ways of tackling them. Having this objective in mind, my dissertation is taking a closer look into various aspects of mechanism design for (real-world) applications suffering from the aforementioned challenges. We informally refer to such applications as "complex environments". In this dissertation, we particularly show how to develop general reductions from mechanism design to algorithm design, how to develop and analyze simple mechanisms for trade, and finally how to learn optimal revenue mechanisms in an online fashion by interacting with users in several rounds. Throughout this dissertation, we point out how we Incorporate techniques and ideas from combinatorial optimization, learning theory and applied probability to obtain our results.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">Economics</dim:field>
   <dim:field mdschema="dc" element="subject">Operations research</dim:field>
   <dim:field mdschema="dc" element="subject">Computer science</dim:field>
   <dim:field mdschema="dc" element="subject">Online learning</dim:field>
   <dim:field mdschema="dc" element="subject">Algorithmic Game Theory</dim:field>
   <dim:field mdschema="dc" element="subject">Algorithmic Mechanism Design</dim:field>
   <dim:field mdschema="dc" element="subject">Approximation Mechanism Design</dim:field>
   <dim:field mdschema="dc" element="subject">Blackbox Reductions</dim:field>
   <dim:field mdschema="dc" element="subject">Complex Environments</dim:field>
   <dim:field mdschema="dc" element="title">Algorithms vs. Mechanisms: Mechanism Design for Complex Environments</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Niazadeh, Rad</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="dce0f9ef-1790-41e7-a121-a609ac6f3786">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Algorithms vs. Mechanisms: Mechanism Design for Complex Environments&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2017-08-30&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/X4MS3QXQ&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Niazadeh, Rad&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Economics&lt;/Keyword>
    &lt;Keyword>Operations research&lt;/Keyword>
    &lt;Keyword>Computer science&lt;/Keyword>
    &lt;Keyword>Online learning&lt;/Keyword>
    &lt;Keyword&gt;Algorithmic Game Theory&lt;/Keyword>
    &lt;Keyword>Algorithmic Mechanism Design&lt;/Keyword>
    &lt;Keyword>Approximation Mechanism Design&lt;/Keyword>
    &lt;Keyword>Blackbox Reductions&lt;/Keyword>
    &lt;Keyword>Complex Environments&lt;/Keyword>
   	&lt;Abstract>Prevalent internet marketplaces and crowdsourcing platforms have started facing new computational challenges. In point of fact, these challenges exist mostly due to the strategic behavior of users, the stochastic nature of these platforms, their real-time computations, and the demand for incorporating the large-scale users data. With these challenges in front of the mechanism designer, the job of the field of algorithmic mechanism design is to find new ways of tackling them. Having this objective in mind, my dissertation is taking a closer look into various aspects of mechanism design for (real-world) applications suffering from the aforementioned challenges. We informally refer to such applications as &amp;quot;complex environments&amp;quot;. In this dissertation, we particularly show how to develop general reductions from mechanism design to algorithm design, how to develop and analyze simple mechanisms for trade, and finally how to learn optimal revenue mechanisms in an online fashion by interacting with users in several rounds. Throughout this dissertation, we point out how we Incorporate techniques and ideas from combinatorial optimization, learning theory and applied probability to obtain our results.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>