Topics in Data Mining Fall Bruno Ribeiro
|
|
- Melina Reynolds
- 5 years ago
- Views:
Transcription
1 Network Utility Maximization Topics in Data Mining Fall 2015 Bruno Ribeiro 2015 Bruno Ribeiro
2 Data Mining for Smar t Cities Need congestion control 2
3 Supply and Demand (A Dating Website [China]) Males Females Need congestion control 3
4 Internet Need congestion control 4
5 Internet = Largest Optimization Problem in History } Internet Congestion Control Optimization Largest Optimization Problem in History Daily nearly 9 billion computers join the computation 2015 Bruno Ribeiro 5
6 Markets } Markets defined by Google Amazon Yahoo! Ebay } Massive computational power available for running these markets } Important to find good models and algorithms for these markets 6
7 Internet Resource Allocation } network: links {l}, capacities {c l } } sources S: (L(s), U s (x s )), s S L(s) - links used by source s U s (x s ) utility, strictly concave function of source rate x s U s (x s ) x s User 1 U 1 x ( 1 ) User 0 U 0 ( x 0 ) c A User 2 c B U 2 ( x 2 ) 7
8 Frank Kelly s System Problem subject to 8
9 Online Dating Resource Allocation Max no. messages from user 1 (per day) Max messages to user 1 (per day) x 1 x 2 < c 1 x 2 x 1 + x 3 + α x 4 < c 2 x 3 (1-α) x 4 < c 3 x 4 0 < c 4 9
10 Optimization Problem system problem } maximize system utility (note: all sources equal) } constraint: bandwidth used less than capacity } centralized solution to optimization impractical must know all utility functions impractical for large number of sources we ll see: congestion control as distributed asynchronous algorithms to solve this problem 10
11 Issues } will users truthfully reveal their utility functions? } if not, can we design a pricing scheme (mechanism) to induce truth-telling? } is there a distributed algorithm to compute the prices? } what are good choices for utilities? } fairness among users? 11
12 Max-min Fairness rates {x r } are max-min fair if for any other feasible rates {y r }, if y s > x s, then p, such that x p x s and y p < x p What is corresponding utility function? U r ( x r ) = lim α 1 1 α xr α 12
13 Propor tional fairness } rates {x r } are proportionally fair if for any feasible {y r }, } corresponds to U r (x r ) = log x r } weighted proportional fairness if U r (x r ) = w r log x r 13
14 Primal-Dual Problem Primal: minimize s.t. and Dual: mazimize s.t. and 14
15 The Duality Theorem (Gale, Kuhn, Tucker 1951) } The primal has an optimal solution iff the dual has an optimal solution } The objective functions of optimal solutions are equivalent 15
16 Distributed algorithm Optimization problem decouples into (Kelly): greedy optimization problem for every session max U r (x r ) q r x r price q r given by network as function of rates, q r = p l where p l is (shadow) price for link l provides solution to system problem 16
17 Computing Source Rates 17
18 Remove constraints: Primal approach } Consider following problem } g l (y) penalty function g l (y) non decreasing, convex and f l (y) = dg l (y)/dy g l (y) as y 18
19 19
20 } p l (t) price of link l at time t } optimization problem decouples into: greedy optimization problem for every session price q s given by network as function of rates 20
21 Controller design } algorithm to maximize h(x) } progressively change x st h(x(t+δ)) > h(x(t)) by choosing direction of maximum ascent } 1-D x(t+δ) = x(t) + k(t) δ dh/dx } as δ 0, described by x! = k( t) dh dx 21
22 Source Algorithm } source needs only its path price: x! ( xr )( Ur '( xr ) qr ) } k r () nonnegative nondecreasing function r = k r } above algorithm converges to unique solution for any initial condition } can show convergence using Lyapunov functions } example: q r loss/marking probability 22
23 Pricing } can network choose pricing scheme to achieve fair resource allocation? } suppose network charges price q r ($/message) where q r = p l } user s strategy: spend w r ($/sec.) to maximize 23
24 Optimal User Strategy } equivalently, 24
25 Distributed Computation } with optimal choice of w r controller becomes } we have already seen that this solves 25
26 Price Takers vs. Strategic Users } Kelly Mechanism: users are price takers, i.e., user does not know the impact of its action on the price } strategic users: 26
27 Efficiency and Competition } price takers: selfish users can maximize social welfare } strategic users: competition leads to loss of efficiency, i.e., social welfare is not maximized 27
28 Proportionally-Fair Controller If utility function is then a controller that implements it is given by 28
29 Price functions Mark packet when queue length above threshold B } example - M/M/1 queue < = = l l l l B l l l l l c y, c y, ) c / y ( ) y ( f p 1 Or mark them earlier 29
30 Price functions Drop packets when queue is full } example - M/M/1 queue Probability of loss where ρ = y l / c l for large B, 1 ρ 1 ρ B+1 ρ B p l = f l ( y l ) = ( y l c y l l ) + 30
Resource Allocation and Pricing. R. Srikant University of Illinois
Resource Allocation and Pricing R. Srikant University of Illinois References The Mathematics of Internet Congestion Control, Birkhauser, 2004. Pricing: Kelly Distributed Resource Allocation: Kelly, Mauloo
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
More informationEfficient Mechanism Design
Efficient Mechanism Design Bandwidth Allocation in Computer Network Presenter: Hao MA Game Theory Course Presentation April 1st, 2014 Efficient Mechanism Design Efficient Mechanism Design focus on the
More informationRate Control in Communication Networks
From Models to Algorithms Department of Computer Science & Engineering The Chinese University of Hong Kong February 29, 2008 Outline Preliminaries 1 Preliminaries Convex Optimization TCP Congestion Control
More informationNetwork Optimization and Control
Foundations and Trends R in Networking Vol. 2, No. 3 (2007) 271 379 c 2008 S. Shakkottai and R. Srikant DOI: 10.1561/1300000007 Network Optimization and Control Srinivas Shakkottai 1 and R. Srikant 2 1
More informationUtility, Fairness and Rate Allocation
Utility, Fairness and Rate Allocation Laila Daniel and Krishnan Narayanan 11th March 2013 Outline of the talk A rate allocation example Fairness criteria and their formulation as utilities Convex optimization
More informationCongestion Control. Topics
Congestion Control Topics Congestion control what & why? Current congestion control algorithms TCP and UDP Ideal congestion control Resource allocation Distributed algorithms Relation current algorithms
More informationCongestion Equilibrium for Differentiated Service Classes Richard T. B. Ma
Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma School of Computing National University of Singapore Allerton Conference 2011 Outline Characterize Congestion Equilibrium Modeling
More informationFairness and Optimal Stochastic Control for Heterogeneous Networks
λ 91 λ 93 Fairness and Optimal Stochastic Control for Heterogeneous Networks sensor network wired network wireless 9 8 7 6 5 λ 48 λ 42 4 3 0 1 2 λ n R n U n Michael J. Neely (USC) Eytan Modiano (MIT) Chih-Ping
More informationA Mechanism for Pricing Service Guarantees
A Mechanism for Pricing Service Guarantees Bruce Hajek Department of Electrical and Computer Engineering and the Coordinated Science Laboratory University of Illinois at Urbana-Champaign Sichao Yang Qualcomm
More informationFundamental Theorems of Welfare Economics
Fundamental Theorems of Welfare Economics Ram Singh Lecture 6 September 29, 2015 Ram Singh: (DSE) General Equilibrium Analysis September 29, 2015 1 / 14 First Fundamental Theorem The First Fundamental
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationAn event-triggered distributed primal-dual algorithm for Network Utility Maximization
An event-triggered distributed primal-dual algorithm for Network Utility Maximization Pu Wan and Michael D. Lemmon Abstract Many problems associated with networked systems can be formulated as network
More informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationThis Dissertation. entitled. Event-triggered distributed algorithms for network optimization. Pu Wan
This Dissertation entitled Event-triggered distributed algorithms for network optimization typeset with nddiss2ε v3.0 (2005/07/27) on November 30, 2009 for Pu Wan This L A TEX2ε classfile conforms to the
More informationFIN 550 Practice Exam Answers. A. Linear programs typically have interior solutions.
FIN 550 Practice Exam Answers Phil Dybvig. True-False 25 points A. Linear programs typically have interior solutions. False. Unless the objective is zero, all solutions are at the boundary. B. A local
More informationEfficiency Loss in a Network Resource Allocation Game
Efficiency Loss in a Network Resource Allocation Game Ashish Khisti October 27, 2004 Efficiency Loss in a Network Resource Allocation Game p. 1/2 Resource Allocation in Networks Basic Question: How should
More informationPrice Competition with Elastic Traffic
Price Competition with Elastic Traffic Asuman Ozdaglar Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology August 7, 2006 Abstract In this paper, we present
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationFirms and returns to scale -1- Firms and returns to scale
Firms and returns to scale -1- Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Constant returns to scale 19 C. The CRS economy 25 D. pplication to trade 47 E. Decreasing
More informationCongestion Control In The Internet Part 1: Theory. JY Le Boudec 2018
Congestion Control In The Internet Part 1: Theory JY Le Boudec 2018 1 Contents 1. What is the problem; congestion collapse 2. Efficiency versus Fairness 3. Definitions of fairness 4. Additive Increase
More informationFirms and returns to scale -1- John Riley
Firms and returns to scale -1- John Riley Firms and returns to scale. Increasing returns to scale and monopoly pricing 2. Natural monopoly 1 C. Constant returns to scale 21 D. The CRS economy 26 E. pplication
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More informationLagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark
Lagrangian Duality Richard Lusby Department of Management Engineering Technical University of Denmark Today s Topics (jg Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality R Lusby (42111) Lagrangian
More informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The so-called Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
More informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The so-called Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
More informationCharging and rate control for elastic traffic
Charging and rate control for elastic traffic Frank Kelly University of Cambridge Abstract This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic
More informationA three-level MILP model for generation and transmission expansion planning
A three-level MILP model for generation and transmission expansion planning David Pozo Cámara (UCLM) Enzo E. Sauma Santís (PUC) Javier Contreras Sanz (UCLM) Contents 1. Introduction 2. Aims and contributions
More informationEfficiency and Braess Paradox under Pricing
Efficiency and Braess Paradox under Pricing Asuman Ozdaglar Joint work with Xin Huang, [EECS, MIT], Daron Acemoglu [Economics, MIT] October, 2004 Electrical Engineering and Computer Science Dept. Massachusetts
More informationMarket Equilibrium using Auctions for a Class of Gross-Substitute Utilities
Market Equilibrium using Auctions for a Class of Gross-Substitute Utilities Rahul Garg 1 and Sanjiv Kapoor 2 1 IBM T.J. Watson Research Center,USA. 2 Illinois Institute of Technology, Chicago, USA Abstract.
More informationSharing LRU Cache Resources among Content Providers: A Utility-Based Approach
Sharing LRU Cache Resources among Content Providers: A Utility-Based Approach Mostafa Dehghan 1, Weibo Chu 2, Philippe Nain 3, Don Towsley 1 1 University of Massachusetts, Amherst, USA 2 Northwestern Polytechnical
More informationStrategic Properties of Heterogeneous Serial Cost Sharing
Strategic Properties of Heterogeneous Serial Cost Sharing Eric J. Friedman Department of Economics, Rutgers University New Brunswick, NJ 08903. January 27, 2000 Abstract We show that serial cost sharing
More informationUtility Maximization for Communication Networks with Multi-path Routing
Utility Maximization for Communication Networks with Multi-path Routing Xiaojun Lin and Ness B. Shroff School of Electrical and Computer Engineering Purdue University, West Lafayette, IN 47906 {linx,shroff}@ecn.purdue.edu
More informationMarket Equilibrium and the Core
Market Equilibrium and the Core Ram Singh Lecture 3-4 September 22/25, 2017 Ram Singh (DSE) Market Equilibrium September 22/25, 2017 1 / 19 Market Exchange: Basics Let us introduce price in our pure exchange
More informationNonlinear Optimization: What s important?
Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global
More information4 Lecture Applications
4 Lecture 4 4.1 Applications We now will look at some of the applications of the convex analysis we have learned. First, we shall us a separation theorem to prove the second fundamental theorem of welfare
More informationWelfare Maximization with Production Costs: A Primal Dual Approach
Welfare Maximization with Production Costs: A Primal Dual Approach Zhiyi Huang Anthony Kim The University of Hong Kong Stanford University January 4, 2015 Zhiyi Huang, Anthony Kim Welfare Maximization
More informationJavier Contreras Sanz- Universidad de Castilla-La Mancha Jesús María López Lezama- Universidad de Antioquia Antonio Padilha-Feltrin- Universidade
Javier Contreras Sanz- Universidad de Castilla-La Mancha Jesús María López Lezama- Universidad de Antioquia Antonio Padilha-Feltrin- Universidade Estadual Paulista Jose Ignacio Muñoz-Universidad de Castilla-La
More informationA SIMPLE PARALLEL ALGORITHM WITH AN O(1/T ) CONVERGENCE RATE FOR GENERAL CONVEX PROGRAMS
A SIMPLE PARALLEL ALGORITHM WITH AN O(/T ) CONVERGENCE RATE FOR GENERAL CONVEX PROGRAMS HAO YU AND MICHAEL J. NEELY Abstract. This paper considers convex programs with a general (possibly non-differentiable)
More informationDistributed Approaches for Proportional and Max-Min Fairness in Random Access Ad Hoc Networks
Distributed Approaches for Proportional and Max-Min Fairness in Random Access Ad Hoc Networks Xin Wang, Koushik Kar Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute,
More informationWorked Examples for Chapter 5
Worked Examples for Chapter 5 Example for Section 5.2 Construct the primal-dual table and the dual problem for the following linear programming model fitting our standard form. Maximize Z = 5 x 1 + 4 x
More informationSeeking Foschini s Genie: Optimal Rates and Powers in Wireless Networks
1 Seeking Foschini s Genie: Optimal Rates and Powers in Wireless Networks Dan ONeill, David Julian, and Stephen Boyd Department of Electrical Engineering Stanford University dconeill,djulian,boyd@stanford.edu
More informationPart IB Optimisation
Part IB Optimisation Theorems Based on lectures by F. A. Fischer Notes taken by Dexter Chua Easter 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationToday: Linear Programming (con t.)
Today: Linear Programming (con t.) COSC 581, Algorithms April 10, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 29.4 Reading assignment for
More informationNotes on General Equilibrium
Notes on General Equilibrium Alejandro Saporiti Alejandro Saporiti (Copyright) General Equilibrium 1 / 42 General equilibrium Reference: Jehle and Reny, Advanced Microeconomic Theory, 3rd ed., Pearson
More informationInternet Congestion Control: Equilibrium and Dynamics
Internet Congestion Control: Equilibrium and Dynamics A. Kevin Tang Cornell University ISS Seminar, Princeton University, February 21, 2008 Networks and Corresponding Theories Power networks (Maxwell Theory)
More informationFlow Control, Routing, and Performance with a For-profit Service Provider
November 2004 Flow Control, Routing, and Performance with a For-profit Service Provider by Daron Acemoglu 1 and Asuman Ozdaglar 2 Abstract We consider a game theoretic framework to analyze traffic in a
More information384Y Project June 5, Stability of Congestion Control Algorithms Using Control Theory with an application to XCP
384Y Project June 5, 00 Stability of Congestion Control Algorithms Using Control Theory with an application to XCP . Introduction During recent years, a lot of work has been done towards the theoretical
More informationFairness Considerations in Network Flow Problems
2015 IEEE 54th Annual Conference on Decision and Control (CDC) December 15-18, 2015. Osaka, Japan Fairness Considerations in Network Flow Problems Er Wei, Chaithanya Bandi Abstract In most of the physical
More informationEconomic Foundations of Symmetric Programming
Economic Foundations of Symmetric Programming QUIRINO PARIS University of California, Davis B 374309 CAMBRIDGE UNIVERSITY PRESS Foreword by Michael R. Caputo Preface page xv xvii 1 Introduction 1 Duality,
More informationAlgorithmic Game Theory. Alexander Skopalik
Algorithmic Game Theory Alexander Skopalik Today Course Mechanics & Overview Introduction into game theory and some examples Chapter 1: Selfish routing Alexander Skopalik Skopalik@mail.uni-paderborn.de
More informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More informationLINEAR PROGRAMMING II
LINEAR PROGRAMMING II LP duality strong duality theorem bonus proof of LP duality applications Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING II LP duality Strong duality
More informationLagrangian Duality. Evelien van der Hurk. DTU Management Engineering
Lagrangian Duality Evelien van der Hurk DTU Management Engineering Topics Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality 2 DTU Management Engineering 42111: Static and Dynamic Optimization
More informationTHE Internet is increasingly being used in the conduct of
94 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 1, FEBRUARY 2006 Global Stability Conditions for Rate Control With Arbitrary Communication Delays Priya Ranjan, Member, IEEE, Richard J. La, Member,
More informationUtility Maximization for Communication Networks with Multi-path Routing
Utility Maximization for Communication Networks with Multi-path Routing Xiaojun Lin and Ness B. Shroff Abstract In this paper, we study utility maximization problems for communication networks where each
More informationTariffs, Mechanisms and Equilibria at a Single Internet Link
Tariffs, Mechanisms and Equilibria at a Single Internet Link Costas Courcoubetis and Antonis Dimakis Department of Informatics Athens University of Economics and Business Patission 76, Athens 10434, Greece
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More informationNEW CONGESTION CONTROL SCHEMES OVER WIRELESS NETWORKS: STABILITY ANALYSIS. Minghua Chen Alessandro Abate Shankar Sastry
NEW CONGESTION CONTROL SCHEMES OVER WIRELESS NETWORKS: STABILITY ANALYSIS Minghua Chen Alessandro Abate Shankar Sastry Department of Electrical Engineering and Computer Science University of California
More informationSingular perturbation analysis of an additive increase multiplicative decrease control algorithm under time-varying buffering delays.
Singular perturbation analysis of an additive increase multiplicative decrease control algorithm under time-varying buffering delays. V. Guffens 1 and G. Bastin 2 Intelligent Systems and Networks Research
More information9. Dual decomposition and dual algorithms
EE 546, Univ of Washington, Spring 2016 9. Dual decomposition and dual algorithms dual gradient ascent example: network rate control dual decomposition and the proximal gradient method examples with simple
More informationIntroduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following
More informationWireless Network Pricing Chapter 6: Oligopoly Pricing
Wireless Network Pricing Chapter 6: Oligopoly Pricing Jianwei Huang & Lin Gao Network Communications and Economics Lab (NCEL) Information Engineering Department The Chinese University of Hong Kong Huang
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationOptimization and Stability of TCP/IP with Delay-Sensitive Utility Functions
Optimization and Stability of TCP/IP with Delay-Sensitive Utility Functions Thesis by John Pongsajapan In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute
More informationKarush-Kuhn-Tucker Conditions. Lecturer: Ryan Tibshirani Convex Optimization /36-725
Karush-Kuhn-Tucker Conditions Lecturer: Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given a minimization problem Last time: duality min x subject to f(x) h i (x) 0, i = 1,... m l j (x) = 0, j =
More informationAlternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications
Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization
More informationThe Multi-Path Utility Maximization Problem
The Multi-Path Utility Maximization Problem Xiaojun Lin and Ness B. Shroff School of Electrical and Computer Engineering Purdue University, West Lafayette, IN 47906 {linx,shroff}@ecn.purdue.edu Abstract
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Instructor: Moritz Hardt Email: hardt+ee227c@berkeley.edu Graduate Instructor: Max Simchowitz Email: msimchow+ee227c@berkeley.edu
More informationUnderstanding TCP Vegas: A Duality Model
Understanding TCP Vegas: A Duality Model Steven Low Departments of CS and EE, Caltech, USA slow@caltech.edu Larry Peterson Limin Wang Department of CS, Princeton University, USA {llp,lmwang}@cs.princeton.edu
More informationCO759: Algorithmic Game Theory Spring 2015
CO759: Algorithmic Game Theory Spring 2015 Instructor: Chaitanya Swamy Assignment 1 Due: By Jun 25, 2015 You may use anything proved in class directly. I will maintain a FAQ about the assignment on the
More informationEC487 Advanced Microeconomics, Part I: Lecture 5
EC487 Advanced Microeconomics, Part I: Lecture 5 Leonardo Felli 32L.LG.04 27 October, 207 Pareto Efficient Allocation Recall the following result: Result An allocation x is Pareto-efficient if and only
More informationarxiv: v1 [cs.sy] 10 Apr 2014
Concave Switching in Single and Multihop Networks arxiv:1404.2725v1 [cs.sy] 10 Apr 2014 Neil Walton 1 1 University of Amsterdam, n.s.walton@uva.nl Abstract Switched queueing networks model wireless networks,
More informationUniqueness of Generalized Equilibrium for Box Constrained Problems and Applications
Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications Alp Simsek Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Asuman E.
More informationCongestion In Large Balanced Fair Links
Congestion In Large Balanced Fair Links Thomas Bonald (Telecom Paris-Tech), Jean-Paul Haddad (Ernst and Young) and Ravi R. Mazumdar (Waterloo) ITC 2011, San Francisco Introduction File transfers compose
More informationNode-Based Distributed Optimal Control of Wireless Networks
Node-Based Distributed Optimal Control of Wireless Networks Yufang Xi and Edmund M. Yeh Department of Electrical Engineering Yale University New Haven CT 06520 USA Email: {yufang.xi edmund.yeh}@yale.edu
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationDistributed Algorithmic Mechanism Design: Recent Results and Future Directions
Distributed Algorithmic Mechanism Design: Recent Results and Future Directions Joan Feigenbaum Yale Scott Shenker ICSI Slides: http://www.cs.yale.edu/~jf/dialm02.{ppt,pdf} Paper: http://www.cs.yale.edu/~jf/fs.{ps,pdf}
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationAlgorithmic Mechanism Design
Noam Nisan, Amir Ronen - 1st part - Seminar Talk by Andreas Geiger Fakultät für Informatik Universität Karlsruhe (TH) May 5, 2007 Overview Organization Introduction Motivation Introduction to Mechanism
More informationA Distributed Newton Method for Network Utility Maximization, II: Convergence
A Distributed Newton Method for Network Utility Maximization, II: Convergence Ermin Wei, Asuman Ozdaglar, and Ali Jadbabaie October 31, 2012 Abstract The existing distributed algorithms for Network Utility
More information1. f(β) 0 (that is, β is a feasible point for the constraints)
xvi 2. The lasso for linear models 2.10 Bibliographic notes Appendix Convex optimization with constraints In this Appendix we present an overview of convex optimization concepts that are particularly useful
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationDynamic Service Placement in Geographically Distributed Clouds
Dynamic Service Placement in Geographically Distributed Clouds Qi Zhang 1 Quanyan Zhu 2 M. Faten Zhani 1 Raouf Boutaba 1 1 School of Computer Science University of Waterloo 2 Department of Electrical and
More information4TE3/6TE3. Algorithms for. Continuous Optimization
4TE3/6TE3 Algorithms for Continuous Optimization (Duality in Nonlinear Optimization ) Tamás TERLAKY Computing and Software McMaster University Hamilton, January 2004 terlaky@mcmaster.ca Tel: 27780 Optimality
More informationNotes on Control Theory
Notes on Control Theory max t 1 f t, x t, u t dt # ẋ g t, x t, u t # t 0, t 1, x t 0 x 0 fixed, t 1 can be. x t 1 maybefreeorfixed The choice variable is a function u t which is piecewise continuous, that
More informationwhere u is the decision-maker s payoff function over her actions and S is the set of her feasible actions.
Seminars on Mathematics for Economics and Finance Topic 3: Optimization - interior optima 1 Session: 11-12 Aug 2015 (Thu/Fri) 10:00am 1:00pm I. Optimization: introduction Decision-makers (e.g. consumers,
More information1 Overview. 2 Multilinear Extension. AM 221: Advanced Optimization Spring 2016
AM 22: Advanced Optimization Spring 26 Prof. Yaron Singer Lecture 24 April 25th Overview The goal of today s lecture is to see how the multilinear extension of a submodular function that we introduced
More informationTutorial on Convex Optimization: Part II
Tutorial on Convex Optimization: Part II Dr. Khaled Ardah Communications Research Laboratory TU Ilmenau Dec. 18, 2018 Outline Convex Optimization Review Lagrangian Duality Applications Optimal Power Allocation
More informationGame theory approach for modeling competition over visibility on social networks
Game theory approach for modeling competition over visibility on social networks Alexandre Reiffers-Masson, Yezekael Hayel, Eitan Altman To cite this version: Alexandre Reiffers-Masson, Yezekael Hayel,
More informationResource allocation in organizations: an optimality result
Resource allocation in organizations: an optimality result Arun Sundararajan New York University, Stern School of Business 44 West 4th Street, K-MEC 9-79 New York, NY 10012-1126 asundara@stern.nyu.edu
More informationAN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS
AN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS Shruti Sharma and Demos Teneketzis Department of Electrical Engineering and Computer Science University of
More informationOnline Advertising is Big Business
Online Advertising Online Advertising is Big Business Multiple billion dollar industry $43B in 2013 in USA, 17% increase over 2012 [PWC, Internet Advertising Bureau, April 2013] Higher revenue in USA
More informationIntroduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research
Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,
More informationThe Interaction of Positive Externalities and Congestion Effects
The Interaction of Positive Externalities and Congestion Effects Ramesh Johari Department of Management Science and Engineering, Stanford University, Stanford, CA 94305, ramesh.johari@stanford.edu Sunil
More informationDual Decomposition.
1/34 Dual Decomposition http://bicmr.pku.edu.cn/~wenzw/opt-2017-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/34 1 Conjugate function 2 introduction:
More informationTowards Optimal Rate Allocation for Data Aggregation in Wireless Sensor Networks
Towards Optimal Rate Allocation for Data Aggregation in Wireless Sensor Networks ABSTRACT Lu Su, Yan Gao, and Yong Yang Department of Computer Science University of Illinois at Urbana-Champaign Urbana,
More information