CREU Progress Report: Week of 11/14/17

Work Accomplished: This week, I spent most of my time considering a different aspect of the cache sharing problem that I hadn't taken much time to consider before. During our group meeting last week, we discussed the possibility of making approximations about cache strategy proofness. Previously, I had been operating on the assumption that only isolation guarantees and Pareto efficiency were viable properties to approximate. This new outlook on the problem has interesting implications.

Goals: My goals for this upcoming week are to continue working on proving the caching algorithm, and modifying it as need be. 

Outcomes: The experience I have had so far with working on the algorithmic part of this problem has been valuable. Most of my research experience thus far has been more heavily focused on implementation. I am making progress on this proof, and hope to have something concrete within the next few weeks.