<?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-22T09:41:10Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/116624" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/116624</identifier><datestamp>2026-05-15T19:51:33Z</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">Wu, Wangwei</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Alvarez Daziano, Ricardo</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Banerjee, Siddhartha</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Topaloglu, Huseyin</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-01-14T20:01:15Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 14612</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 31489179</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/116624</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/pnjf-j837</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16611841</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">139 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">My dissertation is composed of three parts related to decision models and strategies in different contexts. The first part studies discrete models' latent class assignment strategies and analyzes the statistical behavior of six competing class assignment strategies. A Monte Carlo study and two empirical case studies are used to show that assigning individuals to classes based on maximum multinomial logit probabilities behaves better than randomly drawn classes in market share predictions. While randomly drawn classes have higher accuracy in predicted class shares, class assignment based on individual-level conditional estimates that account for the sampling distribution of the assignment parameters shows superior behavior for a larger number of choice occasions per individual. The second part considers the widely-studied reusable-resource allocation problem – a principal can allocate up to $C$ identical resources (or servers) in an online manner to arriving agents, each of whom requires a server for $D$ periods, and offers a random reward sampled from some known underlying process. In contrast to past work, in high-dimensional regimes where $C$ and $D$ are large, we demonstrate policies with exponential convergence to the hindsight optimal value under discrete-valued arrival processes (including time-varying arrivals). Our results are based on a novel combination of receding-horizon control along with recent sample-path coupling techniques; this approach may prove useful in establishing similar exponential convergence and state-space collapse results in more complex control settings. The third part proposes the Re-evaluated Transformer model for model-free offline reinforcement learning tasks to both better learn state values and to address data coverage issues. The proposed model incorporates a novel and concise Re-evaluation mechanism in the sequential model, which leverages the trained model to predict and update state values. Extensive experiments on multiple offline RL benchmarks are conducted to demonstrate state-of-the-art performance.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">THREE ESSAYS ON DISCRETE CHOICE LATENT CLASS MODEL, ONLINE REUSABLE RESOURCE ALLOCATION AND TRANSFORMER MODEL FOR OFFLINE REINFORCEMENT LEARNING</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16611841</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Systems Engineering</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., Systems Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</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">Wu, Wangwei</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="a6276e4b-68bd-4e48-ae11-d2705531ae50">
	&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&lt;/Language>
   	&lt;Title>THREE ESSAYS ON DISCRETE CHOICE LATENT CLASS MODEL, ONLINE REUSABLE RESOURCE ALLOCATION AND TRANSFORMER MODEL FOR OFFLINE REINFORCEMENT LEARNING&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/pnjf-j837&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Wu, Wangwei&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;Abstract>My dissertation is composed of three parts related to decision models and strategies in different contexts. The first part studies discrete models&amp;apos; latent class assignment strategies and analyzes the statistical behavior of six competing class assignment strategies. A Monte Carlo study and two empirical case studies are used to show that assigning individuals to classes based on maximum multinomial logit probabilities behaves better than randomly drawn classes in market share predictions. While randomly drawn classes have higher accuracy in predicted class shares, class assignment based on individual-level conditional estimates that account for the sampling distribution of the assignment parameters shows superior behavior for a larger number of choice occasions per individual. The second part considers the widely-studied reusable-resource allocation problem – a principal can allocate up to $C$ identical resources (or servers) in an online manner to arriving agents, each of whom requires a server for $D$ periods, and offers a random reward sampled from some known underlying process. In contrast to past work, in high-dimensional regimes where $C$ and $D$ are large, we demonstrate policies with exponential convergence to the hindsight optimal value under discrete-valued arrival processes (including time-varying arrivals). Our results are based on a novel combination of receding-horizon control along with recent sample-path coupling techniques; this approach may prove useful in establishing similar exponential convergence and state-space collapse results in more complex control settings. The third part proposes the Re-evaluated Transformer model for model-free offline reinforcement learning tasks to both better learn state values and to address data coverage issues. The proposed model incorporates a novel and concise Re-evaluation mechanism in the sequential model, which leverages the trained model to predict and update state values. Extensive experiments on multiple offline RL benchmarks are conducted to demonstrate state-of-the-art performance.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>