Topic
Bidding
About: Bidding is a research topic. Over the lifetime, 15371 publications have been published within this topic receiving 294233 citations. The topic is also known as: competitive bidding.
Papers published on a yearly basis
Papers
More filters
•
01 Feb 2002TL;DR: In this paper, a system and method for enabling information providers using a computer network such as the Internet to influence a position for a search listing within a search result list generated by an Internet search engine is presented.
Abstract: A system and method for enabling information providers using a computer network such as the Internet to influence a position for a search listing within a search result list generated by an Internet search engine. A database stores accounts for the network information providers. Each account contains contact and billing information for a network information provider. In addition, each account contains at least one search listing having at least three components: a description, a search term comprising one or more keywords, and a bid amount. The network information provider may add, delete, or modify a search listing after authenticated login. A search term relevant to the content of the web site or other information source to be listed is first selected. A search listing includes the search term and a description. A bidding process occurs when the network information provider enters a new bid amount for a search listing. The system and method then compares the bid amount with all other bid amounts for the same search term, and generates a rank value for all search listings having that search term. The rank value determines where the listing will appear on the search results list page that is generated in response to a query of the search term by a searcher.
337 citations
••
TL;DR: An optimal day-ahead price-based power scheduling problem for a community-scale microgrid (MG) is studied and the great benefits in exploiting the building thermal dynamics and the flexibility of the proposed scheduling method in achieving different practical design tradeoffs are presented.
Abstract: In this paper, we study an optimal day-ahead price-based power scheduling problem for a community-scale microgrid (MG). The proposed optimization framework aims to balance between maximizing the expected benefit of the MG in the deregulated electricity market and minimizing the MG operation cost considering users' thermal comfort requirements and other system constraints. The power scheduling and bidding problem is formulated as a two-stage stochastic program where various system uncertainties are captured by using the Monte Carlo simulation approach. Our formulation is novel in that it can exploit the thermal dynamic characteristics of buildings to compensate for the variable and intermittent nature of renewable energy resources and enables us to achieve desirable tradeoffs for different conflicting design objectives. Extensive numerical results are presented to demonstrate the great benefits in exploiting the building thermal dynamics and the flexibility of the proposed scheduling method in achieving different practical design tradeoffs. We also investigate the impacts of different design and system parameters on the curtailment of renewable energy resources and the optimal expected profit of the MG.
337 citations
••
01 Dec 2005TL;DR: In this paper, a spectrum policy server (SPS) is used to allocate bandwidth portions for each user-operator session to maximize its overall expected revenue resulting from the operator payments.
Abstract: In this paper we develop a framework for competition of future operators likely to operate in a mixed commons/property-rights regime under the regulation of a spectrum policy server (SPS). The operators dynamically compete for customers as well as portions of available spectrum. The operators are charged by the SPS for the amount of bandwidth they use in their services. Through demand responsive pricing, the operators try to come up with convincing service offers for the customers, while trying to maximize their profits. We first consider a single-user system as an illustrative example. We formulate the competition between the operators as a non-cooperative game and propose an SPS-based iterative bidding scheme that results in a Nash equilibrium of the game. Numerical results suggest that, competition increases the user's (customer's) acceptance probability of the offered service, while reducing the profits achieved by the operators. It is also observed that as the cost of unit bandwidth increases relative to the cost of unit infrastructure (fixed cost), the operator with superior technology (higher fixed cost) becomes more competitive. We then extend the framework to a multiuser setting where the operators are competing for a number of users at once. We propose an SPS-based bandwidth allocation scheme in which the SPS optimally allocates bandwidth portions for each user-operator session to maximize its overall expected revenue resulting from the operator payments. Comparison of the performance of this scheme to one in which the bandwidth is equally shared between the user-operator pairs reveals that such an SPS-based scheme improves the user acceptance probabilities and the bandwidth utilization in multiuser systems
336 citations
••
334 citations
••
TL;DR: In this article, a public art exhibit of over 300 life-sized fiberglass cows that culminated in 140 Internet and live, in-person auctions is described. And the authors focus on the implications of these findings and on the broader issue of competitive arousal and escalation and their impact on decision-making.
333 citations