Remarks upon the auction systems, as practised in New-York: to which are added numerous facts in illustration.

Mode of access: Internet.

The ruinous tendency of auctioneering, and the necessity of restraining it for the benefit of trade,

Mode of access: Internet.

Le trésor de la curiosité : tiré des catalogues de ventes de tableaux, dessins, estampes, livres, marbres, bronzes, ivoires, terres cuites, vitraux, médailles, armes, porcelaines, meubles, émaux, lacques et autres objets d'art /

Mode of access: Internet.

Catalogue des tableaux anciens des écoles espagnole, italienne, flamande & hollandaise : composant la galerie de M. Le Mis. de Salamanca, vente en son Hôtel, à Paris, rue de la Victoire, 50, les lundi 3, mardi 4, mercredi 5 et jeudi 6 juin a deux heures précises; Charles Pillet, commissaire-priseur.

Mode of access: Internet.

Catalogue of the first portion of the famous stock of the late Mr. W.J. Leighton ... .

Bound with: Catalogue of the second portion ... (1919), Catalogue of the third portion ... (1919), Catalogue of the fourth portion ... (1920), Catalogue of the fifth portion ... (1921), Catalogue of the sixth portion ... (1922), Catalogue of the seventh & final portion ... (1923).

Book auction records.

Title varies slightly.

Essays on Procurement, Scoring Auction, and Quality Manipulation Corruption

Thesis (Ph.D.)--University of Washington, 2016-06

Nonparametric Identication and Structural Estimation of Auction Models

Thesis (Ph.D.)--University of Washington, 2016-06

Multi-threaded Communicating Agents in Qu-Prolog

In this tutorial paper we summarise the key features of the multi-threaded Qu-Prolog language for implementing multi-threaded communicating agent applications. Internal threads of an agent communicate using the shared dynamic database used as a generalisation of Linda tuple store. Threads in different agents, perhaps on different hosts, communicate using either a thread-to-thread store and forward communication system, or by a publish and subscribe mechanism in which messages are routed to their destinations based on content test subscriptions. We illustrate the features using an auction house application. This is fully distributed with multiple auctioneers and bidders which participate in simultaneous auctions. The application makes essential use of the three forms of inter-thread communication of Qu-Prolog. The agent bidding behaviour is specified graphically as a finite state automaton and its implementation is essentially the execution of its state transition function. The paper assumes familiarity with Prolog and the basic concepts of multi-agent systems.

Decentralised supply chain formation:a belief propagation-based approach

Decentralised supply chain formation involves determining the set of producers within a network able to supply goods to one or more consumers at the lowest cost. This problem is frequently tackled using auctions and negotiations. In this paper we show how it can be cast as an optimisation of a pairwise cost function. Optimising this class of functions is NP-hard but good approximations to the global minimum can be obtained using Loopy Belief Propagation (LBP). Here we detail a LBP-based approach to the supply chain formation problem, involving decentralised message-passing between potential participants. Our approach is evaluated against a well-known double-auction method and an optimal centralised technique, showing several improvements: it obtains better solutions for most networks that admit a competitive equilibrium Competitive equilibrium as defined in [3] is used as a means of classifying results on certain networks to allow for minor inefficiencies in their auction protocol and agent bidding strategies. while also solving problems where no competitive equilibrium exists, for which the double-auction method frequently produces inefficient solutions.

Decentralized supply chain formation using max-sum loopy belief propagation

Supply chain formation is the process by which a set of producers within a network determine the subset of these producers able to form a chain to supply goods to one or more consumers at the lowest cost. This problem has been tackled in a number of ways, including auctions, negotiations, and argumentation-based approaches. In this paper we show how this problem can be cast as an optimization of a pairwise cost function. Optimizing this class of energy functions is NP-hard but efficient approximations to the global minimum can be obtained using loopy belief propagation (LBP). Here we detail a max-sum LBP-based approach to the supply chain formation problem, involving decentralized message-passing between supply chain participants. Our approach is evaluated against a well-known decentralized double-auction method and an optimal centralized technique, showing several improvements on the auction method: it obtains better solutions for most network instances which allow for competitive equilibrium (Competitive equilibrium in Walsh and Wellman is a set of producer costs which permits a Pareto optimal state in which agents in the allocation receive non-negative surplus and agents not in the allocation would acquire non-positive surplus by participating in the supply chain) while also optimally solving problems where no competitive equilibrium exists, for which the double-auction method frequently produces inefficient solutions. © 2012 Wiley Periodicals, Inc.

Spectrum redistribution for cognitive radios using discriminatory spectrum double auction

