6734225
Supply chain networks, electronic commerce, and supply side and demand side risk
In this paper, we develop a supply chain network model in which both physical and electronic transactions are allowed and in which supply side risk as well as demand side risk are included in the formulation. The model consists of three tiers of decision-makers: the manufacturers, the distributors, and the retailers, with the demands associated with the retail outlets being random. We model the optimizing behavior of the various decision-makers, with the manufacturers and the distributors being multicriteria decision-makers and concerned with both profit maximization and risk minimization. We derive the equilibrium conditions and establish the finite-dimensional variational inequality formulation. We provide qualitative properties of the equilibrium pattern in terms of existence and uniqueness results and also establish conditions under which the proposed computational procedure is guaranteed to converge. We illustrate the supply chain network model through several numerical examples for which the equilibrium prices and product shipments are computed. This is the first multitiered supply chain network equilibrium model with electronic commerce and with supply side and demand side risk for which modeling, qualitative analysis, and computational results have been obtained.
11522705
A supply chain network equilibrium model with random demands
Abstract In this paper, we develop a supply chain network model consisting of manufacturers and retailers in which the demands associated with the retail outlets are random. We model the optimizing behavior of the various decision-makers, derive the equilibrium conditions, and establish the finite-dimensional variational inequality formulation. We provide qualitative properties of the equilibrium pattern in terms of existence and uniqueness results and also establish conditions under which the proposed computational procedure is guaranteed to converge. Finally, we illustrate the model through several numerical examples for which the equilibrium prices and product shipments are computed. This is the first supply chain network equilibrium model with random demands for which modeling, qualitative analysis, and computational results have been obtained.
10882024
Frame problem in dynamic logic
This paper provides a formal analysis on the solutions of the frame problem by using dynamic logic. We encode Pednault's syntax-based solution, Baker's state-minimization policy, and Gelfond & Lifchitz's Action Language A in the propositional dynamic logic (PDL). The formal relationships among these solutions are given. The results of the paper show that dynamic logic, as one of the formalisms for reasoning about dynamic domains, can be used as a formal tool for comparing, analyzing and unifying logics of action.
129481
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a k-anonymous table with quality guarantee. First, we prove that it is NP-hard both to find the table with the maximum quality, and to discover a solution with an approximation ratio at most 5/4. Then, we develop an algorithm with good balance between the approximation ratio and time complexity. The quality of our solution is verified by experiments.
9693532
Negotiation mechanism for TAC SCM component market
This paper presents a new negotiation mechanism and a new supplier model for Trading Agent Competition Supply Chain Management(TAC SCM). Under the new negotiation mechanism, an agent is allowed to negotiate with component suppliers on price, delivery date and supply quantity while a supplier can autonomously vary its production capacity with market demands and allocate its products to buyers through auction. A mathematical analysis is given to ensure the new negotiation mechanism and supplier model effectively solve the existing problems while keeping most good features of the original TAC SCM game model.
8107681
A Computational Model of Logic-Based Negotiation
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining game without using lotteries. Its game-theoretic properties are discussed against the existence and uniqueness of Nash equilibrium and subgame perfect equilibrium. We also study essential computational properties in relation to our negotiation model. In particular, we show that the deal membership checking is DP-complete and the corresponding agreement inference problem is Π2P-hard.
18058823
A novel Web usage mining approach for search engines
Abstract Web usage mining can be very useful to search engines. This paper proposes a novel effective approach to exploit the relationships among users, queries and resources based on the search engine's log. How this method can be applied is illustrated by a Chinese image search engine.