This talk will have two parts:
1. The complexities of simple problems
2. Ad selection & Decision bias

In this talk, we will overview some important and common problems that pop up in the day-to-day job when one works in tech or ad tech.
In the first part, we will look at various ways to solve a simple algorithmic problem using Python while balancing between space and time requirements. We will then also investigate its distributed solution under privacy constraints. As a result, we will end up with a complex solution to a very simple problem.
In the second half of the talk, we will go over the basic building blocks of an interactive system that displays ads to the users, talking through decision bias when considering click-through rate modeling.