This commit is contained in:
22
slides.tex
22
slides.tex
@@ -4,6 +4,15 @@
|
||||
\usepackage{algo}
|
||||
\usepackage{soul}
|
||||
% \usepackage{cancel}
|
||||
\newcommand{\munepsfig}[3][scale=1.0]{% <===============================
|
||||
\begin{figure}[!htbp]
|
||||
\centering
|
||||
\vspace{2mm}
|
||||
\setlength{\fboxrule}{#3} % <===================================
|
||||
\framebox{\includegraphics[#1]{#2.png}} % <=====================
|
||||
\label{fig:#2}
|
||||
\end{figure}
|
||||
}
|
||||
|
||||
\title[Incentive allocation]{Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints}
|
||||
\date{August 30, 2025}
|
||||
@@ -28,8 +37,9 @@ A ride sharing company wants to send riders promotional coupons in the hope of m
|
||||
|
||||
% each agent gets at most 1 coupon.
|
||||
\begin{figure}
|
||||
placeholder\\
|
||||
\includegraphics[width=.5\textwidth]{image/landscape.png}
|
||||
\includegraphics[width=.7\textwidth]{image/chatgpt.png}
|
||||
|
||||
\scriptsize Image courtesy: ChatGPT-5
|
||||
\end{figure}
|
||||
|
||||
\end{frame}
|
||||
@@ -88,6 +98,12 @@ $k=O(mp^{1/3})$ and $\tau$ can be computed in $O((k+m)\log m)$ time.
|
||||
\end{frame}
|
||||
|
||||
\begin{frame}[plain]
|
||||
poster
|
||||
\centering
|
||||
\Large \textit{Let's discuss this in detail at my poster!}
|
||||
|
||||
\munepsfig[width=.8\linewidth]{image/poster}{1pt}
|
||||
% \begin{figure}
|
||||
% \includegraphics[width=0.8\linewidth]{image/poster.png}
|
||||
% \end{figure}
|
||||
\end{frame}
|
||||
\end{document}
|
Reference in New Issue
Block a user