Back to Results
First PageMeta Content
Applied mathematics / Operations research / Marketing / Pricing / NP-complete problems / Continuous knapsack problem / Knapsack problem / Optimization problem / Price / Theoretical computer science / Computational complexity theory / Combinatorial optimization


Adaptive Pricing for Customers with Probabilistic Valuations Michael Benisch, James Andrews and Norman Sadeh School of Computer Science, Carnegie Mellon University Abstract. In this paper, we examine the problem of choo
Add to Reading List

Document Date: 2013-12-07 17:24:09

Open Document

File Size: 231,92 KB

Share Result on Facebook

Company

IBM / eBay / Sandholm and Suri / /

Currency

USD / /

Holiday

Assumption / /

IndustryTerm

polynomial time pricing algorithm / ǫ-optimal solution / ǫ-optimal solutions / heuristic algorithm / ǫ-optimal binary search algorithm / airline tickets / binary search technique / procedure binary search / alternate solution / feasible solution / ǫ-optimal algorithm / greedy algorithm / search effort / return binary search / numerical solution / binary search algorithm / /

Organization

Carnegie Mellon University / Norman Sadeh School of Computer Science / /

Person

Michael Benisch / James Andrews / /

ProvinceOrState

Oregon / /

Technology

greedy algorithm / heuristic algorithm / CKP algorithms / CKP algorithm / polynomial time pricing algorithm / binary search algorithm / artificial intelligence / PDA / /

SocialTag