Changhyun Kwon ::: CV

View my CV in PDF format.

Changhyun Kwon
Assistant Professor
Department of Industrial and Systems Engineering
University at Buffalo, the State University of New York
400 Bell Hall, Buffalo, NY, 14260, U.S.A.
Office: 716-645-4705
Cell: 716-218-0113
Fax: 716-645-3302
EMAIL: chkwon@buffalo.edu
WEB: http://www.eng.buffalo.edu/~chkwon/
Last updated: February 20, 2012

1 Research Interests

Transportation: road pricing, risk management, traffic assignment, hazardous materials
Service Operations: service pricing, revenue optimization, online advertising, vehicle sharing
Integrated-Transportation Approaches: sustainable developments, emission reductions

2 Education

PHD in Industrial Engineering, The Pennsylvania State University, 2008
MS in Industrial Engineering and Operations Research, The Pennsylvania State University, 2005
BS in Mechanical Engineering, Korea Advanced Institute of Science and Technology (KAIST), 2000

3 Academic Positions

Assistant Professor, Department of Industrial and Systems Engineering, University at Buffalo, the State University of New York, 2008 - present
Research/Teaching Assistant, Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 2004 - 2008
Research Assistant, Department of Agricultural Economics and Rural Sociology, The Pennsylvania State University, 2004, 2006
Research Assistant, Department of Mechanical Engineering, KAIST, 1997, 1998

4 Grants

1.: (PI) “Towards Socially and Economically Sustainable Urban Developments”, U.S. Department of Transportation through University Transportation Research Center, Region II, Research Initiative, co-Is: Jiyoung Park (UB), Qian Wang (UB), 12/23/2011 - 09/30/2012
2.: (PI) “Processing Area Improvement Initiative”, Goodwill Industries of WNY, Inc. through the Center for Industrial Effectiveness, 11/30/2011 - 5/30/2012
3.: (PI) “Collaborative Research: Regulating Hazardous Materials Transportation by Multi-Objective Dual Toll Pricing”, National Science Foundation, co-PIs: Rajan Batta (UB) and Young-Jun Son (U Arizona), 09/01/2011 - 08/31/2014 [CMMI-1068585]
4.: (PI) “Robust Routing for Hazardous Materials Transportation with Conditional Value-at-Risk on Time-Dependent Networks”, U.S. Department of Transportation through University Transportation Research Center, Region II, Faculty Development Minigrants, 07/01/2011 - 09/30/2012 [49111-07-23]
5.: (PI) “Food Service Efficiency & Capacity Analysis Study/Assessment”, Efficient Schools Team, LLC., Buffalo, NY, through The Center for Industrial Effectiveness, 03/30/2011 - 09/30/2011
6.: (PI) “Economic Implications of the Canada-US Border Bridges: Applying a Transportation-Combined Multiregional Input-Output Model for Canada and the U.S.”, Embassy of Canada in Washington, D.C., co-PI: Jiyoung Park (UB), 03/01/2011 - 02/28/2012 [link]
7.: The Canadian-American Studies Committee, Fall 2010 Grant Competition, with Jiyoung Park (UB), 2010
8.: Multiregional Policy Analysis LLC, 2010.

5 Publications

(⋆ = Dr. Kwon’s students)

Journal Articles (Published or To Appear)

1.: Ahmed, M.T.^⋆ , and C. Kwon (2012), “Pricing Game of Online Display Advertisement Publishers”, European Journal of Operational Research, 219, 477-487. [DOI] [PDF] [show abstract]

We consider an online display advertisement publisher who maximizes the revenue by optimal pricing in an oligopoly setting. Each publisher interacts with others though setting cost-perimpression (CPM) that affects the demand for everyone. Using the pseudoconcavity of the objective function, we study the best response of the publisher while her strategy space changes. We also consider the sensitivity of the publisher while other publishers changes their CPM. In both cases, the best response of the publisher depends entirely on her current best response CPM. We provide an algorithm for finding the equilibrium and illustrate by numerical examples.
2.: Jung, T.^⋆ and C. Kwon (2011), “Retailer-Supplier Matching: an Application of the Deferred Acceptance Algorithm” International Journal of Services Operations and Informatics, 6(3), 248–258. [DOI] [PDF] [show abstract]

In this paper, we apply matching theory to supply chain coordination. We present mathematical optimization models similar to the newsvendor problem to provide appropriate conditions for retailer-supplier matching. In particular, our matching algorithm, compared to the general matching theory, has uniquely been affected by contract sizes and ordering sequences. We also study that our matching application guarantees stable and optimal outcomes. Numerical examples with various parameter settings are provided to test the feasibility of the matching algorithms. We find that we can avoid the worst matching case when we use the proposed matching algorithms.
3.: Srinivasan, A.^⋆ and C. Kwon, “Operations of Online Advertising Services and Publisher’s Option”, Journal of the Operational Research Society, in print. [DOI] [PDF] [show abstract]

We analyse the use of options for online advertisement publishers. By providing a discount or rewards to advertisers, publishers can utilize their uncertain service capacity, page-views, more efficiently. We use Generalized Nash Bargaining to study the feasibility of the option contract and solve for an optimal value for the option price. We compare the revenues and benefits from advertisements under the option contract, with those without the options using numerical studies. We also study the impact of pricing and other components in the game on the optimal option price, the publisher's revenues, and the advertiser's benefits from the advertisements.
4.: Chung, B.D., J. Li, T. Yao, C. Kwon and T. L. Friesz (2011), “Demand Learning and Dynamic Pricing under Competition in a State-Space Framework ”, IEEE Transactions on Engineering Management, in print [DOI] [PDF] [show abstract]

In this paper, we propose a revenue optimization framework integrating demand learning and dynamic pricing for firms in monopoly or oligopoly markets. We introduce a state-space model for this revenue management problem, which incorporates game-theoretic demand dynamics and nonparametric techniques for estimating the evolution of underlying state variables. Under this framework, stringent model assumptions are removed. We develop a new demand learning algorithm using Markov chain Monte Carlo methods to estimate model parameters, unobserved state variables, and functional coefficients in the nonparametric part. Based on these estimates, future price sensitivities can be predicted, and the optimal pricing policy for the next planning period is obtained. To test the performance of demand learning strategies, we solve a monopoly firm's revenue maximizing problem in simulation studies. We then extend this paradigm to dynamic competition, where the problem is formulated as a differential variational inequality. Numerical examples show that our demand learning algorithm is efficient and robust.
5.: Wang, J.^⋆, Y. Kang^⋆, C. Kwon and R. Batta, “Dual Toll Pricing for Hazardous Material Transport with Linear Delay”, Networks and Spatial Economics, accepted [DOI] [PDF] [show abstract]

In this paper, we propose a dual toll pricing method to mitigate risk of hazardous materials (hazmat) transportation. We aim to simultaneously control both regular and hazmat vehicles to reduce the risk. In our model, we incorporate a new risk measure to consider duration-population-frequency of hazmat exposure. We first formulate the model as a Mathematical Program with Equilibrium Constraints (MPEC). Then we decompose the MPEC formulation into first-stage and second-stage problems. Separate methods are developed to solve each stage. A numerical example is provided and possible extensions are discussed.
6.: Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2011), “Approximate Network Loading and Dual Time Scale Dynamic User Equilibrium”, Transportation Research Part B, 45(1), 176-207. [DOI] [PDF] [show abstract]

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.
7.: Moon. Y. and C. Kwon (2011), “Online Advertisement Service Pricing and an Option”, Electronic Commerce Research and Applications, 10(1), 38-48. [DOI] [PDF] [show abstract]

