Optimization and Incentives Seminar


2007-10-10 14:00: Incentivizing Participation in Resource-sharing Networks (Richard Weber (Cambridge))

2007-10-31 14:00: Optmisation and Evolution of Networks (Peter Whittle (Cambridge))

2007-11-07 14:00: Wireless Spectral Sharing Techniques and Issues (Fletcher Wicker (The Aerospace Corporation / Cambridge))

2007-11-14 14:00: Positive Externalities, Negative Externalities, and Optimal Scale (Ramesh Johari (Stanford))

2007-11-21 14:00: Random Medium Access Control algorithms, an asymptotic approach (Alexandre Proutiere (Microsoft))

2007-11-21 15:30: Differential equations arrising in network problems (N Vvedenskaya (Institute for Information Transmission Problems, Moscow))

2007-11-28 14:00: Title to be confirmed (Gaurav Raina)

2008-09-12 16:00: Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol (Martin Suchara, Computer Science Department, Princeton)

2008-10-16 16:00: Consensus -- with Limited Memory and Signalling (Milan Vojnovic, Microsoft research Cambridge)

2008-10-29 16:00: Optimal Gateway Selection in VoIP (Richard Weber, University of Cambridge)

2008-11-03 14:00: Fair charge heuristics for dynamic resource allocation --- a queueing example (David Hodge, Lancaster University)

2008-11-19 16:00: Is the law of the jungle sustainable for the Internet? (Alexandre Proutiere, Microsoft Research Cambridge)

2008-11-26 14:00: Internet evolution and misleading networking myths (Andrew Odlyzko, University of Minnesota)

2008-12-04 14:00: Distributed Computation over Random Geometric Graphs: Some Asymptotic Results (D. Manjunath, Department of Electrical Engineering of IIT, Bombay)

2009-01-14 16:00: Exploring the dynamics of network optimisation (Nigel Walker, Ben Strulo, British Telecomm)

2009-01-21 16:00: Probabilistic refinement of cellular pathway models. (Florian Markowetz, Cancer Research UK Cambridge Research Institute)

2009-01-28 16:00: A Scaling Framework for the Many Flows Asymptotic, through Large Deviations. (James Cruise, Bristol University.)

2009-02-06 16:00: Nonparametric inference for networks of queues (Cornelia Wichelhaus, Heidelberg university, Germany.)

2009-02-11 16:00: Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy (Bozidar Radunovic, Microsoft Research Cambridge.)

2009-02-18 16:00: The diffusion of trends on social networks. (Moez Draief, Imperial College London)

2009-02-23 17:00: Bloom Filters, Related Data Structures, and their Applications (Michael Mitzenmacher (Harvard))

2009-02-24 14:00: A Survey of Results for Deletion Channels and Related Synchronization Channels (Michael Mitzenmacher, Harvard University)

2009-02-27 14:00: Convolution tail equivalent distributions: basic properties (Prof Dmitri Korshunov, (Novosibirsk))

2009-03-04 16:00: Stochastic Models of Economic Equilibrium on Directed Graphs (Prof. Michael Dempster, University of Cambridge, Judge Business School and Statistical Laboratory)

2009-03-11 16:00: Product forms in Neural Networks, G-Networks and Chemical Systems (Erol Gelenbe, Imperial College & Microsoft Research)

2009-03-18 16:00: An Incentive Mechanism to Decongest Road Traffic (Balaji Prabhakar, Stanford University, Departments of Electrical Engineering and Computer Science.)

2009-05-06 14:00: Robust Networks (Sanjeev Goyal, Department of Economics, University of Cambridge)

2009-05-13 16:00: Crowdsourcing and All-Pay Auctions (Milan Vojnovic, Microsoft research Cambridge.)

2009-05-20 16:00: Routing Games with Elastic Traffic (Peter Key, Microsoft Research Cambridge.)

2009-05-26 14:00: Optimal Control of Manufacturing Systems (Gideon Weiss, The University of Haifa.)

2009-05-27 16:00: Large clusters as rare events, their simulation and connection to critical percolation (Andrei Bejan, Computer Laboratory.)

2009-06-03 15:00: Connectivity Properties of Cooperative Wireless Ad Hoc Networks (Don Towsley, University of Massachusetts Amherst and Microsoft Research Cambridge)

2009-06-11 17:00: The Flow of Information in Complex Networks (Jon Kleinberg (Cornell).)

2009-06-24 16:00: Network-Based Ranking Systems in Paired Comparisons. (Dr Juyong Park, Seoul National University.)

2009-08-12 16:00: Pricing, Competition, and Routing in Relay Networks (Edmund Yeh, Electrical Engineering, Yale University.)

2009-10-12 14:30: Busy Periods in Fluid Queues with Multiple Emptying Input States (Prof. Peter Harrison, Imperial College London.)

2009-10-26 14:30: Bits and particles: Spin-glass analogies and beyond (Adria Tauste, University of Cambridge, Department of Engineering.)

