Results 1  10
of
206
Issues in multiagent resource allocation
 INFORMATICA
, 2006
"... The allocation of resources within a system of autonomous agents, that not only have preferences over alternative allocations of resources but also actively participate in computing an allocation, is an exciting area of research at the interface of Computer Science and Economics. This paper is a sur ..."
Abstract

Cited by 95 (17 self)
 Add to MetaCart
(Show Context)
The allocation of resources within a system of autonomous agents, that not only have preferences over alternative allocations of resources but also actively participate in computing an allocation, is an exciting area of research at the interface of Computer Science and Economics. This paper is a survey of some of the most salient issues in Multiagent Resource Allocation. In particular, we review various languages to represent the preferences of agents over alternative allocations of resources as well as different measures of social welfare to assess the overall quality of an allocation. We also discuss pertinent issues regarding allocation procedures and present important complexity results. Our presentation of theoretical issues is complemented by a discussion of software packages for the simulation of agentbased market places. We also introduce four major application areas for Multiagent Resource Allocation, namely industrial procurement, sharing of satellite resources, manufacturing control, and grid computing.
Optimization via simulation: a review
 Annals of Operations Research
, 1994
"... We review techniques for optimizing stochastic discreteevent systems via simulation. We discuss both the discrete parameter case and the continuous parameter case, but concentrate on the latter which has dominated most of the recent research in the area. For the discrete parameter case, we focus on ..."
Abstract

Cited by 79 (21 self)
 Add to MetaCart
(Show Context)
We review techniques for optimizing stochastic discreteevent systems via simulation. We discuss both the discrete parameter case and the continuous parameter case, but concentrate on the latter which has dominated most of the recent research in the area. For the discrete parameter case, we focus on the techniques for optimization from a finite set: multiplecomparison procedures and rankingandselection procedures. For the continuous parameter case, we focus on gradientbased methods, including perturbation analysis, the likelihood ratio method, and frequency domain experimentation. For illustrative purposes, we compare and contrast the implementation of the techniques for some simple discreteevent systems such as the (s, S) inventory system and the GI/G/1 queue. Finally, we speculate on future directions for the field, particularly in the context of the rapid advances being made in parallel computing.
Coverage enhancement through twohop relaying in cellular radio systems
 in Proc. IEEE Wireless Communications, Networking Conf
"... Relaying is found in Packet Radio and Adhoc networks whereby communications between mobile terminals are carried out in a distributed manner through intermediate relay nodes. When employed in a cellular network, this technique can be regarded as an Opportunity Driven Multiple Access (ODMA) scheme w ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
(Show Context)
Relaying is found in Packet Radio and Adhoc networks whereby communications between mobile terminals are carried out in a distributed manner through intermediate relay nodes. When employed in a cellular network, this technique can be regarded as an Opportunity Driven Multiple Access (ODMA) scheme where relaying is turned to when communications to and from the base station for a certain mobile terminal are poor due to a lack of LOS (Line of Sight) or severe multipath fading. There are many open challenges regarding this technology when incorporated into a cellular network, and they include: routing (or relay node/path selection) algorithms, channel allocation for relaying purposes, radio signal propagation characteristics between low height terminals, users ’ cooperation, and security. In this thesis, a simulation approach is taken to investigate the impact of different relay node/path selection and channel selection schemes (from among all employing channels already used in the adjacent cells) for relaying purposes on the users coverage, with and without power control. Our simulation results demonstrate that with a good relay node/path selection
Bayesian Analysis For Simulation Input And Output
, 1997
"... The paper summarizes some important results at the intersection of the fields of Bayesian statistics and stochastic simulation. Two statistical analysis issues for stochastic simulation are discussed in further detail from a Bayesian perspective. First, a review of recent work in input distribution ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
The paper summarizes some important results at the intersection of the fields of Bayesian statistics and stochastic simulation. Two statistical analysis issues for stochastic simulation are discussed in further detail from a Bayesian perspective. First, a review of recent work in input distribution selection is presented. Then, a new Bayesian formulation for the problem of output analysis for a single system is presented. A key feature is analyzing simulation output as a random variable whose parameters are an unknown function of the simulation's inputs. The distribution of those parameters is inferred from simulation output via Bayesian responsesurface methods. A brief summary of Bayesian inference and decision making is included for reference.
Replicating online Yankee auctions to analyze auctioneers’ and bidders’ strategies
 Information Systems Research
, 2003
"... We present a simulation approach that provides a relatively riskfree and costeffective environment to examine the decision space for both bid takers and bid makers in webbased dynamic price setting processes. The applicability of the simulation platform is demonstrated for Yankee auctions in part ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
(Show Context)
We present a simulation approach that provides a relatively riskfree and costeffective environment to examine the decision space for both bid takers and bid makers in webbased dynamic price setting processes. The applicability of the simulation platform is demonstrated for Yankee auctions in particular. We focus on the optimization of bid takers’ revenue, as well as on examining the welfare implications of a range of consumerbidding strategies—some observed, some hypothetical. While these progressive open discriminatory multiunit auctions with discrete bid increments are made feasible by Internet technologies, little is known about their structural characteristics, or their allocative efficiency. The multiunit and discrete nature of these mechanisms renders the traditional analytic framework of gametheory intractable (Nautz and Wolfstetter 1997). The simulation is based on theoretical revenue generating properties of these auctions. We use empirical data from real online auctions to instantiate the simulation’s parameters. For example, the bidding strategies of the bidders are specified based on three broad bidding strategies observed in real online auctions. The validity of the simulation model is established and subsequently the simulation model is configured to change the values of key control factors, such as the bid increment.
Experimenting different software architectures performance techniques
 In Proc. of WOSP