For the Internet advertisement market, we consider a contract problem between advertisers and publishers. Among several ways of pricing online advertisements, the methods based on cost-per-impression (CPM) and cost-per-click (CPC) are the two most popular. The CPC fee is proportional to the click-through rate (CTR), which is uncertain and makes decisions of advertisers and publishers difficult. In this paper, we suggest a hybrid pricing scheme: advertisers pay the minimum of CPM and CPC fees by purchasing an option from publishers. To determine the option price, we consider a Nash bargaining game for negotiation between an advertiser and a publisher and provide the solution. Further, we show that such option contracts will help the advertiser avoid high cost and the publisher generate more revenue. The option contract will also improve the contract feasibility, compared to CPM and CPC.
8.: Kwon, C. (2011), “Single-Period Balancing of Pay-Per-Click and Pay-Per-View Online Display Advertisements”, Journal of Revenue and Pricing Management, 10(3), 261-270. [DOI] [PDF] [show abstract]

In this article, we study a balancing problem of web publishers for pay-per-view and pay-per-click contracts for online display advertising. Considering the details of contracts, we refine prior research results on the recommendation of optimal strategies. We examine the problem by formalizing a simple stochastic optimization problem for a single period of advertising contracts. We investigate how pricing and other contract components will affect the optimal display strategies analytically and numerically.
9.: Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng (2009), “Non-cooperative Competition Among Revenue Maximizing Service Providers with Demand Learning”, European Journal of Operational Research, 197(3), 981-996. [DOI] [PDF] [show abstract]

This paper recognizes that in many decision environments in which revenue optimization is attempted, an actual demand curve and its parameters are generally unobservable. Herein, we describe the dynamics of demand as a continuous time differential equation based on an evolutionary game theory perspective. We then observe realized sales data to obtain estimates of parameters that govern the evolution of demand; these are refined on a discrete time scale. The resulting model takes the form of a differential variational inequality. We present an algorithm based on a gap function for the differential variational inequality and report its numerical performance for an example revenue optimization problem.
10.: Kwon, C. and T. L. Friesz (2008), “Valuation of American Options by the Gradient Projection Method”, Applied Mathematics and Computation, 206(1), 380-388. [DOI] [PDF] [show abstract]

We study an equivalent optimization problem with an inequality constraint and boundary conditions, whose necessary condition for optimality is the variational inequality presentation of American options. To solve the problem, we use the gradient projection method, with discretizations both in time and space. We tested the algorithm and compared with the projective successive over-relaxation method.
11.: Friesz, T. L. and C. Kwon (2008), “Supply Chain Design in Perfect Competition”, International Journal of Services Operations and Informatics, 3(3/4), 340-356. [DOI] [PDF] [show abstract]

In this paper, we apply the theory of optimal control and theory of traffic assignment for supply chain design in perfect competition. We model the time staging and generalised routing of input factors needed for production by a firm. The production process will typically involve several stages, and as such is described by paths through a production network whose nodes are the various stages of production. We develop an algorithm and test it for a small numerical example.
12.: Miller, T. C., T. L. Friesz, R. L. Tobin and C. Kwon (2007), “Reaction Function Based Dynamic Location Modeling in Stackelberg-Nash-Cournot Competition”, Networks and Spatial Economics, 7(1), 77-97. [DOI] [PDF] [show abstract]

We formulate a dynamic facility location model for a firm locating on a discrete network. It is assumed that this locating firm will act as the leader firm in an industry characterized by Stackelberg leader-follower competition. The firm's I competitors are assumed to act as Cournot firms and are each assumed to operate under the assumption of zero conjectural variation with respect to their I-1 Cournot competitors. Using sensitivity analysis of variational inequalities within a hierachical mathematical programming approach, we develop reaction function based dynamic models to optimize the Stackelberg firm's location decision. In the second half of this paper, we use these models to illustrate through a numerical example the insights yielded by our approach.

Edited Books

1.: Batta, R. and C. Kwon, “Handbook of OR/MS Models in Hazardous Materials Transportation”, Springer (In Progress)

Refereed Proceedings

1.: C. Kwon (2011), “Conditional Value-at-Risk Model for Hazardous Materials Transportation”, in Proceedings of the 2011 Winter Simulation Conference, S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, and M. Fu, eds. pp. 1708-1714 [show abstract]

This paper investigates how the conditional value-at-risk (CVaR) can be used to mitigate risk in hazardous materials (hazmat) transportation. Routing hazmat must consider accident probabilities and accident consequences that depend on the hazmat types and route choices. This paper proposes a new method for mitigating risk based on CVaR measure. While the CVaR model is popularly used in financial portfolio optimization problems, its application in hazmat transportation is new. A computational method for determining the optimal CVaR route is proposed and illustrated by a case study in the road network surrounding Albany, NY.
2.: Jeong, B., C. Kwon, Y.S. Zhang, and S. Yang (2010), “Evaluating the Research Performance of a R&D Program: an Application of DEA”, Proceedings of the International Multi-Conference of Engineers and Computer Scientists 2010 Vol III. [PDF]
3.: Friesz, T. L., M. A. Rigdon and C. Kwon (2008), “A New Gradient Projection Algorithm for the Dynamic User Equilibrium Problem”, International Symposium on Dynamic Traffic Assignment 2008
4.: Friesz, T. L., C. Kwon and M. A. Rigdon (2007), “A Model of Competition in Service Management”, Proceedings of 2007 IEEE/INFORMS International Conference on Service Operations and Logistics, and Informatics [DOI]
5.: Friesz, T. L., C. Kwon and R. Mookherjee (2007), “A Computable Theory of Dynamic Congestion Pricing”, In: Transportation and Traffic Theory 2007: Papers selected for presentation at ISTTT17, a peer reviewed series since 1959, R. E. Allsop, M. G. H. Bell and B. G. Heydecker (Eds.), pp. 1-26. [PDF] [show abstract]

In this paper we present a theory of dynamic congestion pricing for the day-to-day as well as the within-day time scales. The equilibrium design problem emphasized herein takes the form of an MPEC, which we call the Dynamic Optimal Toll Problem with Equilibrium Constraints, or DOTPEC. The DOPTEC formulation we employ recalls an important earlier result that allows the equilibrium design problem to be stated as a single level problem, a result which is surprisingly little known. The DOPTEC maintains the usual design objective of minimizing the system travel cost by appropriate toll pricing. We describe how an infnite dimensional mathematical programming perspective may be employed to create an algorithm for the DOTPEC. A numerical example is provided.
6.: Friesz, T. L., C. Kwon, A. Chow and B. Heydecker (2007), “A Dynamic Efficient Toll Problem”, The Sixth Triennial Symposium on Transportation Analysis (TRISTAN VI)
7.: Friesz, T. L., R. Mookherjee and C. Kwon (2006), “Dynamic Non-cooperative Games as a Foundation for Modeling Dynamic User Equilibrium”, The First International Symposium on Dynamic Traffic Assignment [PDF]
8.: Friesz, T. L., C. Kwon and R. Mookherjee (2006), “A Computable Theory of Dynamic Congestion Pricing”, The First International Symposium on Dynamic Traffic Assignment
9.: Kwon, C. and T. L. Friesz (2006), “Valuation of American Options by the Gradient Projection Method”, College of Engineering Research Symposium 2006, Penn State University

Book Chapters

