Bidders with Hard Valuation Problems

摘要

Auctions provide efficient 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 computing resources to determine 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 different auction settings (both single-item and combinatorial) are analyzed in order to determine equilibrium strategies. We show that in some auction mechanisms, but not others, in equilibrium the bidders compute on others' problems as well. We show that the model of bounded rationality (limited or costly computing) impacts the agents' equilibrium strategies and so must be considered when designing mechanisms for computationally limited agents.