BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Logit network pricing
DTSTART:20141119T110000
DTEND:20141119T120000
DTSTAMP:20260407T020006Z
UID:cf93e48eb9d39c7d74d0b07dc7d27a34c723c989f8dc5af81eff166b
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Patrice Marcotte\, Department of computer science and op
 erations research of the University of Montreal\nWe consider the problem o
 f setting profit-maximizing tolls on a subset of arcs of a multicommodity 
 transportation network. The case where users are assigned to cheapest path
 s\, which is naturally formulated as an NP-hard bilevel program\, has been
  extensively studied and will serve as the background for an extension whe
 re user assignment is performed according to a discrete choice model of th
 e logit family. Following a description of the model and its theoretical p
 roperties\, we develop an algorithmic framework for determining a near-opt
 imal solution of this nonconvex problem\, based on a variety of approximat
 ions involving mixed integer programs\, either linear or quadratic. Throug
 h a battery of tests performed on a variety of network topologies\, we rea
 ch the conclusion that very crude approximations (that scale well) perform
  surprisingly well.
LOCATION:GC B3 424 http://plan.epfl.ch/?lang=fr&room=gc+b3+424
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR