• Title/Summary/Keyword: Pareto solution

Search Result 128, Processing Time 0.024 seconds

Beamforming Games with Quantized CSI in Two-user MISO ICs (두 유저 MISO 간섭 채널에서 불완전한 채널 정보에 기반한 빔포밍 게임)

  • Lee, Jung Hoon;Lee, Jin;Ryu, Jong Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1299-1305
    • /
    • 2017
  • In this paper, we consider a beamforming game between the transmitters in a two-user multiple-input single-output interference channel using limited feedback and investigate how each transmitter is able to find a modified strategy from the quantized channel state information (CSI). In the beamforming game, each of the transmitters (i.e., a player) tries to maximize the achievable rate (i.e., a payoff function) via a proper beamforming strategy. In our case, each transmitter's beamforming strategy is represented by a linear combining factor between the maximum ratio transmission (MRT) and the zero forcing (ZF) beamforming vectors, which is the Pareto optimal achieving strategy. With the quantized CSI, the transmitters' strategies may not be valid because of the quantization errors. We propose a modified solution, which takes into account the effects of the quantization errors.

A Study on the Agency Theory and Accounting (에이전시이론과 회계감사에 관한 연구)

  • 공해영
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.12 no.20
    • /
    • pp.123-138
    • /
    • 1989
  • The primary objective of the agency research in the game theory lives in the maintenance of Pareto is optimal condition for the optimal incentive contract. The basic concepts which are related to this objective are reviewed in connection with the general assumptions to model it, the moral hazard and adverse selection which arised from the information asymmetry, and finally the problem of risk distribution. The demand for auditing and the role of auditor have been addressed by ASOBAC. Issues which an auditor is explicitly introduced in a principal-agent framework have been addressed in this paper. These issues must be confronted to appropriately with the auditor, and to achieve an adequate understanding of optimal confronting arrangement with the auditor. The first step in introducing an auditor into this analysis is to examine the game-theoretic foundation of such a expended agency model. The Mathematical program formulated may not yield solution that are resonable. This arises because the program may call for the auditor and manager to play dominated Nash equilibra in some subgame. The nontrivial natures of the subgame implies that randomized strategies by the auditor and manager nay be of crucial importance. The possibilities for overcoming the randomized strategy problem were suggested; change the rule of the game and or impose covexity condition. The former seems unjustifiable in on auditing context, and the latter promising but difficult to achieve. The discussion ended with an extension of the revelation principle to the owner manager-auditor game, assuming strategies. An examination of the restriction and improvement direction of the basic concept of agency theory was addressed in the later part of this paper. Many important aspects of auditor incentives are inherently multiple-agent, multiple-period, multiple-objectine, phenomena and require further analyses and researches.

  • PDF

Model Updating of a RC Frame Building using Response Surface Method and Multiobjective Optimization (반응표면법 및 다목적 최적화를 이용한 철근콘크리트 건물모델의 모델 개선)

  • Lee, Sang-Hyun;Yu, Eunjong
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.30 no.1
    • /
    • pp.39-46
    • /
    • 2017
  • In this paper, a model updating procedure based on the response surface method combined with the multi-objective optimization was proposed and applied for updating of the FE models representing a low-rise reinforced concrete building before and after the seismic retrofit. The dynamic properties to be matched were obtained from vibration tests using a small shaker system. By varying the structural parameters according to the central composite design, analysis results from the initial FE model using a commercial software were collected and used to produce two regression functions each of which representing the errors in the natural frequencies and mode shapes. The two functions were used as the objective functions for multi-objective optimization. Final solution was determined by examining the Pareto solutions with one iteration. The parameters representing the stiffnesses of existing concrete, masonry, connection stiffness in expansion joint, new concrete, retrofitted members with steel section jacketing were selected and identified.

Multiobjective optimization strategy based on kriging metamodel and its application to design of axial piston pumps (크리깅 메타모델에 기반한 다목적최적설계 전략과 액셜 피스톤 펌프 설계에의 응용)

  • Jeong, Jong Hyun;Baek, Seok Heum;Suh, Yong Kweon
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.8
    • /
    • pp.893-904
    • /
    • 2013
  • In this paper, a Kriging metamodel-based multi-objective optimization strategy in conjunction with an NSGA-II(non-dominated sorted genetic algorithm-II) has been employed to optimize the valve-plate shape of the axial piston pump utilizing 3D CFD simulations. The optimization process for minimum pressure ripple and maximum pump efficiency is composed of two steps; (1) CFD simulation of the piston pump operation with various combination of six parameters selected based on the optimization principle, and (2) applying a multi-objective optimization approach based on the NSGA-II using the CFD data set to evaluate the Pareto front. Our exploration shows that we can choose an optimal trade-off solution combination to reach a target efficiency of the axial piston pump with minimum pressure ripple.

An Optimal Intermodal-Transport Algorithm using Dynamic Programming (동적 프로그래밍을 이용한 최적복합운송 알고리즘)

  • Cho Jae-Hyung;Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Kang Moo-Hong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.20-33
    • /
    • 2006
  • Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

  • PDF

Performance Evaluation of QoS-based Web Services Selection Models (QoS 기반 웹 서비스 선택 모형의 성능 평가)

  • Seo, Sang-Koo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.43-52
    • /
    • 2007
  • As the number of public Web Services increases, there will be many services with the same functionality. These services. however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a best service while satisfying given QoS constraints. This paper brings parallel branching and response time constraint of business processes into focus and investigates several service selection plans based on multidimensional multiple choice Knapsack model. Specifically. proposed in the paper are a plan with response time constraints for each execution flow, a plan with a single constraint over the whole service types and a plan with a constraint on a particular execution path of a composite Web Services. Experiments are conducted to observe the performance of each plan with varying the number of services, the number of branches and the values of response time constraint. Experimental results show that reducing the number of candidate services using Pareto Dominance is very effective and the plan with a constraint over the whole service types is efficient in time and solution quality for small to medium size problems.

  • PDF

Design Optimization for 3D Woven Materials Based on Regression Analysis (회귀 분석에 기반한 3차원 엮임 재료의 최적설계)

  • Byungmo, Kim;Kichan, Sim;Seung-Hyun, Ha
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.6
    • /
    • pp.351-356
    • /
    • 2022
  • In this paper, we present the regression analysis and design optimization for improving the permeability of 3D woven materials based on numerical analysis data. First, the parametric analysis model is generated with variables that define the gap sizes between each directional wire of the woven material. Then, material properties such as bulk modulus, thermal conductivity coefficient, and permeability are calculated using numerical analysis, and these material data are used in the polynomial-based regression analysis. The Pareto optimal solution is obtained between bulk modulus and permeability by using multi-objective optimization and shows their trade-off relation. In addition, gradient-based design optimization is applied to maximize the fluid permeability for 3D woven materials, and the optimal designs are obtained according to the various minimum bulk modulus constraints. Finally, the optimal solutions from regression equations are verified to demonstrate the accuracy of the proposed method.

An Optimal Intermodal-Transport Algorithm using Dynamic Programming (동적 프로그래밍을 이용한 최적복합운송 알고리즘)

  • Cho Jae-Hyung;Kim Hyun-Soo;Choi Hyung-Rim;Park Nam-Kyu;Kim So-Yeon
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2006.05a
    • /
    • pp.95-108
    • /
    • 2006
  • Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

  • PDF