Back to Results
First PageMeta Content
Mathematical optimization / Dynamic programming / Markov decision process / Stochastic control / Reinforcement learning / Linear programming / Simplex algorithm / Statistics / Operations research / Mathematics


A subexponential lower bound for Zadeh’s pivoting rule for solving linear programs and games Oliver Friedmann Department of Computer Science, University of Munich,
Add to Reading List

Document Date: 2012-02-10 07:43:23

Open Document

File Size: 426,79 KB

Share Result on Facebook

/

Facility

University of Munich / /

IndustryTerm

simplex algorithm / basic feasible solutions / simplex algorithms / policy iteration algorithms / basic feasible solution / policy iteration algorithm / iteration algorithms / simplex-type algorithms / /

Organization

Oliver Friedmann Department of Computer Science / University of Munich / /

Person

Ai / Oliver Friedmann / Kalai / /

Position

inactive representative / mathematical model for sequential decision making under uncertainty / representative for i / active representative for i / representative / active representative / player / controller / /

Product

Bang & Olufsen Form 2 Headphone/Headset / /

Technology

policy iteration algorithms / simplex-type algorithms / Least-Entered algorithm / simplex algorithms / Random-Facet algorithm / simplex-based algorithms / asymptotic 6 Oliver Friedmann Algorithm / machine learning / 3 Policy iteration algorithms / artificial intelligence / policy iteration algorithm / simplex algorithm / /

SocialTag