As traditional commerce moves on-line more business transactions will be mediated by software agents, and the ability of agentmediated electronic marketplaces to e ciently allocate resources will be highly dependent on the complexity of the decision problems that agents face; determined in part by the structure of the marketplace, resource characteristics, and the nature of agents' local proble...

We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent decision processes. An online algorithm is also proposed for coordinating the agents. We finally compared our approach empirically to existing methods.

We consider the learning problem under an online Markov decision process (MDP) aimed at learning the time-dependent decision-making policy of an agent that minimizes the regret-the difference from the best fixed policy. The difficulty of online MDP learning is that the reward function changes over time. In this letter, we show that a simple online policy gradient algorithm achieves regret O(√T)...

Background: Online judgment is an economical and faster way than the judicial one. With the ‎development of technology in recent decades, it has also been possible to make judgments ‎online. Although few countries have incorporated this approach into their laws, online ‎judgments are being developed and implemented in various areas such as international trade or ‎intellectual property. The pres...

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...

the sensitivity analysis for multi-attribute decision making (madm) problems is important for two reasons: first, the decision matrix as the source of the results of a decision problem is inaccurate because it sorts the alternatives in each criterion inaccurately. second, the decision maker may change his opinions in a time period because of changes in the importance of the criteria and in the ...

As the Internet can aggregate and distribute a great amount of information to users, providing numerous products for consumers has been recognized as a major advantage of electronic commerce. Causing by the problem of information overload, however, consumers facing many alternatives on the online shop may feel hard to decide which one they prefer. Based on the theory of decision style and prosp...

This thesis presents new and improved scheduling algorithms for a number of scheduling problems. The first part of the thesis deals with two online-list scheduling problems, both with the objective to minimize the makespan. In these problems, the jobs arrive one by one and the decision maker has to irrevocably schedule the arriving job before the next job becomes known. In the second part, a ne...

background for the purpose of understanding the food and drug administration’s (fda’s) concerns regarding online promotion of prescription drugs advertised directly to consumers, this study examines notices of violations (novs) and warning letters issued by the fda to pharmaceutical manufacturers.   methods the fda’s warning letters and novs, which were issued to pharmaceutical companies over a...