2009-11-02 14:30: Insensitivity results for the limit of a multi-class queueing network (Neil Walton, University of Cambridge, Statistical Laboratory.)

2009-11-09 14:30: Dynamics, Robustness and Multiscale Modularity of Complex Networks (Renaud Lambiotte, Institute for Mathematical Sciences, Imperial College London.)

2009-11-16 14:30: Temporal analysis and small world properties  of social and technological networks. (Cecillia Mascolo, University of Cambridge, Computer Laboratory.)

2009-11-23 14:30: A Bayesian nonrandom walk through the world of the queues (Carmen Armero, University of Valencia)

2010-01-18 15:00: Anonymity via networks of mixes (Venkat Anantharam, EECS Department, University of California Berkeley.)

2010-01-25 15:00: Diffusion and cascading behavior in random networks (Marc LeLarge, École Normale Supérieure, Paris.)

2010-02-01 15:00: Title: Ergodicity of a stress release point process seismic model with aftershocks (Prof. Seguei Foss, Maxwell Institute for Mathematical Sciences, Heriot-Watt.)

2010-02-02 16:30: Collision of random walks (Perla Sousi, Statistical Laboratory, University of Cambridge.)

2010-02-04 15:00: Queuing systems with multi-type jobs and multi-type servers (Prof. Gideon Weiss, University Haifa)

2010-02-22 15:00: Simulation-based computation of the workload correlation function in a Levy-driven queue (Michel Mandjes, Universiteit van Amsterdam and Eurandom, Eindhoven)

2010-03-01 15:00: A Martingale Framework for Trust (Bruce Hajek, University of Illinois Urbana-Champaign)

2010-03-04 15:00: Associative neural memories and oscillatory operation (Peter Whittle, Univerisity of Cambridge)

2010-03-08 15:00: Identifying separated time scales in stochastic models of reaction networks (Thomas Kurtz, University of Wisconsin - Madison)

2010-03-15 15:00: Martingale calculus and a maximal inequality for supermartingales (Hajek, B (Illinois))

2010-03-17 15:00: On Bayes-Nash implementation of combinatorial auctions: structure and efficiency (Hajek, B (Illinois))

2010-04-26 14:00: Transport that Waits for You: Planning and Operating Personal Rapid Transit Systems (John Lees-Miller (University of Bristol))

2010-04-26 15:00: An investigation of proportionally fair ramp metering (R. J. Gibbens, Computer Laboratory, University of Cambridge)

2010-05-19 14:15: Statistical problems in complex networks (Edoardo Airoldi - Harvard University, USA)

2010-05-20 16:00: Order-theoretic properties of the Skorokhod reflection mapping. (Takis Konstantopoulos, Heriot-Watt)

2010-06-01 16:00: Load Balancing via Random Local Search in Closed and Open systems (Sarah Lilienthal, Statistical Laboratory, University of Cambridge)

2010-08-02 14:15: Some Uses of Hashing in Networking Problems (Michael Mitzenmacher, Harvard University)

2010-08-03 11:00: Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank (Michael Mitzenmacher, Harvard University)

2010-08-20 14:00: Insensitive, maximum stable allocations converge to proportional fairness (Neil Walton, Statistical Laboratory, University of Cambridge.)

2010-09-09 14:00: Queues, Counters and Optimization (R. Srikant, University of Illinois at Urbana-Champaign)

2010-10-18 14:30: The Weighted Proportional Resource Allocation (Milan Vojnovic, Microsoft research Cambridge)

2010-10-25 14:30: Queues with skill based routing under FCFS - ALIS (Assign Longest Idle Server) regime (Gideon Weiss, The University of Haifa)

2010-11-01 14:30: Insensitive, maximum stable allocations converge to proportional fairness (Neil Walton (University of Cambridge, Statistical Laboratory.))

2010-11-22 14:30: Load balancing in stochastic networks (Elena Yudovina ( DPMMS))

2011-02-07 14:30: Mobile geometric graphs: detection, coverage and percolation (Perla Sousi ( Statistical Laboratory, University of Cambridge.))

2011-02-28 14:30: Large-scale asymptotics in some queueing models (Yuriy Suhov (Statslab))

2011-03-07 14:30: Stability conditions for some random multiple-access protocols with spatial interactions (Seva Shneer, Heriot-Watt University)

2011-03-14 14:30: Matchings on large diluted graphs : The cavity method at positive temperature. (Charles Bordenave, Université de Toulouse)

2011-05-02 14:30: Viral Processes by Random Walks on Random Graphs (Mohammed Abdullah, KCL)

2011-05-16 14:30: Behavioral Network Formation (Michael Kearns (University of Pennsylvania))

2011-05-30 14:30: Media landscape in Twitter: A world of new conventions and political diversity (Jisun An (Computer Lab, University of Cambridge))

