• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.719-730
• /
• 1997

From a minimax inequality related to admissible multimaps, we deduce generalized versions of lopsided saddle point theorems, fixed point theorems, existence of maximizable linear functionals, the Walras excess demand theorem, and the Gale-Nikaido-Debreu theorem.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.68-74
• /
• 2010

This paper suggest a new ACS algorithm to solve SMP which was solved by Gale-Shapley algorithm. The stable marriage problem is an extensively-studied combinatorial problem with many practical applications. The classical Gale-Shapley algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. In this paper we apply ACS algorithm to SMP to find 4 kinds of solutions such as stable matching with man-optimal, woman-optimal, egalitarian stable matching, sex-fair stable matching. So this ACS is a novel method to solve Stable Marriage Problem. Our simulation results show the effectiveness of the proposed ACS.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.759-766
• /
• 1995

In this paper, we give equivalent forms of the selection theorem of Ding-Kim-Tan. As applications of the selection theorem of Ding-Kim-Tan, we obtain a fixed point theroem of Gale and Mas-Colell type and establish an equilibrium existence theorem for a qualitative game under suitable assumptions in a locally convex Hausdorff topological vector space.

• Journal of the Chungcheong Mathematical Society
• /
• v.7 no.1
• /
• pp.47-51
• /
• 1994

The purpose of this note is to give a new selection theorem which is an essential tool for proving the new kind of existence theorem of the equilibrium price comparable to the Debreu-Gale-Nikaido theorem.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2019.05a
• /
• pp.343-344
• /
• 2019

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2016.10a
• /
• pp.345-346
• /
• 2016

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.197-199
• /
• 2016

In this paper, we investigate a market equilibrium in multi-channel sharing cognitive radio networks (CRNs): it is assumed that every subchannel is orthogonally licensed to a single primary user (PU), and can be shared with multiple secondary users (SUs). We model this sharing as a spectrum market where PUs offer SUs their subchannels with limiting the interference from SUs; the SUs purchase the right to transmit over the subchannels while observing the interference limits set by the PUs and their budget constraints. The utility function of SU is defined as least achievable transmission rate, and that of PU is given by the net profit. We define a market equilibrium in the context of extended Fisher model, and show that the equilibrium is yielded by solving an optimization problem, Eisenberg-Gale convex program.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.107-112
• /
• 2015

This paper proposes a simplified algorithm devised to obtain optimal solution to the marriage problem. In solving this problem, the most widely resorted to is the Gale-Shapley algorithm with the time complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$. The proposed algorithm on the other hand firstly constructs a $p_{ij}$ matrix of inter-preference sum both sexes' preference over the opposite sex. Secondly, it selects $_{min}p_i$ from each row to establish ${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$, ${\mid}p_{.j}{\mid}=1$, $j{\in}H$, ${\mid}p_{.j}{\mid}=0$, $j{\in}T$. Finally, it shifts $_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$ for $_{min}P_{ST}$ of $S{\rightarrow}T$ and $p_{SH}+p_{HT}$, $p_{HT}<_{min}p_{ST}$ of $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm has not only improved the Gale-Shapley's algorithm's complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$ to $O({\mid}V{\mid}^2)$ but also proved its extendable use on unbalanced marriage problems.

• Digital Contents
• /
• no.6 s.1
• /
• pp.58-63
• /
• 1993

이글은 美 Gale Research Inc.에서 전세계적으로 유명한 3개 DB디렉토리를 종합하여 발간한 'Gate Directory of Databases'(93년 1월판)중에서 세계적으로 유수한 DB 7,907개를 분석한 일리노이대 마르타 E.윌리엄스의 글을 번역, 요약한 것으로 앞으로 3회에 걸쳐 게재할 예정임.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2050-2077
• /
• 2015

One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.