Back to Results
First PageMeta Content
Operations research / Science / Dynamic programming / Markov processes / Stochastic control / Reinforcement learning / Mechanism design / Markov decision process / Vickrey–Clarke–Groves auction / Statistics / Control theory / Game theory


Approximately Efficient Online Mechanism Design David C. Parkes DEAS, Maxwell-Dworkin Harvard University
Add to Reading List

Document Date: 2005-01-05 13:04:15

Open Document

File Size: 132,16 KB

Share Result on Facebook

City

New York / /

Company

Satinder Singh Comp / Neural Information Processing Systems / MIT Press / Life Support Systems / John Wiley & Sons / Starbucks / /

Currency

pence / /

/

IndustryTerm

large systems / on-line auctions / online auctions / Online Mechanism Design In / Online Mechanism Design David C. Parkes DEAS / approximation algorithm / real applications / Online VCG mechanism / static systems / e - commerce / online mechanism / sparse sampling algorithm / Online mechanism design / sparse-sampling algorithm / Online VCG The WiFi Problem The WiFi problem / /

Organization

Harvard University / MIT / University of Michigan / Harvard College / /

Person

Eric Friedman / Ron Lavi / Martin J Osborne / Noam Nisan / David C. Parkes / Michael Kearns / Andrew Y Ng / Ariel Rubinstein / Yishay Mansour / Matthew O. Jackson / Mansour / Dimah Yanovsky / /

Position

central planner / planner / /

ProvinceOrState

New York / Michigan / /

Technology

RAM / sparse-sampling-based MDP algorithms / approximation algorithm / sparse-sampling algorithm / sparse sampling algorithm / /

SocialTag