Results 261 to 270 of about 4,391,403 (298)
Some of the next articles are maybe not open access.
On stochastic optimal bidding strategy for microgrids
2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC), 2015In this paper, we addressed the issue of a stochastic optimal bidding problem for a system with microgrids (MGs). The optimal bidding problem is formulated as a two-stage stochastic programming process, which aims to minimize the system operation cost and to expand energy interactions among local MGs that are geographically close.
Qingyu Yang 0003 +4 more
openaire +1 more source
A Competitive-Bidding Strategy
Operations Research, 1956A method is presented that determines optimum bids in a competitive-bidding situation where each competitor submits one closed bid. The number of bidders may be large or may be unknown. This method makes use of the previous “bidding patterns” of all possible opposition bidders and in the case where the bidding is on contracts, the estimated ...
openaire +1 more source
A comparison of bidding strategies for simultaneous auctions
ACM SIGecom Exchanges, 2006Bidding for multiple items or bundles on online auctions raise challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary bundle. In the real world all or most of the items of interest to an agent is not present in a single combinatorial auction.
Teddy Candale, Sandip Sen
openaire +2 more sources
2011 International Conference on Management and Service Science, 2011
The paper models the toehold acquisition and bid price decision problem faced by bidders in takeovers. The model builds upon the model of takeover proposed by Grossman and Hart (1980) and its later extensions by Shleifer and Vishny (1986) , Hirshleifer and Titman (1990) and Chowdhry and Jegadeesh (1994).
openaire +1 more source
The paper models the toehold acquisition and bid price decision problem faced by bidders in takeovers. The model builds upon the model of takeover proposed by Grossman and Hart (1980) and its later extensions by Shleifer and Vishny (1986) , Hirshleifer and Titman (1990) and Chowdhry and Jegadeesh (1994).
openaire +1 more source
Bidding Strategies and Probabilities
Journal of the Construction Division, 1967Seven competitive bidding strategies for optimizing profits in construction contracting are developed; namely: (1) Lone Bidder Strategy—no competitors; (2) Two Bidders Strategy—one competitor; (3) Many Bidders Strategy—more than one competitor, number and identity of competitors not known; (4) All Bidders Known Strategy—more than one competitor, number
openaire +1 more source
Evaluating bidding strategies for simultaneous auctions
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, 2006Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary bundle. In the real world all or most of the items of interest to an agent is not present in a single combinatorial auction. We study the problem of bidding for multiple items
Teddy Candale, Sandip Sen
openaire +2 more sources
Journal of Petroleum Technology, 1965
Abstract This paper describes the development of a strategy for sealed bidding on undeveloped leases, which is designed to acquire a maximum number of tracts of acceptable profitability for a given amount of capital.
openaire +1 more source
Abstract This paper describes the development of a strategy for sealed bidding on undeveloped leases, which is designed to acquire a maximum number of tracts of acceptable profitability for a given amount of capital.
openaire +1 more source
Agents’ Bidding Strategies in a Combinatorial Auction
2006This paper presents an agent-based simulation environment for task scheduling in a grid. Resource allocation is performed by an iterative combinatorial auction in which proxy-bidding agents try to acquire their desired resource allocation profiles. To achieve an efficient bidding process, the auctioneer provides the bidding agents with approximated ...
Tim Stockheim +2 more
openaire +1 more source
Adaptive soft bid determination in bidding strategies for continuous double auctions
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005There are several bidding strategies proposed in the literature for agents in continuous double auctions (CDAs). For most bidding strategies, the asks or bids determined are hard and cannot be compromised. However, for human traders, we notice that the decisions are usually soft and adaptive in different situations.
Huiye Ma, Ho-fung Leung
openaire +2 more sources
2015
Imagine you are bidding at an English auction in a traditional auction house. The item is an antique jewelry case meant to be a birthday present for your wife. You have a concrete idea of how much you want to pay maximum for it, because you have already found a case somewhere else that would cost 150 euros.
openaire +1 more source
Imagine you are bidding at an English auction in a traditional auction house. The item is an antique jewelry case meant to be a birthday present for your wife. You have a concrete idea of how much you want to pay maximum for it, because you have already found a case somewhere else that would cost 150 euros.
openaire +1 more source