Back to Results
First PageMeta Content
Analysis of algorithms / Online algorithms / Probabilistic complexity theory / Randomized algorithm / Competitive analysis / Algorithm / Time complexity / Reduction / Auction algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics


Reducing Truth-telling Online Mechanisms to Online Optimization Baruch Awerbuch Yossi Azar
Add to Reading List

Document Date: 2007-10-09 11:16:16


Open Document

File Size: 149,44 KB

Share Result on Facebook

City

San Diego / /

Company

Tomkins / Computer-Communication Networks / /

Country

United States / /

Currency

USD / /

/

Facility

Computer Science Johns Hopkins University / Computer Science Carnegie-Mellon University / /

IndustryTerm

online computation / online optimization algorithm / optimization algorithm / given online algorithm / online resource allocation / approximation algorithm / online polynomial-time optimally-competitive truthtelling mechanisms / black box algorithm / exponential cost algorithm / unit-capacity network / offline omniscient algorithm / Incentive-compatible online auctions / possible online algorithm / Online Optimization Baruch Awerbuch Yossi Azar / above algorithm / online setting / online optimization function / omniscient algorithm / approximation algorithms / on-line auctions / basic online optimization problems / optimization algorithms / online scenario / online truthtelling mechanisms / feasible solution / online routing / polynomial time algorithm / given online optimization algorithm / profit-competitive truthtelling online mechanism designs / Online interval scheduling / throughput-competitive algorithm / deterministic online algorithm / online auctioning / auction algorithm / online optimization problems / online optimization / online algorithm / deterministic algorithm / e - commerce / Online Mechanisms / Online algorithms / online truthtelling mechanism / on-line routing / communication network / arbitrary nice online optimization algorithm / alternate solution / online competitive algorithm / black box online algorithm / generic online algorithm / online black box / online combinatorial auctions / /

Organization

School of Computer Science Tel-Aviv University Tel-Aviv / Israel Science Foundation / Johns Hopkins University / Q1 / US Federal Reserve / European Union / Computer Science Carnegie-Mellon University Pittsburgh / /

Person

Baruch Awerbuch Yossi Azar / Adam Meyerson / /

/

Position

A. Archer / k-trees and prize-collecting salesman / Problems General / auctioneer / /

ProvinceOrState

California / /

PublishedMedium

Journal of Finance / Theory of Computing / /

Technology

auction algorithm / online algorithm / above algorithm / black box online algorithm / randomized algorithm / following algorithm / given online optimization algorithm / polynomial time algorithm / generic online algorithm / Multicast Algorithm / i∈A i∈A∗ This algorithm / exponential cost algorithm / deterministic online algorithm / arbitrary nice online optimization algorithm / The algorithm / exponential-cost routing algorithm / optimization algorithm / black box algorithm / load balancing / omniscient algorithm / approximation algorithm / possible online algorithm / optimization algorithms / deterministic algorithm / online optimization algorithm / approximation algorithms / nice algorithm / offline omniscient algorithm / truthtelling algorithm / given online algorithm / Network Protocols / specifying a polynomial time algorithm / /

SocialTag