, 1994
"... In this paper we describe our experience in performance analysis of the software architecture of the NICE case study which is responsible for providing several secure communications in a naval communication system. We applied two complementary techniques, one based on stochastic process algebras and ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
(Show Context)
In this paper we describe our experience in performance analysis of the software architecture of the NICE case study which is responsible for providing several secure communications in a naval communication system. We applied two complementary techniques, one based on stochastic process algebras and one based on simulation, in order to derive some performance indices at the software architectural level. The case study analysis allows us to point out the relative merit of the considered techniques including the performance model derivation, the type of analysis and performance results that we can carry out, and the feedback at the design level, e.g. performance results interpretation that we obtain. Finally, we discuss how to take advantage of the integration of different techniques in software architecture performance analysis.
Unsynchronized Parallel Discrete Event Simulation
, 1998
"... Distributedsynchronizationforparallelsimulationisgenerallyclassifiedasbeingeitheroptimisticorconservative. Whileconsiderableinvestigationshavebeenconducted toanalyzeandoptimizeeachofthesesynchronization strategies,verylittlestudyonthedefinitionandstrictness ofcausalityhavebeenconducted.Dowereallynee ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
Distributedsynchronizationforparallelsimulationisgenerallyclassifiedasbeingeitheroptimisticorconservative. Whileconsiderableinvestigationshavebeenconducted toanalyzeandoptimizeeachofthesesynchronization strategies,verylittlestudyonthedefinitionandstrictness ofcausalityhavebeenconducted.Dowereallyneed topreservecausalityinalltypesofsimulations?This paperattemptstoanswerthisquestion.Wearguethat significantperformancegainscanbemadebyreconsideringthisdefinitiontodecideiftheparallelsimulation needstopreservecausality.Weinvestigatethefeasibility ofunsynchronizedparallelsimulationthroughtheuseof severalqueuingmodelsimulationsandpresentacomparativeanalysisbetweenunsynchronizedandTimeWarp simulation.
Distributed Simulation of DEVS and CellDEVS Models in CD++ using WebServices”. Simulation Modelling Practice and Theory 16
, 2008
"... ABSTRACT: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. CellDEVS is a DEVSbased formalism that defines spatial models as a cell space assembled of a group of DEVS models connected together. CD++ is a modeling and simulation t ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
(Show Context)
ABSTRACT: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. CellDEVS is a DEVSbased formalism that defines spatial models as a cell space assembled of a group of DEVS models connected together. CD++ is a modeling and simulation toolkit capable of executing DEVS and CellDEVS models that has proven to be useful for executing complex models. We present the design and implementation of a distributed simulation engine, known as DCD++, which exposes CD++ simulation utilities as machineconsumable services. In addition, we present the design and implementation of the WebService components which enable DCD++ to expose the simulation functionalities to remote users. Enabling CD++ with WebServices technology provides a solid framework for interoperating different DEVS implementations in order to achieve a standard DEVS modeling language and simulation protocols. This paves the road towards DEVS standardization, while providing a mashup approach, which can lead to higher degree of reuse and reduced time to set up and run experiments, and making sharing among remote users more effective. To prove this fact, we integrate it within larger services (such as a 3D visualization engine), showing the mechanism to incorporate to other environments (including Geographical Information Systems, webbased applications and other Modeling and simulation tools) through using standard WebService tools. Performance of DCD++, major bottleneck s and communication overheads are analyzed. 1.
Efficient Simulation of Network Performance by Importance Sampling
 In 15th International Teletraffic Congress (ITC15
, 1997
"... This paper proposes an adaptive strategy to optimise the simulation parameters involved when importance sampling is applied on balanced multidimensional problems, such as a queuing network with equal loads on all queues. This extends previous results which apply only to singledimensional or unbala ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
This paper proposes an adaptive strategy to optimise the simulation parameters involved when importance sampling is applied on balanced multidimensional problems, such as a queuing network with equal loads on all queues. This extends previous results which apply only to singledimensional or unbalanced multidimensional problems. The effectiveness and flexibility of this strategy are demonstrated on a network example comprising 12 links and 8 nodes. Both network dimensioning and dependability aspects of this network are evaluated using the same modelling framework and optimisation strategy. 1 INTRODUCTION
Perfect simulation of queueing networks with blocking and rejection
 In Saint, IEEE Symposium on Applications and the Internet
"... Traditional product form property of Markovian queueing networks usually is vanished when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson [11] perfect simulation, is applied to the finite capacity queues context. W ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
Traditional product form property of Markovian queueing networks usually is vanished when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson [11] perfect simulation, is applied to the finite capacity queues context. We present an algorithm to sample directly states of the network according to stationary distribution. This method has been applied to large queueing networks and some examples are given: loss estimation on Erlang models, usage of the last queue in a line of queues with blocking, saturation estimation for a multistage interconnection switch. 1.