Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Tuesday, February 27, 2018 2:00 pm - 2:00 pm EST (GMT -05:00)

Three Minute Thesis (3MT) Competition 2018 - Management Sciences Heat

The University wide competition starts with our department-level heat. We want Management Sciences to be well represented on the university stage!

The 3MT is a university-wide competition for research-based master’s thesis and doctoral students.  Competitors will have 1 slide and 3 minutes to explain their research to a non-specialist audience.

This year we will be running our own department-level heat on February 27, 2018 at 2:00 pm in CPH 4335 with prizes and a winner moving on to the university-wide competition.

Area of Research:

Information Systems

Committee Chair:

Stan Potapenko, Civil & Environmental Engineering

Examining Committee:

Stanko Dimitrov, Management Sciences (supervisor)

Fatih Erenay, Management Sciences

James Bookbinder, Management Sciences

Liping Fu, Civil & Environmental Engineering

Area of Research

Management of Technology

Committee Chair

Sagar Naik, Electrical & Computer Engineering

Examining Committee

Frank Safayeni, Management Sciences

Elizabeth Jewkes, Management Sciences

Robert Duimering, Management Sciences

Nada Basir, Conrad Centre - CBET
 

Consider a buyer participating in a repeated auction, such as those prevalent in display advertising. How would she test whether the auction is incentive compatible? To bid effectively, she is interested in whether the auction is single-shot incentive compatible—a pure second-price auction, with fixed reserve price, and also dynamically incentive compatible—her bids are not used to set future reserve prices. In this work we develop tests based on simple bid perturbations that a buyer can use to answer these questions, with a focus on dynamic incentive compatibility.

Accounting for the adverse impact of "non-average" events has become essential in many applications involving decision making under uncertainty. Its implementation through decision models, namely stochastic programs, requires careful measurement of risk that reflects one's concern about uncertain outcomes. Important theories such as convex risk measures outline conditions required for risk measurement but provide little guidance for cases not meeting the conditions. Unfortunately, such cases are more than common in real-life situations.

Tuesday, April 3, 2018 10:00 am - 10:00 am EDT (GMT -04:00)

PhD Defence | Tiffany Bayley: "Lot-Sizing of Several Multi-Product Families"

Abstract

Production planning problems and its variants are widely studied in operations management and optimization literature. One variation that has not garnered much attention is the presence of multiple production families in a coordinated and capacitated lot-sizing setting. While its single-family counterpart has been the subject of many advances in formulations and solution techniques, the latest published research on multiple family problems was over 25 years ago (Erenguc and Mercan, 1990; Mercan and Erenguc, 1993).

Cutting and Packing problems are hard combinatorial optimization problems that arise in the context of several manufacturing and process industries or in their supply chains. These problems occur whenever a bigger object or space has to be divided into smaller objects or spaces, so that waste is minimized.

Tuesday, April 24, 2018 8:30 am - Wednesday, April 25, 2018 4:00 pm EDT (GMT -04:00)

ExpecTAtions Teaching Assistant Workshop

ExpecTAtions is a two-day workshop that prepares Waterloo Engineering students to undertake a teaching assistantship. To serve as a TA, you are required to complete the ExpecTAtions workshop. After full attendance and successful completion of all required activities you will receive a certificate noting your achievement.