1.: Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2010), “Computing Dual Time Scale Dynamic User Equilibria”, in New Developments in Transport Planning: Advances in Dynamic Traffic Assignment (Eds.: C. M. J. Tampere, F. Viti and L. H. Immers), Edward Elgar Publishing. [LINK]
2.: Friesz, T. L., C. Kwon and D. Bernstein (2009), “Evolutionary and Preferential Attachment Models of Demand Growth”, in Complexity and Spatial Networks: In Search of Simplicity (Eds.: Aura Reggiani and Roberto Patuelli), Springer-Verlag. [LINK] [DOI]
3.: Friesz, T. L., C. Kwon and D. Bernstein (2007), “Analytical Dynamic Traffic Assignment Model" in Handbook of Transport Modelling 2nd Edition (Eds.: D. A. Hensher and K. J. Button), Elsevier. [LINK]
4.: Friesz, T. L. and C. Kwon (2007), “Strategic Freight Network Planning Models and a Dynamic Oligopolistic Urban Freight Network" in Handbook of Transport Modelling 2nd Edition (Eds.: D. A. Hensher and K. J. Button), Elsevier. [LINK]

6 Talks

Conference Presentations

Presentations with papers published in proceedings are not provided here.

1.: Kwon. C, I. Toumazis^⋆, T. Lee, “Worst Case Conditional Value-at-Risk Minimization in Hazardous Materials Transportation”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011
2.: Berglund, P.^⋆, C. Kwon, “Solving the Robust p-hub Median Problem”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011
3.: Kwon, C., T. Lee, P. Berglund^⋆, “Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011
4.: Ahmed, M.T.^⋆, C. Kwon, “Pricing Game of Online Display Advertisement Publishers”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011
5.: Chung, S.H., C. Kwon, T.L. Friesz, ‘Emission Trading and Carbon Tax Policy in Sustainable Electrical Energy Management”, 5th Annual Trans-Atlantic INFRADAY, Washington, DC, November 10-11, 2011
6.: Kang, Y.^⋆, R. Batta, C. Kwon, “Generalized Route Planning Model for Hazardous Material Transportation With VAR and Equity Considerations”, 2011 IERC Annual Conference, Reno, NV, May 21-25, 2011
7.: Ahmed, M.T.^⋆, C. Kwon, “Pricing Game of Online Display Advertisement Publishers”, 2nd New York Conference on Applied Mathematics, Buffalo, NY, April 30, 2011
8.: Kwon, C., T. Lee, P. Berglund^⋆, “Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients”, 2nd New York Conference on Applied Mathematics, Buffalo, NY, April 30, 2011
9.: Ahmed, M.T.^⋆, C. Kwon, “Optimal Contract Problems in Online Advertising with Risk Considerations”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010
10.: Wang, J.^⋆, Y. Kang^⋆, R. Batta, C. Kwon, “Dual Toll Pricing for Hazardous Material Transport with Linear Delay”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010
11.: Berglund, P.^⋆, C. Kwon, “Facility Location Problem with Network Oligopoly”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010
12.: Kang, Y.^⋆, R. Batta, C.Kwon, “Value-at-Risk Model for Hazmat Transport”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010
13.: Hariharan, V., C. Kwon, D. Talukdar, “Dynamic Optimal Marketing Mix Strategies for New Products With Influential and Imitator Consumer Segments”, 32nd INFORMS Marketing Science Conference, Cologne, Germany, Jun 17-19, 2010
14.: Kang, Y.^⋆, R. Batta, C. Kwon, “A New Model for Transport Risk Assessment”, Workshop on Transportation of Hazardous Materials in Urban Areas, McGill University, Montreal, Canada, Mar 25, 2010
15.: Friesz, T., T. Kim, C. Kwon, T. Yao, “A Computable Theory of Dynamic Congestion Pricing”, INFORMS Annual Meeting 2009, San Diego, Oct 11-14, 2009
16.: Friesz, T., T. Kim, C. Kwon, T. Yao, “Advances in Modeling Dynamic Network User Equilibrium”, INFORMS Annual Meeting 2009, San Diego, Oct 11-14, 2009
17.: Kwon, C., R. Batta and Y. Kang^⋆, “Joint Toll Pricing for Hazardous Material Transport and Regular Traffic”, 20th International Symposium on Mathematical Programming (ISMP 2009), Aug 23-28, 2009
18.: Friesz, T. L., T. I. Kim, C. Kwon, D. Bernstein and T. Yao, “Advances in Modeling Dynamic Network User Equilibrium and Dynamic Congestion Pricing”, 1st Transatlantic NECTAR Conference 2009, Arlington, VA, Jun 18-20, 2009
19.: Friesz, T. L., I. Lee and C. Kwon, “Modelling Competitive Supply Chains Using Differential Variational Inequalities”, 1st Transatlantic NECTAR Conference 2009, Arlington, VA, Jun 18-20, 2009
20.: Moon, Y. and C. Kwon, “Online Advertisement Service Pricing and Option”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009
21.: Kang, Y.^⋆, R. Batta and C. Kwon, “Toll-based Simulation Model for Hazardous Material Transport”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009
22.: Kwon, C., “Differentiated Service Pricing and Demand Learning”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009
23.: Friesz, T. L., C. Kwon, T. I. Kim and M. A. Rigdon, “Dynamic Congestion Pricing: Models and Computational Methods”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008
24.: Friesz, T. L., M. A. Rigdon, T. I. Kim and C. Kwon, “Dual Time Scale Dynamic User Equilibria with Demand Growth: Formulation and a Convergent Algorithm”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008
25.: Kwon, C., M. A. Rigdon and T. L. Friesz, “Robust Optimal Control with an Application to Inventory Management”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008
26.: Friesz, T. L., C. Kwon and T. I. Kim, “A Continuous Time Dynamic Model of Competitive Facility Location”, ISOLDE XI - 11th International Symposium on Locational Decisions, Santa Barbara, CA, USA, June 26 - July 1, 2008
27.: Friesz, T. L., C. Kwon and M. A. Rigdon, “Computation of Prices in Competitive, Dynamic Service Networks”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007
28.: Kwon, C. and T. L. Friesz, “A Descent Method for Differential VIs Arising in Non-Cooperative Differential Nash Equilibrium”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007
29.: Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng, “Non-cooperative Competition among Revenue Maximizing Service Providers with Demand Learning”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007
30.: Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng, “Non-cooperative Competition Among Revenue Maximizing Service Providers with Demand Learning”, 12th MSOM conference, Beijing, China, June 18 - 19, 2007
31.: Kwon, C., T. L. Friesz, Y. Moon, T. Yao and T. Kim, “Valuation of Real Options by the Gradient Projection Method”, 11th Annual International Conference on Real options, Berkeley, CA, USA, June 6-9, 2007
32.: Kwon, C. and T. L. Friesz, “A Multi-Period Game-Theoretic Pricing Model for Differentiated Service”, Canadian Operational Research Society: Annual Meeting 2007, London, Ontario, Canada, May 14-16, 2007
33.: Kwon, C., T. L. Friesz, C.-C. Lin, “A Descent Method for Differential Variational Inequalities Arising in Computations of Non-Cooperative Differential Nash Equilibrium”, Ninth Workshop on Optimal Control, Dynamic Games and Nonlinear Dynamics, Montreal, Canada, May 7-9, 2007

Invited Seminars

1.: Seoul National University, Korea, Department of Industrial Engineering, Jan 9, 2012
2.: Ajou Unversity, Korea, School of Environmental, Civil and Transportation Engineering, Dec 19, 2011
3.: University at Buffalo, SUNY, Department of Operations Management and Strategy and Department of Management Science and Systems, Sep 30, 2009
4.: Chonbuk National University, Korea, Department of Industrial and Information Systems Engineering, July 16, 2009
5.: Korea Advanced Institute of Science and Technology (KAIST), Department of Industrial and Systems Engineering, June 5, 2008
6.: National University of Singapore, Department of Industrial and Systems Engineering, May 8, 2008
7.: University at Buffalo, SUNY, Department of Industrial and Systems Engineering, May 1, 2008
8.: University of Miami, Department of Industrial and Systems Engineering, April 25, 2008
9.: ETH Zurich, Institute for Operations Research, April 4, 2008

