DOS Optimization Seminar: Dylan Shepardson

Event Details
  • Date/Time:
    • Thursday April 3, 2008
      3:00 pm - 4:00 pm
  • Location: 226A in Groseclose Building
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    $0.00
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: DOS Optimization Seminar: Dylan Shepardson

Full Summary: This talk presents LP and IP formulations that are used to answer a small open question in voting theory.

Title: LP and IP formulations for an open question in voting theory.

Speaker:
Dylan Shepardson

This talk presents LP and IP formulations that are used to answer a small open question in voting theory. In a much studied election scheme, every voter arranges a set of candidates in order of preference. The outcome of the election is determined by comparing the fraction of the total voters preferring u to v, for each pair of candidates u and v. By treating the candidates as vertices and including a directed edge uv whenever candidate u is preferred to candidate v by a prespecified fraction p of the voters, every election outcome can be represented as a directed graph. It is relatively easy to show that every directed graph represents a possible election outcome for some p>

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
optimization
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 12, 2009 - 5:20pm
  • Last Updated: Oct 7, 2016 - 9:47pm