<?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-22T10:40:00Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/103033" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/103033</identifier><datestamp>2026-05-15T19:45:05Z</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">Sumida, Mika</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Topaloglu, Huseyin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Frazier, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Gurvich, Itai</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-03-12T17:41:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-03-12T17:41:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 12267</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 28089392</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/103033</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/njfx-n107</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">13277802</dim:field>
   <dim:field mdschema="dc" element="description">294 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In online retailing, core operational questions include deciding on the assortment of products that should be displayed to incoming customers and how to adjust these assortments and prices in real-time according to current capacity and observed demand. In this dissertation, we explore three new developments in online retailing and develop models and techniques for revenue management in these settings. The underlying goal in each of the chapters is to develop computationally efficient and provably good algorithms. First, we consider a revenue management model over a single flight leg, where customers are allowed to lock an available fare. The goal is to find a policy to decide which set of fare classes to make available at each time period to maximize the total expected revenue. We develop an approximate policy that is guaranteed to obtain at least half of the optimal total expected revenue. Second, we consider dynamic assortment problems with reusable products, in which each arriving customer chooses a product within an offered assortment, uses the product for a random duration of time, and returns the product  back  to  the  firm  to  be  used  by  other  customers.  The  goal  is  to  find  a  policy  for  deciding  on the  assortment  to  offer  to  each  customer  so  that  the  total  expected  revenue  over  a  finite  selling  horizon is  maximized.  We  present an approximate  policy that  is  guaranteed  to  obtain  at  least half of  the  optimal  total  expected  revenue.  The policy is based  on  constructing  linear  approximations  to  the optimal  value  functions. Lastly, we examine the revenue-utility assortment problem with the goal of finding an assortment that maximizes a  linear  combination  of  the  expected  revenue  of  the  firm  and  the  expected  utility  of  the  customer.  This criterion captures the tradeoff between the firm-centric objective of maximizing the expected revenue and the customer-centric objective of maximizing the expected utility. When customers choose according to the multinomial  logit  model,  and  there  is  a  constraint  on  the  offered  assortments  characterized  by  a  totally unimodular matrix, finding the optimal assortment requires solving a nonconcave optimization problem. We provide an efficient algorithm for finding the welfare optimal assortment by solving a parametric linear program and testing a polynomial size collection of candidate assortments.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject">approximation algorithms</dim:field>
   <dim:field mdschema="dc" element="subject">choice modeling</dim:field>
   <dim:field mdschema="dc" element="subject">dynamic programming</dim:field>
   <dim:field mdschema="dc" element="subject">revenue management</dim:field>
   <dim:field mdschema="dc" element="title">New Revenue Management Models for Online Retailing</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://catalog.library.cornell.edu/catalog/13277802</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research and Information 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., Operations Research and Information Engineering</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">Sumida, Mika</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="d3927c81-8f8e-44f2-a9ec-cb7979714a05">
	&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>New Revenue Management Models for Online Retailing&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2020-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/njfx-n107&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Sumida, Mika&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>approximation algorithms&lt;/Keyword>
    &lt;Keyword>choice modeling&lt;/Keyword>
    &lt;Keyword>dynamic programming&lt;/Keyword>
    &lt;Keyword>revenue management&lt;/Keyword>
   	&lt;Abstract>In online retailing, core operational questions include deciding on the assortment of products that should be displayed to incoming customers and how to adjust these assortments and prices in real-time according to current capacity and observed demand. In this dissertation, we explore three new developments in online retailing and develop models and techniques for revenue management in these settings. The underlying goal in each of the chapters is to develop computationally efficient and provably good algorithms. First, we consider a revenue management model over a single flight leg, where customers are allowed to lock an available fare. The goal is to find a policy to decide which set of fare classes to make available at each time period to maximize the total expected revenue. We develop an approximate policy that is guaranteed to obtain at least half of the optimal total expected revenue. Second, we consider dynamic assortment problems with reusable products, in which each arriving customer chooses a product within an offered assortment, uses the product for a random duration of time, and returns the product  back  to  the  firm  to  be  used  by  other  customers.  The  goal  is  to  find  a  policy  for  deciding  on the  assortment  to  offer  to  each  customer  so  that  the  total  expected  revenue  over  a  finite  selling  horizon is  maximized.  We  present an approximate  policy that  is  guaranteed  to  obtain  at  least half of  the  optimal  total  expected  revenue.  The policy is based  on  constructing  linear  approximations  to  the optimal  value  functions. Lastly, we examine the revenue-utility assortment problem with the goal of finding an assortment that maximizes a  linear  combination  of  the  expected  revenue  of  the  firm  and  the  expected  utility  of  the  customer.  This criterion captures the tradeoff between the firm-centric objective of maximizing the expected revenue and the customer-centric objective of maximizing the expected utility. When customers choose according to the multinomial  logit  model,  and  there  is  a  constraint  on  the  offered  assortments  characterized  by  a  totally unimodular matrix, finding the optimal assortment requires solving a nonconcave optimization problem. We provide an efficient algorithm for finding the welfare optimal assortment by solving a parametric linear program and testing a polynomial size collection of candidate assortments.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>