With the reformation of spectrum policy and the development of cognitive radio, secondary users will be allowed to access spectrums licensed to primary users. Spectrum auctions can facilitate this secondary spectrum access in a market-driven way. To design an efficient auction framework, we first study the supply and demand pressures and the competitive equilibrium of the secondary spectrum market, considering the spectrum reusability. In well-designed auctions, competition among participants should lead to the competitive equilibrium according to the traditional economic point of view. Then, a discriminatory price spectrum double auction framework is proposed for this market. In this framework, rational participants compete with each other by using bidding prices, and their profits are guaranteed to be non-negative. A near-optimal heuristic algorithm is also proposed to solve the auction clearing problem of the proposed framework efficiently. Experimental results verify the efficiency of the proposed auction clearing algorithm and demonstrate that competition among secondary users and primary users can lead to the competitive equilibrium during auction iterations using the proposed auction framework. Copyright © 2011 John Wiley & Sons, Ltd.

How many contracts in an auction sale

Making sense of auction sales, in terms of English contract law, is no easy task. Despite the common perception of hammers hitting blocks, signifying the creation of the basic sale contract,1 a typical auction sale necessarily involves the making of several forms of contract other than the obvious primary sale agreement. The purpose of this article, therefore, is threefold, namely, to (1) examine these various forms of contractual relationship2 which may come into existence as a result of a traditional (face to face) auction sale; (2) consider specifically the selling of land at public auction with a view to advocating a change in the law requiring the formality of writing for sales contracts of land for both private and public auctions, and (3) compare briefly the contractual elements of an online ascending model of auction sale typified by the eBay phenomenon.

Improved adaptivity and robustness in decentralised multi-camera networks

In this paper we present increased adaptivity and robustness in distributed object tracking by multi-camera networks using a socio-economic mechanism for learning the vision graph. To build-up the vision graph autonomously within a distributed smart-camera network, we use an ant-colony inspired mechanism, which exchanges responsibility for tracking objects using Vickrey auctions. Employing the learnt vision graph allows the system to optimise its communication continuously. Since distributed smart camera networks are prone to uncertainties in individual cameras, such as failures or changes in extrinsic parameters, the vision graph should be sufficiently robust and adaptable during runtime to enable seamless tracking and optimised communication. To better reflect real smart-camera platforms and networks, we consider that communication and handover are not instantaneous, and that cameras may be added, removed or their properties changed during runtime. Using our dynamic socio-economic approach, the network is able to continue tracking objects well, despite all these uncertainties, and in some cases even with improved performance. This demonstrates the adaptivity and robustness of our approach.

Identificação das políticas de incentivo ao desenvolvimento da energia eólica no Rio Grande do Norte (RN)

Energy is a vital resource for social and economic development. In the present scenario, the search for alternative energy sources has become fundamental, especially after the oil crises between 1973 and 1979, the Chernobyl nuclear accident in 1986 and the Kyoto Protocol in 1997. The demand for the development of new alternative energy sources aims to complement existing forms allows to meet the demand for energy consumption with greater security. Brazil, with the guideline of not dirtying the energy matrix by the fossil fuels exploitation and the recent energy crisis caused by the lack of rains, directs energy policies for the development of other renewable energy sources, complementing the hydric. This country is one of the countries that stand out for power generation capacity from the winds in several areas, especially Rio Grande do Norte (RN), which is one of the states with highest installed power and great potential to be explored. In this context arises the purpose of this work to identify the incentive to develop policies of wind energy in Rio Grande do Norte. The study was conducted by a qualitative methodology of data analysis called content analysis, oriented for towards message characteristics, its informational value, the words, arguments and ideas expressed in it, constituting a thematic analysis. To collect the data interviews were conducted with managers of major organizations related to wind energy in Brazil and in the state of Rio Grande do Norte. The identification of incentive policies was achieved in three stages: the first seeking incentives policies in national terms, which are applied to all states, the second with the questionnaire application and the third to research and data collection for the development of the installed power of the RN as compared to other states. At the end, the results demonstrated hat in Rio Grande do Norte state there is no incentive policy for the development of wind power set and consolidated, specific actions in order to optimize the bureaucratic issues related to wind farms, especially on environmental issues. The absence of this policy hinders the development of wind energy RN, considering result in reduced competitiveness and performance in recent energy auctions. Among the perceived obstacles include the lack of hand labor sufficient to achieve the reporting and analysis of environmental licenses, the lack of updating the wind Atlas of the state, a shortfall of tax incentives. Added to these difficulties excel barriers in infrastructure and logistics, with the lack of a suitable port for large loads and the need for reform, maintenance and duplication of roads and highways that are still loss-making. It is suggested as future work the relationship of the technology park of energy and the development of wind power in the state, the influence of the technology park to attract businesses and industries in the wind sector to settle in RN and a comparison of incentive policies to development of wind energy in the Brazilian states observing wind development in the same states under study.