<node id="681161">
  <nid>681161</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1741965944</created>
  <changed>1741965986</changed>
  <title><![CDATA[PhD Defense by Yiming Jiang]]></title>
  <body><![CDATA[<p>&nbsp;</p><p><strong>Title:</strong>&nbsp;Pricing and Causal Inference Under Networks</p><p><strong>Date:</strong>&nbsp;March 31th, 2025</p><p><strong>Time:</strong>&nbsp;10:30AM – 12:00PM</p><p><strong>Meeting Link:</strong>&nbsp;<a href="https://gatech.zoom.us/j/97009427244">https://gatech.zoom.us/j/97009427244</a></p><p>&nbsp;</p><p><strong>Yiming Jiang</strong></p><p>Operations Research PhD Student</p><p>H. Milton Stewart School of Industrial and Systems Engineering</p><p>Georgia Institute of Technology</p><p>&nbsp;</p><p><strong>Committee:</strong></p><p>Dr. He Wang (Advisor), H. Milton Stewart School of Industrial and Systems Engineering</p><p>Dr. Yao Xie, H. Milton Stewart School of Industrial and Systems Engineering</p><p>Dr.&nbsp;Ashwin Pananjady, H. Milton Stewart School of Industrial and Systems Engineering</p><p>Dr. Jinglong Zhao, Boston&nbsp;University</p><p>Dr. Christina Yu, Cornell University</p><p>&nbsp;</p><p><strong>Abstract:</strong></p><p>Networks often complicate decision-making and system evaluation due to interactions among interconnected nodes. This thesis addresses two significant problems associated with network effects:&nbsp;dynamic pricing in closed ride-sharing networks (Chapter 2) and estimating the total treatment effect (TTE) under network interference (Chapters 3 and 4).</p><p>&nbsp;</p><p>Chapter 2 proposes an approximate linear programming method to mitigate the curse of dimensionality&nbsp;in dynamic pricing. The developed approach provides a convex, tractable model for generating dynamic policies. Theoretical analysis demonstrates that this model produces tighter revenue upper bounds compared to traditional fluid approximation methods, with numerical experiments confirming its empirical effectiveness.</p><p>&nbsp;</p><p>Chapter 3 introduces a mixed randomization framework combining Bernoulli randomization and cluster-based randomization, extending conventional A/B testing methods. This mixed approach yields unbiased TTE estimates under specified conditions. Two methods are developed to implement the proposed design under both known and unknown interference settings, and asymptotic variance bounds for the estimators are derived.</p><p>&nbsp;</p><p>Chapter 4 investigates the pseudo-inverse estimator in scenarios where the interference network is imperfectly measured. The chapter quantifies the resulting bias, establishes a&nbsp;tighter variance bound relative to existing literature, proposes an enhanced variance estimator demonstrating superior performance, and introduces a novel methodology for detecting interference. The effectiveness of these approaches is validated through large-scale real-world experiments.</p><p>&nbsp;</p><p>&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Pricing and Causal Inference Under Networks]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Pricing and Causal Inference Under Networks</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2025-03-31T10:30:26-04:00]]></value>
      <value2><![CDATA[2025-03-31T12:00:00-04:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[ZOOM]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