2011-06-06 14:30: Efficient entropy-based detection of change-points in streaming data (James Cruise (Heriot-Watt University))

2011-07-11 14:30: Control of Stochastic Processing Networks (R. J. Williams (Department of Mathematics, University of California, San Diego))

2011-11-22 16:30: Algorithmic Barriers from Phase Transitions (Dimitris Achlioptas (University of Athens & RACTI))

2011-11-24 16:00: Experiments with dynamic networks of virtual routers (Richard G. Clegg (UCL))

2012-05-07 15:00: Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs (Oliver Friedmann (LMU Munich))

2012-05-14 15:00: Analytic Results on a Decentralized Combinatorial Auction (Richard Steinberg (LSE))

2012-05-21 15:00: Managing Air Traffic Disruptions Through Strategic Prioritization (Ian Kash (MSR Cambridge))

2012-06-11 15:00: Searching for Multiple Hidden Objects (Thomas Lidbetter (LSE))

2012-06-11 16:30: Simple Dynamics in Large Games (R. Ramanujam (Institute of Mathematical Sciences, Chennai))

2012-06-18 15:00: Valuation Compressions in Combinatorial Auctions (Paul Dütting (EPFL))

2012-10-15 15:00: Prioritising Diversity in School Choice (Aytek Erdil (University of Cambridge))

2012-10-22 15:00: Robust and Frugal Mechanisms for Hiring a Team (Mahyar Salek (MSR Cambridge))

2012-10-29 15:00: Adversarial Option Pricing: How Robust is Black-Scholes? (Rafael M. Frongillo (Berkeley))

2012-11-05 15:00: A Theoretical Analysis of Crowdsourced Content Curation  (Greg Stoddard (Northwestern))

2012-11-12 15:00: On the Tradeoff between Economic Efficiency and Strategyproofness in Randomized Social Choice (Markus Brill (TU Munich))

2012-11-19 15:00: Pathways to Equilibria, Pretty Pictures and Diagrams (PPAD) (Bernhard von Stengel (LSE))

2012-11-26 15:00: General Truthfulness Characterizations Via Convex Analysis (Ian Kash (MSR Cambridge))

2013-01-29 15:00: Intermediated Exchange: Theory and Experiments (Sanjeev Goyal (University of Cambridge))

2013-02-04 15:00: Local Optimality in Algebraic Path Problems (Timothy Griffin (University of Cambridge))

2013-02-11 15:00: Strongly polynomial algorithm for a class of nonlinear minimum-cost flow problems (László Végh (LSE))

2013-02-18 15:00: Pareto Optimality in Coalition Formation (Paul Harrenstein (University of Oxford))

2013-11-18 15:00: Competition for resources - The equilibrium existence problem in congestion games (Max Klimm (TU Berlin))

2014-01-28 14:00: Quantitative Comparative Statics (Tobias Harks (Maastricht University))

2014-02-04 14:00: Welfare and Fairness in Dominant-Strategy Mechanisms (Victor Naroditskiy (University of Southampton))

2014-02-11 14:00: A More General Pandora Rule? (Richard Weber (University of Cambridge))

2014-02-18 14:00: Expanding Search on Networks (Steve Alpern (University of Warwick))

2014-02-25 14:00: In Defense of Simplex’ Worst-Case Behavior (Yann Disser (TU Berlin))

2014-03-04 14:00: Optimal Consistent Segregation (Herve Moulin (University of Glasgow))

2014-05-20 14:00: The BRAVO Effect in Queues (Yoni Nazarathy (University of Queensland))

2014-07-03 15:00: Modeling Crowdsourcing Systems: Design and Analysis of Incentive and Reputation Systems (John C.S. Lui (The Chinese University of Hong Kong))

2014-10-21 14:00: Current Practice in Combinatorial Auctions for Radio Spectrum (Robert Leese (Smith Institute))

2014-10-28 14:00: A Framework for Decentralised Combinatorial Auctions with Applications to Subadditive Bidders (Richard Steinberg (LSE))

2014-11-11 14:00: Elicitation for Aggregation (Ian Kash (MSR Cambridge))

2014-11-18 14:00: Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Paul Dütting (LSE))

2014-11-25 14:00: Efficient Advert Assignment (Peter Key (MSR Cambridge))

2015-01-21 14:00: Skill based parallel servers under FCFS-ALIS and infinite bipartite matching (Gideon Weiss (University of Haifa))

2015-02-03 14:00: Approximation in Stochastic Scheduling (Nicole Megow (TU Berlin))

2015-05-26 14:00: Random Walk in a Queueing-Network Environment and Related Problems (Yuri Suhov (Pennsylvania State University and Statslab))

2015-06-08 15:15: Incentive Mechanisms for User-Provided Networks (Jianwei Huang (Chinese University of Hong Kong))

2015-06-09 14:00: A Markov model of a limit order book: thresholds, recurrence, and trading strategies (Frank Kelly (University of Cambridge))