Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm.
Nicola GattiFrancesco Di GiuntaStefano MarinoPublished in: Artif. Intell. (2008)
Keyphrases
- dynamic programming
- experimental evaluation
- improved algorithm
- matching algorithm
- computationally efficient
- cost function
- np hard
- detection algorithm
- preprocessing
- high accuracy
- memory efficient
- incomplete information
- optimization algorithm
- linear programming
- learning algorithm
- theoretical analysis
- computational complexity
- objective function
- genetic algorithm
- worst case
- recognition algorithm
- convergence rate
- reinforcement learning
- times faster
- path planning
- search space
- significant improvement
- expectation maximization
- computational cost
- simulated annealing
- probabilistic model