Computationally Limited Agents in Auctions

@inproceedings{Larson2001ComputationallyLA,
  title={Computationally Limited Agents in Auctions},
  author={Kate Larson},
  year={2001}
}
Auctions provide eÆcient and distributed ways of allocating goods and tasks among agents. In this paper we study optimal strategies for computationally limited agents, where agents must use their limited resources in order to compute valuations for (bundles of) the items being auctioned. Agents are free to compute on any valuation problems including their opponents'. The deliberation actions are incorporated into the agents' strategies and di erent auction settings (both single{item and… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

International Journal of Electronic Commerce

  • Tuomas W Sandholm. Issues in computational Vickrey auctions
  • 4(3):107{129,
  • 2000
Highly Influential
3 Excerpts

Auctions and bidding: A primer

  • Paul Milgrom
  • Journal of Economic Perspectives, 3(3):3{22,
  • 1989
Highly Influential
3 Excerpts

In To appear in Theoretical Aspects of Rationality and Knowledge (TARK VII)

  • Kate Larson, Tuomas Sandholm. Costly valuation computation in auctions
  • Siena, Italy, July
  • 2001
1 Excerpt

A behavorial model of rational choice

  • Herbert A Simon
  • Quarterly Journal of Economics
  • 2000

In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC)

  • Noam Nisan, Amir Ronen. Computationally feasible VCG mechanisms
  • pages 242{252, Minneapolis, MN,
  • 2000
1 Excerpt

Kate Larson and Tuomas Sandholm . Costly valuation computation in auctions

  • Daniel Lehmann, Lidian Ita O'Callaghan, Yoav Shoham
  • To appear in Theoretical Aspects of Rationality…
  • 2000

Similar Papers

Loading similar papers…