The Drexel Computer Science Theory Reading Group is a group of graduate, undergraduate, and high school students led by Prof. Vasilis Gkatzelis. The topics covered during the reading group's weekly meetings focus on advanced material in algorithm design and analysis, and they range from textbook material to current research questions and open problems in theoretical computer science. We thank Kira Goldner for sharing the template for this homepage.

Date | Topic |
---|---|

Nov 19, 2021 | Dan Schoepflin continues on single-parameter forward auction settings and the design of deferred acceptance clock auctions |

Nov 12, 2021 | Dan Schoepflin on single-parameter forward auction settings and the design of deferred acceptance clock auctions |

Nov 05, 2021 | Steve Earth on "Fun with Lift and Ants: the mysteries of uncomputable functions" |

Oct 29, 2021 | Shahin Jabbari on "An Introduction to Algorithmic Fairness for Machine Learning" |

Oct 22, 2021 | Nick DeFilippis on Path Procument Auctions and Frugality |

Oct 15, 2021 | Xizhi Tan on Cooperative Model of Bargaining |

Oct 8, 2021 | John Bonnes continues on Latin Squares |

Oct 1, 2021 | John Bonnes on Latin Squares |

May 28, 2021 | John Bonnes on Combinatorial Game Theory, Minimax, and Alpha-Beta Pruning |

May 21, 2021 | Vasilis Gkatzelis on Orthogonal Range Searching |

May 14, 2021 | Guest Presentation: Daniel Halpern on "Fair Division with Partial Information" |

May 7, 2021 | Shahin Jabbari on "Hierarchical Policy Making Using a Game Theoretic Approach" |

April 30, 2021 | Xizhi Tan on Online Algorithms and The List Accessing Problem |

April 16, 2021 | Mathilda Nguyen on Introduction to Multi-armed Bandits |

April 9, 2021 | Vasilis Gkatzelis on Introduction to Computational Geometry and Finding the Convex Hull |

April 2, 2021 | Dan Schoepflin on Budget Feasible Auctions |

March 19, 2021 | Dan Schoepflin on Minimizing and Maximizing Submodular Functions Continued |

March 12, 2021 | Dan Schoepflin on Minimizing and Maximizing Submodular Functions |

March 5, 2021 | Manolis Pountourakis on Algorithmic Game Theory and the Energy Grid |

November 20, 2020 | Manolis Pountourakis on Risk Aversion/Seeking Models for Agent Behavior in Mechanism Design |

October 30, 2020 | Guest Presentation: Alex Psomas on "Theory and Practice of Fair Resource Allocation" |

October 23, 2020 | Incentives in Fair Division |

October 9, 2020 | Dan Schoepflin on Allocating Homogeneous Divisible Resources |

October 2, 2020 | Cassie Buhler on "Portfolio Optimization" |

September 25, 2020 | Pranav Garimidi on "Achieving Propotionality up to the Maximin Item with Indivisible Goods" |

September 11, 2020 | Guest Presentation: Aris Filos-Ratsikas on "The Distortion of Distributed Voting and Facility Location" |

August 28, 2020 | Cake Cutting |

August 21, 2020 | Guest Presentation: Curtis Bechtel on "Efficient Delegation without Payments" |

August 7, 2020 | Guest Presentation: Orestis Papadigenopoulos on "Single Sample Prophet Inequalities" |

July 31, 2020 | Xizhi Tan on Budget-feasible Auctions |

July 24, 2020 | Guest Presentation: Hadi Elzayn on "Differentially Private Call Auctions and Market Impact" |

July 17, 2020 | Dan Schoepflin on Bayesian Clock Auctions |

June 26, 2020 | Guest Presentation: Mohamad Latifian on "Resource-Aware Protocols for Network Cost-Sharing Games" |

May 29, 2020 | Guest Presentation: David Zeng on "Fairness-Efficiency Tradeoffs in Dynamic Fair Division" |

