Bargaining with limited computation: Deliberation equilibrium

Artificial Intelligence

Volumn 132, Issue 2, 2001, Pages 183-217

  Larson, Kate ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Anytime algorithm; Automated negotiation; Bargaining; Bounded rationality; Game theory; Multiagent systems; Resource bounded reasoning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GAME THEORY; MULTI AGENT SYSTEMS;

RESOURCE-BOUNDED REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0035501436     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00132-1     Document Type: Article

References (42)

1. The structure of Nash equilibrium in repeated games with finite automata
2. A Bayesian approach to relevance in game playing
3. Deliberation scheduling for problem solving in time-constrained environments
4. A survey of research in deliberative real-time artificial intelligence
5. Bounded versus unbounded rationality: The tyranny of the weak
6. Twenty-seven principles of rationality
7. Monitoring and control of anytime algorithms: A dynamic programming approach
8. Principles and applications of continual computation
9. Reasoning about beliefs and actions under computational resource constraints
10. Reasoning under varying and uncertain resource constraints
11. Limited horizon forecast in repeated alternate games
12. Optimization by simulated annealing
13. Efficient computation of equilibria for extensive two-person games
14. Multiagent negotiation under time constraints
15. Computationally limited agents in auctions
16. Costly valuation computation in auctions
17. Equilibrium points in n-person games
18. On complexity as bounded rationality
19. Optimal auction design for agents with hard valuation problems
20. Rationality and intelligence
21. Provably bounded-optimal agents
22. Principles of metareasoning
23. Bounded rationality and game theory
24. An implementation of the contract net protocol based on marginal cost calculations
25. Issues in computational Vickrey auctions
26. Special Issue on Applying Intelligent Agents for Electronic Commerce
27. Coalitions among computationally bounded agents
28. Special issue on economic principles of multiagent systems
29. A new method for solving hard satisfiability problems
30. Efficient computation of behavior strategies
31. Computing equilibria for two-person games
32. Real-time problem solving with contract algorithms
33. Optimal composition of real-time systems