skip to main content
10.1145/2383276.2383290acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Combining adaptive goal-driven agents with mixed multi-unit combinatorial auctions

Published: 22 June 2012 Publication History

Abstract

This paper considers planning algorithms of adaptive bounded rational goal-driven agents. Plans are assumed to be correlated. Parallels to mixed multi-unit combinatorial auctions are highlighted. Possibilities of using available solutions for the winner determination problem of these auctions in the planning context are discussed. A novel algorithm is presented, where plan combinations are a heuristic that reduces the search space but keeps agents adaptive.

References

[1]
K. Aardal and F. Eisenbrand, "Integer Programming, Lattices, and Results in Fixed Dimension," in Discrete Optimization, Handbooks in Operations Research and Management Science, vol. 12, K. Aardal, G. L. Nemhauser and R. Weismantel, Eds., The Netherlands, Elsevier, 2005, pp. 171--243.
[2]
P. Almajano, J. Cerquides and J. A. Rodriguez-Aguilar, "Empirical Hardness for Mixed Auctions," in Current Topics in Artificial Intelligence, Lecture Notes in Computer Science, vol. 5988/2010, P. Meseguer, L. Mandow and R. M. Gasca, Eds., Berlin/Heidelberg, Springer Verlag, 2010, pp. 161--170.
[3]
J. Cerquides, U. Endriss, A. Giovanucci and J. A. Rodriguez-Aguilar, "Bidding Languages and Winner Determination for Mixed Muti-unit Combinatorial Auctions," in Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007.
[4]
A. M. Colman, Ed., A Dictionary of Psychology, 3rd ed., New York: Oxford University Press, 2009.
[5]
A. Giovannucci, M. Vinyals, J. A. Rodriguez-Aguilar and J. Cerquides, "Computationally-efficient winner determination for mixed multi-unit combinatorial auctions," in Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems, Richland, SC, 2008.
[6]
D. Hand, H. Mannila and P. Smyth, Principles of Data Mining, Cambridge, MA: The MIT Press, 2001.
[7]
T. Phung, M. Winikoff and L. Padgham, "Learning Within the BDI Framework: An Empirical Analysis," in Knowledge-Based Intelligent Information and Engineering Systems, Lecture Notes in Computer Science, vol. 3683/2005, R. Khosla, R. Howlett and L. Jain, Eds., Berlin/Heidelberg, Springer, 2005, pp. 282--288.
[8]
A. S. Rao and M. P. Georgeff, "BDI Agents: From Theory to Practice," in Proceedings of the First International Conference on Multiagent Systems, Cambridge, 1995.
[9]
H. A. Simon, Models of Man, Social and Rational: Mathematical Essays on Rational Human Behavior in a Social Setting, New York: Wiley, 1957.
[10]
B. Subagdja, L. Sonenberg and I. Rahwan, "Intentional learning agent architecture," Autonomous Agents and Multi-Agent Systems, vol. 18, no. 3, pp. 417--470, 2009.
[11]
A.-H. Tan, Y.-S. Ong and A. Tapanuj, "A hybrid agent architecture integrating desire, intention and reinforcement learning," Expert Systems with Applications, vol. 38, no. 7, pp. 8477--8487, 2011.
[12]
R. J. Urbanowicz and J. H. Moore, "Learning Classifier Systems: A Complete Introduction, Review, and Roadmap," Journal of Artificial Evolution and Applications, 2009.
[13]
T. Wagner and V. Lesser, "Toward Ubiquitous Satisficing Agent Control," in Papers from the 1998 AAAI Spring Symposium on Satisficing Models, Menlo Park, California, 1998.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. adaptive behaviour
  2. agent
  3. bounded rationality
  4. mixed multi-unit combinatorial auction
  5. planning

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 49
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media