Guaranteed Performance Regions for Markov Models

Simple item page
dc.contributor.authorShimkin, N.en_US
dc.contributor.authorShwartz, A.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:47:16Z
dc.date.available2007-05-23T09:47:16Z
dc.date.issued1991en_US
dc.description.abstractA user facing a multi-user resource-sharing system considers a vector of performance measures (e.g. response times to various tasks). Acceptable performance is defined through a set in the space of performance vectors. Can the user obtain a (time- average) performance vector which approaches this desired set? We consider the worst-case scenario, where other users may, for selfish reasons, try to exclude his vector from the desired set. For a Markovian model of the system, we give a sufficient condition for approachability (which is also necessary for convex sets), and construct appropriate policies. The mathematical formulation leads to an approachability theory for stochastic games.en_US
dc.format.extent689395 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5056
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1991-8en_US
dc.subjectnetwork managementen_US
dc.subjectqueueing networksen_US
dc.subjectstochastic gamesen_US
dc.subjectdiscrete event dynamical systemsen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleGuaranteed Performance Regions for Markov Modelsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_91-8.pdf
Size:
673.24 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports