ACM Home Page
Please provide us with feedback. Feedback
An alternating offers bargaining model for computationally limited agents
Full text PdfPdf (153 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1 table of contents
Bologna, Italy
SESSION: Session 1B: bidding and bargaining agents I table of contents
Pages: 135 - 142  
Year of Publication: 2002
ISBN:1-58113-480-0
Authors
Kate Larson  Carnegie Mellon University, Pittsburgh, PA
Tuomas Sandholm  Carnegie Mellon University, Pittsburgh, PA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 25,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/544741.544774
What is a DOI?

ABSTRACT

An alternating offers bargaining model for computationally limited agents is presented. The gents compute to determine plans, but deadlines restrict them from determining an optimal solution. As the agents compute, they also negotiate over whether to perform a joint plan or whether to act independently and how, if implemented, the value of the joint plan would be divided. Their computing actions and bargaining actions are interrelated and both incorporated into each agent's strategy. We analyze the model for equilibrium strategies for agents under different conditions. It is shown that the equilibrium strategies for the alternating offers model where agents take turns making offers and counter-offers, even with its extremely large action space, are equivalent to those of a much simpler single shot, take--it--or--leave--it bargaining model. In particular, agents will compute and make no offers until the first agent's deadline.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
about beliefs and actions under computational resource constraints. In 3rd Workshop on Uncertainty in AI, pages 429--444, Seattle, 1987.
 
4
P. Jehiel. Limited horizon forecast in repeated alternate games. Journal of Economic Theory, 67:497--519, 1995.
 
5
D. Koller, N. Megiddo, and B. Stengel. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior, 14(2):247--259, 1996.
 
6
 
7
 
8
 
9
A. Mas-Colell, M. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995.
 
10
M. J. Osborne and A. Rubinstein. Bargaining and Markets. Academic Press, Inc., 1990.
 
11
 
12
A. Rubinstein. Perfect equilibrium in a bargaining model. Econometrica, 50:97--109, 1982.
 
13
A. Rubinstein. Modeling Bounded Rationality. MIT Press, 1998.
 
14
 
15
 
16
T. Sandholm. Issues in computational Vickrey auctions. International Journal of Electronic Commerce, 4(3):107--129, 2000.
 
17
 
18
 
19
H. Simon. Models of bounded rationality, vol. 2. MIT Press, 1982.
 
20

CITED BY  8

Collaborative Colleagues:
Kate Larson: colleagues
Tuomas Sandholm: colleagues