May 22, 2020 | Manolis Pountourakis on Repeated Sales with Multiple Strategic Buyers continued |

May 15, 2020 | Manolis Pountourakis on Repeated Sales with Multiple Strategic Buyers |

May 8, 2020 | Vasilis Gkatzelis on Resolving the Optimal Metric Distortion Conjecture |

May 1, 2020 | Safa Aman on Money Burning and Residual Surplus Maximization |

April 24, 2020 | Xizhi Tan on Dynamic Fair Division of Divisible Items |

April 17, 2020 | Daniel Schoepflin on Online Contention Resolution Schemes |

April 10, 2020 | Daniel Schoepflin on Online Matching and Bayesian Online Selection |

February 21, 2020 | Manolis Pountourakis on Algorithmic Delegation |

February 14, 2020 | Vasilis Gkatzelis on Offline and Online Fair Division of Divisible Goods |

January 31, 2020 | Guest Presentation: Sam Taggart on "Revenue Covering and Price of Anarchy" |

November 22, 2019 | Manolis Pountourakis on The Pandora's Box Problem |

November 15, 2019 | Manolis Pountourakis on Prophet Inequalities |

November 8, 2019 | Manolis Pountourakis on The Secretary Problem and Introduction to Prophet Inequalities |

November 1, 2019 | Introduction to the Secretary Problem |

October 18, 2019 | Maximum Weight Matching in Bipartite Graphs and the K�nig-Egev�ry theorem |

October 11, 2019 | Maximum Cardinality Matching in Bipartite Graphs |

June 7, 2019 | Peter Gagliardi on "An Exploration of Fractals and Tilings" |

May 31, 2019 | Curtis Bechtel on "Lower Bounds for Running Time of Certain Problems" |

May 24, 2019 | Dan Schoepflin on "The Performance of Ascending and Descending Clock Auctions" |

May 17, 2019 | Marius Garbea on "Algorithms for Easy and Hard Variants of Interval Scheduling" |

May 10, 2019 | Pranav Garimidi on "Fair Allocation of Indivisible Goods" |

May 3, 2019 | The Dinitz Problem continued |

April 26, 2019 | The Dinitz Problem and Graph Coloring |

April 19, 2019 | Bailey Flanigan on "Budget-Feasible Mechanisms" |

April 12, 2019 | Set Cover and Uncapacitated Facility Location (upper and lower bounds) |

April 5, 2019 | Set Cover and Uncapacitated Facility Location (greedy algorithm and reduction) |

March 22, 2019 | Dan Schoepflin on "Money-Free Truthful Scheduling Mechanisms" continued |

March 15, 2019 | Dan Schoepflin on "Money-Free Truthful Scheduling Mechanisms" |

March 8, 2019 | Guest Presentation: Emmanouil Pountourakis on "Algorithmic Delegation" |

March 1, 2019 | Combinatorial Arguments and Metric Steiner Tree |

February 22, 2019 | Spanning Trees and Cayley's Formula |

December 7, 2018 | Traveling Salesperson II and Steiner Tree |

November 30, 2018 | Traveling Salesperson I |

November 16, 2018 | Scheduling Algorithms |

November 9, 2018 | Makespan Minimization |

November 2, 2018 | K-center Problem II and reductions |

October 26, 2018 | K-center Problem I |

October 19, 2018 | Vertex Cover - Linear Programming |

October 12, 2018 | Vertex Cover - Greedy |

October 5, 2018 | Vertex Cover - Optimal algorithms for classes of graphs |

September 28, 2018 | Overview of topics |

September 14, 2018 | Introduction to linear programming II |

September 7, 2018 | Introduction to linear programming I |

August 31, 2018 | Introduction to dynamic programming III |

August 24, 2018 | Introduction to dynamic programming II |

August 17, 2018 | Knapsack and introduction to dynamic programming I |

August 10, 2018 | Introduction to optimization problems and knapsack |