7 Honors and Awards

Finalist, Service Science Section Best Paper Competition, INFORMS, 2009
UUP Professional Development Award, University at Buffalo, 2009
Graduate Scholarship by the Korea Science and Engineering Foundation (KOSEF), 2003 - 2005
Merit-based Undergraduate Scholarship at KAIST, 1996 - 2000

8 Services

Service to Profession

Editorial Services

Editorial Advisory Board Member, Handbook of Research on Industrial Informatics and Manufacturing Intelligence: Innovations and Solutions, 2010 - 2011
Associate Editor, Networks and Spatial Economics, 2009 -
Editorial Board Member, Int. Journal of Services Operations and Informatics, 2009 -

Ad-Hoc Reviewer for

Computational Optimization and Applications - 2010
Dynamic Games and Applications - 2011
European Journal of Operational Research - 2007(x3), 2008, 2009(x2), 2010, 2011(x2)
IEEE Systems Journal - 2012
IEEE Transactions on Engineering Management - 2011
International Journal of Network Management - 2008
International Conference of Chinese Transportation Professionals - 2011(x5)
International Conference on Information Systems - 2010
Journal of Operations Management - 2009, 2010
Journal of the Operational Research Society - 2011
Mathematical and Computer Modelling - 2012
Networks and Spatial Economics - 2006, 2007(x2), 2008(x2), 2009, 2010
OMEGA - The International Journal of Management Science - 2011
Transportation Research Part B - 2008, 2009(x4), 2010(x2)
Socio-Economic Planning Sciences - 2010

Member of

Institute for Operations Research and the Management Sciences (INFORMS)
- Webmaster, Revenue Management and Pricing Section, 2010
- Session Chair, Transportation Network Security and Alternative Modes, INFORMS 2011
- Session Chair, Hazardous Material Transportation, INFORMS 2010
Institute of Industrial Engineers (IIE)
- Session Chair, Transportation and Logistics Applications, IERC 2009
Mathematical Optimization Society (MOS)
- Session Chair, Transportation and Logistics Applications, ISMP 2009
Mineta Transportation Institute
- Research Associate since 2010
Upstate New York Society of Risk Analysis
- Secretary, 2010

Services to the University at Buffalo

ISE Research Area Coordinator - Transportation and Logistics, 2011 -
Academic Integrity and Grievance Committee, 2010 -
Faculty Senate Alternate (to Dr. Ann Bisantz), 2010 - 2012
Department of Industrial and Systems Engineering, Graduate Affairs Committee, 2009 -
Service Engineering Graduate Program Committee, University at Buffalo, 2008 - 2009
Faculty Marshal, UB Engineering Commencement, May 9, 2009
UB2020 Scholars Fund - Proposal Review Panel, University at Buffalo, 2009
The Interdisciplinary Research Development Fund - Proposal Review Panel, University at Buffalo, 2008

9 Teaching

Instructor

IE 320 Engineering Economy

Spring 2012, Enrollment: 133

IE 326 Planning for Production

Fall 2011, Enrollment: 22
Fall 2010, Enrollment: 38
Fall 2009, Enrollment: 30
Fall 2008, Enrollment: 30

IE 459/514 Revenue Management

Spring 2011, Enrollment: 33
Spring 2010, Enrollment: 18
Spring 2009, Enrollment: 10

IE 671 Nonlinear Programming

Fall 2011, Enrollment: 11
Fall 2009, Enrollment: 17

IE 677 Network Optimization

Fall 2010, Enrollment: 15

Guest Lecturer

IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2011
IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2010
IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2009
IE 589 Dynamic Optimization and Differential Games, Penn State, Fall 2007
IE 521 Nonlinear Programming, Penn State, Spring 2007

10 Student Advising

Ph.D. Students Supervised

Masoumeh Taslimi (expected graduation: May 2014; co-advising with Dr. Rajan Batta)
Tolou Esfandeh (expected graduation: May 2014; co-advising with Dr. Rajan Batta)
Md. Tanveer Ahmed (expected graduation: May 2012), ”Revenue Management for Online Advertisement Services”
Paul Berglund (expected graduation: May 2012), ”Competitive Facility Location Problems”
Yingying Kang (graduated in May 2011; co-advised with Dr. Rajan Batta), ”Value-at-Risk Models for Hazardous Materials Transportation”

M.S. Students Supervised

Iakovos Toumazis (expected graduation: May 2012), “Worst-Case Conditional Value-at-Risk Model for Hazardous Materials Transportation”
Harshalkumar Patel (expected graduation: May 2012), “Real-Time Optimization for Online Advertisements”
Jiashan Wang (graduated in Sep 2010), non-thesis option, placement upon graduation: Ph.D. student, Department of Mathematics, University of Washington, Seattle
Anand Srinivasan (graduated in Aug 2010), “Operations of Online Advertising Services and Publisher’s Options”, placement upon graduation: Operations Research Analyst at Revenue Analytics, Atlanta, GA
Amod Anand Agashe (graduated in May 2010), “Stochastic Revenue Optimization in Online Advertising”, placement upon graduation: Yield Optimization Analyst at Pubmatics, Pune, India
Varun Narayanan Kutty (graduated in May 2010), “Accept-Reject Decision in Online Advertising using Geometric Brownian Motion”, placement upon graduation: Business Technology Analyst at Deloitte, New York, NY

Dissertation Committee Member of

Ting-Shu Hung, ISE, UB (Chair: Rakesh Nagi)
Fei He, ISE, UB (Chair: Jun Zhuang)
Sabrina Casucci, ISE, UB (Chair: Li Lin)
Younggi Song, ISE, UB (Chair: Rakesh Nagi)
Yidong Zhang, ISE, UB (Chair: Mark Karwan)
Satheeshkumar Seenivasan, Marketing, UB (Chair: Debabrata Talukdar; graduated in 2011)
Vijay Ganesh Hariharan, Marketing, UB (Chair: Debabrata Talukdar; graduated in 2010)

Graduate Students with Individual Problems

Jihong Jang, ISE, UB, “Call Center Outsourcing Contract Problems”, Fall 2010
Taewoo Jung, Economics, UB, “Retailer-Supplier Matching Algorithm”, Fall 2010

Undergraduate Students with Independent Studies

Kristen M. Colley, ISE, UB, “Revenue Management”, Spring 2011
Amy Deuell, ISE, UB, “Revenue Management”, Spring 2011
Glen Fernandes, ISE, UB, “Revenue Management and Price Optimization”, Spring 2010
Abdurlrhman Alshibake, ISE, UB, “Project Scheduling”, Fall 2009

Undergraduate Students with Honor Project

Hao Chen, ISE, UB, “Practices and Regulations in Hazardous Materials Routing”, IE 326, Fall 2011

11 Industrial Experience

Web Applications Programmer, Division of Internet Business, Leecom Information System, Seoul, Korea, 2000 - 2003
Intern, R&D Center, Korea Delphi Automotive Systems Corporation, Daegu, Korea, 1999

12 Certificate

National Information Processing Engineer Certificate, Korea
- Speciality includes Database, Computer Structure, Operation Systems, Software Engineering, and Data Communication

___________________________________________________________________________________

