| Janos A. Csirik, Michael L. Littman, Satinder Singh, and Peter Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Second International Workshop on Electronic Commerce (WELCOM-2001. |
....a packet is lost. Allocation may also be performed at intermediate routers in the network. Using per flow state at network routers to decide which packet to send from the queue allows for fair allocation of bandwidth among the flows [4] Auctions have been used to dynamically allocate bandwidth [3]. However, little work has been done to allow auctions to provide fair, predictable allocation of network bandwidth. We build upon previous work by using auctions to: 1. Bring applications into the control loop. In particular, a client can signal its demand for a resource by altering its bid. ....
J. Csirik, M. Littman, S. Singh, and P. Stone, "FaucS: An FCC Spectrum Auction Simulator for Autonomous Bidding Agents", Second International Workshop on Electronic Commerce, November 2001.
No context found.
Janos A. Csirik, Michael L. Littman, Satinder Singh, and Peter Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Second International Workshop on Electronic Commerce (WELCOM-2001.
.... (e.g. on eBay) Bidding agents that support dependent values among multiple interacting goods have been deployed in some experimental scenarios [5, 10, 8] Here, we present agent bidding strategies in a large scale and realistic auction scenario, namely the FCC Spectrum Auction Simulator, or FAucS [1]. Here, we build on our previous work in FAucS, in which we created Knapsack agents that optimized the set of goods they bid on given a budget constraint, but not taking into account the needs and strategies of other agents [1] In this previous work we also created alternative agent strategies ....
.... auction scenario, namely the FCC Spectrum Auction Simulator, or FAucS [1] Here, we build on our previous work in FAucS, in which we created Knapsack agents that optimized the set of goods they bid on given a budget constraint, but not taking into account the needs and strategies of other agents [1]. In this previous work we also created alternative agent strategies that outperformed the Knapsack agents, but that relied on the unrealistic assumption that agents knew each other s valuations of the goods with complete certainty. In this paper, we present punishing randomized strategic demand ....
[Article contains additional citation context not shown here]
J. A. Csirik, M. L. Littman, S. Singh, and P. Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In L. Fiege, G. Muhl, and U. Wilhelm, editors, Electronic Commerce: Proceedings of the Second International Workshop, pages 139--151, Heidelberg, Germany, 2001. Springer Verlag.
....a specified radio spectrum band within a specified geographical area, or market. Typically several licenses are auctioned off simultaneously with bidders placing independent bids for each license. The most recent auction brought in over 16 billion dollars. In a detailed simulation of this domain [3], we discovered a novel, successful bidding strategy in this domain that allows the bidders to increase their profits significantly over a reasonable default strategy [14] Our ongoing research agenda includes applying our approach to other similar domains. We particularly expect the boosting ....
Janos A. Csirik, Michael L. Littman, Satinder Singh, and Peter Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Ludger Fiege, Gero Muhl, and Uwe Wilhelm, editors, Electronic Commerce: Proceedings of the Second International Workshop, pages 139--151, Heidelberg, Germany, 2001. Springer Verlag.
....SYSTEMS (AAMAS 2002) October, 2001. We build on our previous work in the FCC Spectrum Auction Simulator, or FAucS, in which we created Knapsack agents that optimized the set of goods they bid on given a budget constraint, but not taking into account the needs and strategies of other agents [1]. In this paper, we present a strategy by which cooperative agents can signi cantly outperform the Knapsack agents despite having highly uncertain knowledge regarding each others goals and without any explicit inter agent communication. We also present a suggestion on how to improve the eciency ....
....in Sections 2 and 3. Details of the RSDR algorithm appear in Sections 4 and 5. Empirical results demonstrating its utility and robustness are presented in Section 6, and Section 7 concludes. 2. FCCSPECTRUMAUCTIONSIMULATOR The substrate domain for the research presented in this paper is FAucS [1], a detailed and realistic simulator of the FCC Spectrum Auctions. The goods available in the FCC spectrum auctions are a set of licenses, or blocks of spectrum; each in a market, or region of the United States. In this paper we focus on FCC Auction 35, in which licenses were 10 or 15 megahertz in ....
[Article contains additional citation context not shown here]
J. A. Csirik, M. L. Littman, S. Singh, and P. Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Proceedings of the Second International Workshop on Electronic Commerce, 2001. To appear. Available at http://www.research.att.com/~pstone/papers.html.
....strategies in such future 6. This change has been adopted in the specification of TAC 01. 204 ATTac 2000: An Adaptive Autonomous Bidding Agent auctions. Indeed, in related research we have begun down this path by creating straightforward bidding agents in a realistic FCC Auction Simulator (Csirik, Littman, Singh, Stone, 2001). In a more obvious application, an extended version of ATTac 2000 could potentially become useful to real travel agents, or to end users who wish to create their own travel packages. Acknowledgements We would like to thank the TAC team at the University of Michigan, including Michael Wellman, ....
Csirik, J. A., Littman, M. L., Singh, S., & Stone, P. (2001). FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Proceedings of the Second International Workshop on Electronic Commerce. To appear. Available at http://www.research.att.com/~pstone/papers.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC