skip to content
A sublinear-time randomized approximation algorithm for matrix games Preview this item
ClosePreview this item
Checking...

A sublinear-time randomized approximation algorithm for matrix games

Author: Michael D Grigoriadis; Leonid Khachiyan
Publisher: New Brunswick, N.J. : Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research, [1994]
Series: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "This paper presents a parallel randomized algorithm which computes a pair of [epsilon]-optimal strategies for a given (m, n)- matrix game A = [a[subscript i, subscript j]] [is in the set of] [-1,1] in O([epsilon][superscript-2] log² (n + m)) expected time on an (n + m) / log (n + m)-processor EREW PRAM. This algorithm is a natural extension of the classical method of fictitious play by Brown and Robinson.  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael D Grigoriadis; Leonid Khachiyan
OCLC Number: 33248849
Notes: "April 15, 1994."
Description: 8 pages ; 28 cm.
Series Title: Rutgers University.; Department of Computer Science.; Laboratory for Computer Science Research.; Technical report
Responsibility: M.D. Grigoriadis and L.G. Khachiyan.

Abstract:

Abstract: "This paper presents a parallel randomized algorithm which computes a pair of [epsilon]-optimal strategies for a given (m, n)- matrix game A = [a[subscript i, subscript j]] [is in the set of] [-1,1] in O([epsilon][superscript-2] log² (n + m)) expected time on an (n + m) / log (n + m)-processor EREW PRAM. This algorithm is a natural extension of the classical method of fictitious play by Brown and Robinson. For any fixed accuracy [epsilon]> 0, the expected sequential running time of the suggested algorithm is O((n + m) log (n + m)), which is sublinear in mn, the number of input elements of A. On the other hand, simple arguments are given to show that for [epsilon] <1/2, any sequential deterministic algorithm for computing a pair of [epsilon]-optimal strategies of an (m, n)- matrix game A with [plus or minus] 1 elements examines [omega] (m, n) of its elements. In particular, for m = n the randomized algorithm achieves an almost quadratic expected speedup relative to any deterministic method."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/33248849> # A sublinear-time randomized approximation algorithm for matrix games
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "33248849" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/38480954#Place/new_brunswick_n_j> ; # New Brunswick, N.J.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nju> ;
   schema:about <http://id.worldcat.org/fast/811829> ; # Approximation theory
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/38480954#Person/khachiyan_leonid> ; # Leonid Khachiyan
   schema:creator <http://experiment.worldcat.org/entity/work/data/38480954#Person/grigoriadis_michael_d> ; # Michael D. Grigoriadis
   schema:datePublished "1994" ;
   schema:description "Abstract: "This paper presents a parallel randomized algorithm which computes a pair of [epsilon]-optimal strategies for a given (m, n)- matrix game A = [a[subscript i, subscript j]] [is in the set of] [-1,1] in O([epsilon][superscript-2] log² (n + m)) expected time on an (n + m) / log (n + m)-processor EREW PRAM. This algorithm is a natural extension of the classical method of fictitious play by Brown and Robinson. For any fixed accuracy [epsilon]> 0, the expected sequential running time of the suggested algorithm is O((n + m) log (n + m)), which is sublinear in mn, the number of input elements of A. On the other hand, simple arguments are given to show that for [epsilon] <1/2, any sequential deterministic algorithm for computing a pair of [epsilon]-optimal strategies of an (m, n)- matrix game A with [plus or minus] 1 elements examines [omega] (m, n) of its elements. In particular, for m = n the randomized algorithm achieves an almost quadratic expected speedup relative to any deterministic method.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/38480954> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/38480954#Series/technical_report> ; # Technical report ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/38480954#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
   schema:name "A sublinear-time randomized approximation algorithm for matrix games"@en ;
   schema:productID "33248849" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/33248849#PublicationEvent/new_brunswick_n_j_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research_1994> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/38480954#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/33248849> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/38480954#Agent/rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research
    a bgn:Agent ;
   schema:name "Rutgers University, Dept. of Computer Science, Laboratory for Computer Science Research" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
    a schema:Organization ;
   schema:name "Rutgers University. Department of Computer Science. Laboratory for Computer Science Research." ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Person/grigoriadis_michael_d> # Michael D. Grigoriadis
    a schema:Person ;
   schema:familyName "Grigoriadis" ;
   schema:givenName "Michael D." ;
   schema:name "Michael D. Grigoriadis" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Person/khachiyan_leonid> # Leonid Khachiyan
    a schema:Person ;
   schema:familyName "Khachiyan" ;
   schema:givenName "Leonid" ;
   schema:name "Leonid Khachiyan" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Place/new_brunswick_n_j> # New Brunswick, N.J.
    a schema:Place ;
   schema:name "New Brunswick, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/38480954#Organization/rutgers_university_department_of_computer_science_laboratory_for_computer_science_research> ; # Rutgers University. Department of Computer Science. Laboratory for Computer Science Research.
   schema:hasPart <http://www.worldcat.org/oclc/33248849> ; # A sublinear-time randomized approximation algorithm for matrix games
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/38480954#Series/technical_report_rutgers_university_dept_of_computer_science_laboratory_for_computer_science_research> # Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/33248849> ; # A sublinear-time randomized approximation algorithm for matrix games
   schema:name "Technical report. Rutgers University. Dept. of Computer Science. Laboratory for Computer Science Research ;" ;
    .

<http://id.worldcat.org/fast/811829> # Approximation theory
    a schema:Intangible ;
   schema:name "Approximation theory"@en ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.