Department of Industrial and Systems Engineering
Changhyun Kwon ::: CV Edit Attach
Home CV Research Teaching Resources Personal Search	CV View my CV in PDF format. Changhyun Kwon Assistant Professor Department of Industrial and Systems Engineering University at Buffalo, the State University of New York 400 Bell Hall, Buffalo, NY, 14260, U.S.A. Office: 716-645-4705 Cell: 716-218-0113 Fax: 716-645-3302 EMAIL: chkwon@buffalo.edu WEB: http://www.eng.buffalo.edu/~chkwon/ Last updated: February 20, 2012 1 Research Interests Transportation: road pricing, risk management, traffic assignment, hazardous materials Service Operations: service pricing, revenue optimization, online advertising, vehicle sharing Integrated-Transportation Approaches: sustainable developments, emission reductions 2 Education PHD in Industrial Engineering, The Pennsylvania State University, 2008 MS in Industrial Engineering and Operations Research, The Pennsylvania State University, 2005 BS in Mechanical Engineering, Korea Advanced Institute of Science and Technology (KAIST), 2000 3 Academic Positions Assistant Professor, Department of Industrial and Systems Engineering, University at Buffalo, the State University of New York, 2008 - present Research/Teaching Assistant, Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, 2004 - 2008 Research Assistant, Department of Agricultural Economics and Rural Sociology, The Pennsylvania State University, 2004, 2006 Research Assistant, Department of Mechanical Engineering, KAIST, 1997, 1998 4 Grants 1. (PI) “Towards Socially and Economically Sustainable Urban Developments”, U.S. Department of Transportation through University Transportation Research Center, Region II, Research Initiative, co-Is: Jiyoung Park (UB), Qian Wang (UB), 12/23/2011 - 09/30/2012 2. (PI) “Processing Area Improvement Initiative”, Goodwill Industries of WNY, Inc. through the Center for Industrial Effectiveness, 11/30/2011 - 5/30/2012 3. (PI) “Collaborative Research: Regulating Hazardous Materials Transportation by Multi-Objective Dual Toll Pricing”, National Science Foundation, co-PIs: Rajan Batta (UB) and Young-Jun Son (U Arizona), 09/01/2011 - 08/31/2014 [CMMI-1068585] 4. (PI) “Robust Routing for Hazardous Materials Transportation with Conditional Value-at-Risk on Time-Dependent Networks”, U.S. Department of Transportation through University Transportation Research Center, Region II, Faculty Development Minigrants, 07/01/2011 - 09/30/2012 [49111-07-23] 5. (PI) “Food Service Efficiency & Capacity Analysis Study/Assessment”, Efficient Schools Team, LLC., Buffalo, NY, through The Center for Industrial Effectiveness, 03/30/2011 - 09/30/2011 6. (PI) “Economic Implications of the Canada-US Border Bridges: Applying a Transportation-Combined Multiregional Input-Output Model for Canada and the U.S.”, Embassy of Canada in Washington, D.C., co-PI: Jiyoung Park (UB), 03/01/2011 - 02/28/2012 [link] 7. The Canadian-American Studies Committee, Fall 2010 Grant Competition, with Jiyoung Park (UB), 2010 8. Multiregional Policy Analysis LLC, 2010. 5 Publications (⋆ = Dr. Kwon’s students) Journal Articles (Published or To Appear) 1. Ahmed, M.T.^⋆ , and C. Kwon (2012), “Pricing Game of Online Display Advertisement Publishers”, European Journal of Operational Research, 219, 477-487. [DOI] [PDF] [show abstract] We consider an online display advertisement publisher who maximizes the revenue by optimal pricing in an oligopoly setting. Each publisher interacts with others though setting cost-perimpression (CPM) that affects the demand for everyone. Using the pseudoconcavity of the objective function, we study the best response of the publisher while her strategy space changes. We also consider the sensitivity of the publisher while other publishers changes their CPM. In both cases, the best response of the publisher depends entirely on her current best response CPM. We provide an algorithm for finding the equilibrium and illustrate by numerical examples. 2. Jung, T.^⋆ and C. Kwon (2011), “Retailer-Supplier Matching: an Application of the Deferred Acceptance Algorithm” International Journal of Services Operations and Informatics, 6(3), 248–258. [DOI] [PDF] [show abstract] In this paper, we apply matching theory to supply chain coordination. We present mathematical optimization models similar to the newsvendor problem to provide appropriate conditions for retailer-supplier matching. In particular, our matching algorithm, compared to the general matching theory, has uniquely been affected by contract sizes and ordering sequences. We also study that our matching application guarantees stable and optimal outcomes. Numerical examples with various parameter settings are provided to test the feasibility of the matching algorithms. We find that we can avoid the worst matching case when we use the proposed matching algorithms. 3. Srinivasan, A.^⋆ and C. Kwon, “Operations of Online Advertising Services and Publisher’s Option”, Journal of the Operational Research Society, in print. [DOI] [PDF] [show abstract] We analyse the use of options for online advertisement publishers. By providing a discount or rewards to advertisers, publishers can utilize their uncertain service capacity, page-views, more efficiently. We use Generalized Nash Bargaining to study the feasibility of the option contract and solve for an optimal value for the option price. We compare the revenues and benefits from advertisements under the option contract, with those without the options using numerical studies. We also study the impact of pricing and other components in the game on the optimal option price, the publisher's revenues, and the advertiser's benefits from the advertisements. 4. Chung, B.D., J. Li, T. Yao, C. Kwon and T. L. Friesz (2011), “Demand Learning and Dynamic Pricing under Competition in a State-Space Framework ”, IEEE Transactions on Engineering Management, in print [DOI] [PDF] [show abstract] In this paper, we propose a revenue optimization framework integrating demand learning and dynamic pricing for firms in monopoly or oligopoly markets. We introduce a state-space model for this revenue management problem, which incorporates game-theoretic demand dynamics and nonparametric techniques for estimating the evolution of underlying state variables. Under this framework, stringent model assumptions are removed. We develop a new demand learning algorithm using Markov chain Monte Carlo methods to estimate model parameters, unobserved state variables, and functional coefficients in the nonparametric part. Based on these estimates, future price sensitivities can be predicted, and the optimal pricing policy for the next planning period is obtained. To test the performance of demand learning strategies, we solve a monopoly firm's revenue maximizing problem in simulation studies. We then extend this paradigm to dynamic competition, where the problem is formulated as a differential variational inequality. Numerical examples show that our demand learning algorithm is efficient and robust. 5. Wang, J.^⋆, Y. Kang^⋆, C. Kwon and R. Batta, “Dual Toll Pricing for Hazardous Material Transport with Linear Delay”, Networks and Spatial Economics, accepted [DOI] [PDF] [show abstract] In this paper, we propose a dual toll pricing method to mitigate risk of hazardous materials (hazmat) transportation. We aim to simultaneously control both regular and hazmat vehicles to reduce the risk. In our model, we incorporate a new risk measure to consider duration-population-frequency of hazmat exposure. We first formulate the model as a Mathematical Program with Equilibrium Constraints (MPEC). Then we decompose the MPEC formulation into first-stage and second-stage problems. Separate methods are developed to solve each stage. A numerical example is provided and possible extensions are discussed. 6. Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2011), “Approximate Network Loading and Dual Time Scale Dynamic User Equilibrium”, Transportation Research Part B, 45(1), 176-207. [DOI] [PDF] [show abstract] In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network. 7. Moon. Y. and C. Kwon (2011), “Online Advertisement Service Pricing and an Option”, Electronic Commerce Research and Applications, 10(1), 38-48. [DOI] [PDF] [show abstract] For the Internet advertisement market, we consider a contract problem between advertisers and publishers. Among several ways of pricing online advertisements, the methods based on cost-per-impression (CPM) and cost-per-click (CPC) are the two most popular. The CPC fee is proportional to the click-through rate (CTR), which is uncertain and makes decisions of advertisers and publishers difficult. In this paper, we suggest a hybrid pricing scheme: advertisers pay the minimum of CPM and CPC fees by purchasing an option from publishers. To determine the option price, we consider a Nash bargaining game for negotiation between an advertiser and a publisher and provide the solution. Further, we show that such option contracts will help the advertiser avoid high cost and the publisher generate more revenue. The option contract will also improve the contract feasibility, compared to CPM and CPC. 8. Kwon, C. (2011), “Single-Period Balancing of Pay-Per-Click and Pay-Per-View Online Display Advertisements”, Journal of Revenue and Pricing Management, 10(3), 261-270. [DOI] [PDF] [show abstract] In this article, we study a balancing problem of web publishers for pay-per-view and pay-per-click contracts for online display advertising. Considering the details of contracts, we refine prior research results on the recommendation of optimal strategies. We examine the problem by formalizing a simple stochastic optimization problem for a single period of advertising contracts. We investigate how pricing and other contract components will affect the optimal display strategies analytically and numerically. 9. Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng (2009), “Non-cooperative Competition Among Revenue Maximizing Service Providers with Demand Learning”, European Journal of Operational Research, 197(3), 981-996. [DOI] [PDF] [show abstract] This paper recognizes that in many decision environments in which revenue optimization is attempted, an actual demand curve and its parameters are generally unobservable. Herein, we describe the dynamics of demand as a continuous time differential equation based on an evolutionary game theory perspective. We then observe realized sales data to obtain estimates of parameters that govern the evolution of demand; these are refined on a discrete time scale. The resulting model takes the form of a differential variational inequality. We present an algorithm based on a gap function for the differential variational inequality and report its numerical performance for an example revenue optimization problem. 10. Kwon, C. and T. L. Friesz (2008), “Valuation of American Options by the Gradient Projection Method”, Applied Mathematics and Computation, 206(1), 380-388. [DOI] [PDF] [show abstract] We study an equivalent optimization problem with an inequality constraint and boundary conditions, whose necessary condition for optimality is the variational inequality presentation of American options. To solve the problem, we use the gradient projection method, with discretizations both in time and space. We tested the algorithm and compared with the projective successive over-relaxation method. 11. Friesz, T. L. and C. Kwon (2008), “Supply Chain Design in Perfect Competition”, International Journal of Services Operations and Informatics, 3(3/4), 340-356. [DOI] [PDF] [show abstract] In this paper, we apply the theory of optimal control and theory of traffic assignment for supply chain design in perfect competition. We model the time staging and generalised routing of input factors needed for production by a firm. The production process will typically involve several stages, and as such is described by paths through a production network whose nodes are the various stages of production. We develop an algorithm and test it for a small numerical example. 12. Miller, T. C., T. L. Friesz, R. L. Tobin and C. Kwon (2007), “Reaction Function Based Dynamic Location Modeling in Stackelberg-Nash-Cournot Competition”, Networks and Spatial Economics, 7(1), 77-97. [DOI] [PDF] [show abstract] We formulate a dynamic facility location model for a firm locating on a discrete network. It is assumed that this locating firm will act as the leader firm in an industry characterized by Stackelberg leader-follower competition. The firm's I competitors are assumed to act as Cournot firms and are each assumed to operate under the assumption of zero conjectural variation with respect to their I-1 Cournot competitors. Using sensitivity analysis of variational inequalities within a hierachical mathematical programming approach, we develop reaction function based dynamic models to optimize the Stackelberg firm's location decision. In the second half of this paper, we use these models to illustrate through a numerical example the insights yielded by our approach. Edited Books 1. Batta, R. and C. Kwon, “Handbook of OR/MS Models in Hazardous Materials Transportation”, Springer (In Progress) Refereed Proceedings 1. C. Kwon (2011), “Conditional Value-at-Risk Model for Hazardous Materials Transportation”, in Proceedings of the 2011 Winter Simulation Conference, S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, and M. Fu, eds. pp. 1708-1714 [show abstract] This paper investigates how the conditional value-at-risk (CVaR) can be used to mitigate risk in hazardous materials (hazmat) transportation. Routing hazmat must consider accident probabilities and accident consequences that depend on the hazmat types and route choices. This paper proposes a new method for mitigating risk based on CVaR measure. While the CVaR model is popularly used in financial portfolio optimization problems, its application in hazmat transportation is new. A computational method for determining the optimal CVaR route is proposed and illustrated by a case study in the road network surrounding Albany, NY. 2. Jeong, B., C. Kwon, Y.S. Zhang, and S. Yang (2010), “Evaluating the Research Performance of a R&D Program: an Application of DEA”, Proceedings of the International Multi-Conference of Engineers and Computer Scientists 2010 Vol III. [PDF] 3. Friesz, T. L., M. A. Rigdon and C. Kwon (2008), “A New Gradient Projection Algorithm for the Dynamic User Equilibrium Problem”, International Symposium on Dynamic Traffic Assignment 2008 4. Friesz, T. L., C. Kwon and M. A. Rigdon (2007), “A Model of Competition in Service Management”, Proceedings of 2007 IEEE/INFORMS International Conference on Service Operations and Logistics, and Informatics [DOI] 5. Friesz, T. L., C. Kwon and R. Mookherjee (2007), “A Computable Theory of Dynamic Congestion Pricing”, In: Transportation and Traffic Theory 2007: Papers selected for presentation at ISTTT17, a peer reviewed series since 1959, R. E. Allsop, M. G. H. Bell and B. G. Heydecker (Eds.), pp. 1-26. [PDF] [show abstract] In this paper we present a theory of dynamic congestion pricing for the day-to-day as well as the within-day time scales. The equilibrium design problem emphasized herein takes the form of an MPEC, which we call the Dynamic Optimal Toll Problem with Equilibrium Constraints, or DOTPEC. The DOPTEC formulation we employ recalls an important earlier result that allows the equilibrium design problem to be stated as a single level problem, a result which is surprisingly little known. The DOPTEC maintains the usual design objective of minimizing the system travel cost by appropriate toll pricing. We describe how an infnite dimensional mathematical programming perspective may be employed to create an algorithm for the DOTPEC. A numerical example is provided. 6. Friesz, T. L., C. Kwon, A. Chow and B. Heydecker (2007), “A Dynamic Efficient Toll Problem”, The Sixth Triennial Symposium on Transportation Analysis (TRISTAN VI) 7. Friesz, T. L., R. Mookherjee and C. Kwon (2006), “Dynamic Non-cooperative Games as a Foundation for Modeling Dynamic User Equilibrium”, The First International Symposium on Dynamic Traffic Assignment [PDF] 8. Friesz, T. L., C. Kwon and R. Mookherjee (2006), “A Computable Theory of Dynamic Congestion Pricing”, The First International Symposium on Dynamic Traffic Assignment 9. Kwon, C. and T. L. Friesz (2006), “Valuation of American Options by the Gradient Projection Method”, College of Engineering Research Symposium 2006, Penn State University Book Chapters 1. Friesz, T. L., T. I. Kim, C. Kwon and M. A. Rigdon (2010), “Computing Dual Time Scale Dynamic User Equilibria”, in New Developments in Transport Planning: Advances in Dynamic Traffic Assignment (Eds.: C. M. J. Tampere, F. Viti and L. H. Immers), Edward Elgar Publishing. [LINK] 2. Friesz, T. L., C. Kwon and D. Bernstein (2009), “Evolutionary and Preferential Attachment Models of Demand Growth”, in Complexity and Spatial Networks: In Search of Simplicity (Eds.: Aura Reggiani and Roberto Patuelli), Springer-Verlag. [LINK] [DOI] 3. Friesz, T. L., C. Kwon and D. Bernstein (2007), “Analytical Dynamic Traffic Assignment Model" in Handbook of Transport Modelling 2nd Edition (Eds.: D. A. Hensher and K. J. Button), Elsevier. [LINK] 4. Friesz, T. L. and C. Kwon (2007), “Strategic Freight Network Planning Models and a Dynamic Oligopolistic Urban Freight Network" in Handbook of Transport Modelling 2nd Edition (Eds.: D. A. Hensher and K. J. Button), Elsevier. [LINK] 6 Talks Conference Presentations Presentations with papers published in proceedings are not provided here. 1. Kwon. C, I. Toumazis^⋆, T. Lee, “Worst Case Conditional Value-at-Risk Minimization in Hazardous Materials Transportation”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011 2. Berglund, P.^⋆, C. Kwon, “Solving the Robust p-hub Median Problem”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011 3. Kwon, C., T. Lee, P. Berglund^⋆, “Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011 4. Ahmed, M.T.^⋆, C. Kwon, “Pricing Game of Online Display Advertisement Publishers”, INFORMS Annual Meeting 2011, Charlotte, NC, Nov 13-16, 2011 5. Chung, S.H., C. Kwon, T.L. Friesz, ‘Emission Trading and Carbon Tax Policy in Sustainable Electrical Energy Management”, 5th Annual Trans-Atlantic INFRADAY, Washington, DC, November 10-11, 2011 6. Kang, Y.^⋆, R. Batta, C. Kwon, “Generalized Route Planning Model for Hazardous Material Transportation With VAR and Equity Considerations”, 2011 IERC Annual Conference, Reno, NV, May 21-25, 2011 7. Ahmed, M.T.^⋆, C. Kwon, “Pricing Game of Online Display Advertisement Publishers”, 2nd New York Conference on Applied Mathematics, Buffalo, NY, April 30, 2011 8. Kwon, C., T. Lee, P. Berglund^⋆, “Robust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients”, 2nd New York Conference on Applied Mathematics, Buffalo, NY, April 30, 2011 9. Ahmed, M.T.^⋆, C. Kwon, “Optimal Contract Problems in Online Advertising with Risk Considerations”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010 10. Wang, J.^⋆, Y. Kang^⋆, R. Batta, C. Kwon, “Dual Toll Pricing for Hazardous Material Transport with Linear Delay”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010 11. Berglund, P.^⋆, C. Kwon, “Facility Location Problem with Network Oligopoly”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010 12. Kang, Y.^⋆, R. Batta, C.Kwon, “Value-at-Risk Model for Hazmat Transport”, INFORMS Annual Meeting 2010, Austin, TX, Nov 7-10, 2010 13. Hariharan, V., C. Kwon, D. Talukdar, “Dynamic Optimal Marketing Mix Strategies for New Products With Influential and Imitator Consumer Segments”, 32nd INFORMS Marketing Science Conference, Cologne, Germany, Jun 17-19, 2010 14. Kang, Y.^⋆, R. Batta, C. Kwon, “A New Model for Transport Risk Assessment”, Workshop on Transportation of Hazardous Materials in Urban Areas, McGill University, Montreal, Canada, Mar 25, 2010 15. Friesz, T., T. Kim, C. Kwon, T. Yao, “A Computable Theory of Dynamic Congestion Pricing”, INFORMS Annual Meeting 2009, San Diego, Oct 11-14, 2009 16. Friesz, T., T. Kim, C. Kwon, T. Yao, “Advances in Modeling Dynamic Network User Equilibrium”, INFORMS Annual Meeting 2009, San Diego, Oct 11-14, 2009 17. Kwon, C., R. Batta and Y. Kang^⋆, “Joint Toll Pricing for Hazardous Material Transport and Regular Traffic”, 20th International Symposium on Mathematical Programming (ISMP 2009), Aug 23-28, 2009 18. Friesz, T. L., T. I. Kim, C. Kwon, D. Bernstein and T. Yao, “Advances in Modeling Dynamic Network User Equilibrium and Dynamic Congestion Pricing”, 1st Transatlantic NECTAR Conference 2009, Arlington, VA, Jun 18-20, 2009 19. Friesz, T. L., I. Lee and C. Kwon, “Modelling Competitive Supply Chains Using Differential Variational Inequalities”, 1st Transatlantic NECTAR Conference 2009, Arlington, VA, Jun 18-20, 2009 20. Moon, Y. and C. Kwon, “Online Advertisement Service Pricing and Option”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009 21. Kang, Y.^⋆, R. Batta and C. Kwon, “Toll-based Simulation Model for Hazardous Material Transport”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009 22. Kwon, C., “Differentiated Service Pricing and Demand Learning”, IIE Annual Conference and Expo 2009, Miami, May 30 - Jun 3, 2009 23. Friesz, T. L., C. Kwon, T. I. Kim and M. A. Rigdon, “Dynamic Congestion Pricing: Models and Computational Methods”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008 24. Friesz, T. L., M. A. Rigdon, T. I. Kim and C. Kwon, “Dual Time Scale Dynamic User Equilibria with Demand Growth: Formulation and a Convergent Algorithm”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008 25. Kwon, C., M. A. Rigdon and T. L. Friesz, “Robust Optimal Control with an Application to Inventory Management”, INFORMS Annual Meeting 2008, Washington DC, Oct 12-15, 2008 26. Friesz, T. L., C. Kwon and T. I. Kim, “A Continuous Time Dynamic Model of Competitive Facility Location”, ISOLDE XI - 11th International Symposium on Locational Decisions, Santa Barbara, CA, USA, June 26 - July 1, 2008 27. Friesz, T. L., C. Kwon and M. A. Rigdon, “Computation of Prices in Competitive, Dynamic Service Networks”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007 28. Kwon, C. and T. L. Friesz, “A Descent Method for Differential VIs Arising in Non-Cooperative Differential Nash Equilibrium”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007 29. Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng, “Non-cooperative Competition among Revenue Maximizing Service Providers with Demand Learning”, INFORMS Annual Meeting 2007, Seattle, Nov 4-7, 2007 30. Kwon, C., T. L. Friesz, R. Mookherjee, T. Yao and B. Feng, “Non-cooperative Competition Among Revenue Maximizing Service Providers with Demand Learning”, 12th MSOM conference, Beijing, China, June 18 - 19, 2007 31. Kwon, C., T. L. Friesz, Y. Moon, T. Yao and T. Kim, “Valuation of Real Options by the Gradient Projection Method”, 11th Annual International Conference on Real options, Berkeley, CA, USA, June 6-9, 2007 32. Kwon, C. and T. L. Friesz, “A Multi-Period Game-Theoretic Pricing Model for Differentiated Service”, Canadian Operational Research Society: Annual Meeting 2007, London, Ontario, Canada, May 14-16, 2007 33. Kwon, C., T. L. Friesz, C.-C. Lin, “A Descent Method for Differential Variational Inequalities Arising in Computations of Non-Cooperative Differential Nash Equilibrium”, Ninth Workshop on Optimal Control, Dynamic Games and Nonlinear Dynamics, Montreal, Canada, May 7-9, 2007 Invited Seminars 1. Seoul National University, Korea, Department of Industrial Engineering, Jan 9, 2012 2. Ajou Unversity, Korea, School of Environmental, Civil and Transportation Engineering, Dec 19, 2011 3. University at Buffalo, SUNY, Department of Operations Management and Strategy and Department of Management Science and Systems, Sep 30, 2009 4. Chonbuk National University, Korea, Department of Industrial and Information Systems Engineering, July 16, 2009 5. Korea Advanced Institute of Science and Technology (KAIST), Department of Industrial and Systems Engineering, June 5, 2008 6. National University of Singapore, Department of Industrial and Systems Engineering, May 8, 2008 7. University at Buffalo, SUNY, Department of Industrial and Systems Engineering, May 1, 2008 8. University of Miami, Department of Industrial and Systems Engineering, April 25, 2008 9. ETH Zurich, Institute for Operations Research, April 4, 2008 7 Honors and Awards Finalist, Service Science Section Best Paper Competition, INFORMS, 2009 UUP Professional Development Award, University at Buffalo, 2009 Graduate Scholarship by the Korea Science and Engineering Foundation (KOSEF), 2003 - 2005 Merit-based Undergraduate Scholarship at KAIST, 1996 - 2000 8 Services Service to Profession Editorial Services Editorial Advisory Board Member, Handbook of Research on Industrial Informatics and Manufacturing Intelligence: Innovations and Solutions, 2010 - 2011 Associate Editor, Networks and Spatial Economics, 2009 - Editorial Board Member, Int. Journal of Services Operations and Informatics, 2009 - Ad-Hoc Reviewer for Computational Optimization and Applications - 2010 Dynamic Games and Applications - 2011 European Journal of Operational Research - 2007(x3), 2008, 2009(x2), 2010, 2011(x2) IEEE Systems Journal - 2012 IEEE Transactions on Engineering Management - 2011 International Journal of Network Management - 2008 International Conference of Chinese Transportation Professionals - 2011(x5) International Conference on Information Systems - 2010 Journal of Operations Management - 2009, 2010 Journal of the Operational Research Society - 2011 Mathematical and Computer Modelling - 2012 Networks and Spatial Economics - 2006, 2007(x2), 2008(x2), 2009, 2010 OMEGA - The International Journal of Management Science - 2011 Transportation Research Part B - 2008, 2009(x4), 2010(x2) Socio-Economic Planning Sciences - 2010 Member of Institute for Operations Research and the Management Sciences (INFORMS) Webmaster, Revenue Management and Pricing Section, 2010 Session Chair, Transportation Network Security and Alternative Modes, INFORMS 2011 Session Chair, Hazardous Material Transportation, INFORMS 2010 Institute of Industrial Engineers (IIE) Session Chair, Transportation and Logistics Applications, IERC 2009 Mathematical Optimization Society (MOS) Session Chair, Transportation and Logistics Applications, ISMP 2009 Mineta Transportation Institute Research Associate since 2010 Upstate New York Society of Risk Analysis Secretary, 2010 Services to the University at Buffalo ISE Research Area Coordinator - Transportation and Logistics, 2011 - Academic Integrity and Grievance Committee, 2010 - Faculty Senate Alternate (to Dr. Ann Bisantz), 2010 - 2012 Department of Industrial and Systems Engineering, Graduate Affairs Committee, 2009 - Service Engineering Graduate Program Committee, University at Buffalo, 2008 - 2009 Faculty Marshal, UB Engineering Commencement, May 9, 2009 UB2020 Scholars Fund - Proposal Review Panel, University at Buffalo, 2009 The Interdisciplinary Research Development Fund - Proposal Review Panel, University at Buffalo, 2008 9 Teaching Instructor IE 320 Engineering Economy Spring 2012, Enrollment: 133 IE 326 Planning for Production Fall 2011, Enrollment: 22 Fall 2010, Enrollment: 38 Fall 2009, Enrollment: 30 Fall 2008, Enrollment: 30 IE 459/514 Revenue Management Spring 2011, Enrollment: 33 Spring 2010, Enrollment: 18 Spring 2009, Enrollment: 10 IE 671 Nonlinear Programming Fall 2011, Enrollment: 11 Fall 2009, Enrollment: 17 IE 677 Network Optimization Fall 2010, Enrollment: 15 Guest Lecturer IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2011 IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2010 IE 101 Discover Industrial and Systems Engineering, UB, Spring, 2009 IE 589 Dynamic Optimization and Differential Games, Penn State, Fall 2007 IE 521 Nonlinear Programming, Penn State, Spring 2007 10 Student Advising Ph.D. Students Supervised Masoumeh Taslimi (expected graduation: May 2014; co-advising with Dr. Rajan Batta) Tolou Esfandeh (expected graduation: May 2014; co-advising with Dr. Rajan Batta) Md. Tanveer Ahmed (expected graduation: May 2012), ”Revenue Management for Online Advertisement Services” Paul Berglund (expected graduation: May 2012), ”Competitive Facility Location Problems” Yingying Kang (graduated in May 2011; co-advised with Dr. Rajan Batta), ”Value-at-Risk Models for Hazardous Materials Transportation” M.S. Students Supervised Iakovos Toumazis (expected graduation: May 2012), “Worst-Case Conditional Value-at-Risk Model for Hazardous Materials Transportation” Harshalkumar Patel (expected graduation: May 2012), “Real-Time Optimization for Online Advertisements” Jiashan Wang (graduated in Sep 2010), non-thesis option, placement upon graduation: Ph.D. student, Department of Mathematics, University of Washington, Seattle Anand Srinivasan (graduated in Aug 2010), “Operations of Online Advertising Services and Publisher’s Options”, placement upon graduation: Operations Research Analyst at Revenue Analytics, Atlanta, GA Amod Anand Agashe (graduated in May 2010), “Stochastic Revenue Optimization in Online Advertising”, placement upon graduation: Yield Optimization Analyst at Pubmatics, Pune, India Varun Narayanan Kutty (graduated in May 2010), “Accept-Reject Decision in Online Advertising using Geometric Brownian Motion”, placement upon graduation: Business Technology Analyst at Deloitte, New York, NY Dissertation Committee Member of Ting-Shu Hung, ISE, UB (Chair: Rakesh Nagi) Fei He, ISE, UB (Chair: Jun Zhuang) Sabrina Casucci, ISE, UB (Chair: Li Lin) Younggi Song, ISE, UB (Chair: Rakesh Nagi) Yidong Zhang, ISE, UB (Chair: Mark Karwan) Satheeshkumar Seenivasan, Marketing, UB (Chair: Debabrata Talukdar; graduated in 2011) Vijay Ganesh Hariharan, Marketing, UB (Chair: Debabrata Talukdar; graduated in 2010) Graduate Students with Individual Problems Jihong Jang, ISE, UB, “Call Center Outsourcing Contract Problems”, Fall 2010 Taewoo Jung, Economics, UB, “Retailer-Supplier Matching Algorithm”, Fall 2010 Undergraduate Students with Independent Studies Kristen M. Colley, ISE, UB, “Revenue Management”, Spring 2011 Amy Deuell, ISE, UB, “Revenue Management”, Spring 2011 Glen Fernandes, ISE, UB, “Revenue Management and Price Optimization”, Spring 2010 Abdurlrhman Alshibake, ISE, UB, “Project Scheduling”, Fall 2009 Undergraduate Students with Honor Project Hao Chen, ISE, UB, “Practices and Regulations in Hazardous Materials Routing”, IE 326, Fall 2011 11 Industrial Experience Web Applications Programmer, Division of Internet Business, Leecom Information System, Seoul, Korea, 2000 - 2003 Intern, R&D Center, Korea Delphi Automotive Systems Corporation, Daegu, Korea, 1999 12 Certificate National Information Processing Engineer Certificate, Korea Speciality includes Database, Computer Structure, Operation Systems, Software Engineering, and Data Communication ___________________________________________________________________________________
Contact Information: Phone (716) 645-4705, Fax (716) 645-3302, E-mail: chkwon@buffalo.edu 400 Bell Hall, University at Buffalo, SUNY, Buffalo, NY 14260