Double Auction
A double auction is a process of buying and selling goods with multiple sellers and multiple buyers. Potential buyers submit their bids and potential sellers submit their ask prices to the market institution, and then the market institution chooses some price ''p'' that clears the market: all the sellers who asked less than ''p'' sell and all buyers who bid more than ''p'' buy at this price ''p''. Buyers and sellers that bid or ask for exactly ''p'' are also included. A common example of a double auction is stock exchange. As well as their direct interest, double auctions are reminiscent of Walrasian auction and have been used as a tool to study the determination of prices in ordinary markets. A double auction is also possible without any exchange of currency in barter trade. A barter double auction is an auction where every participant has a demand and an offer consisting of multiple attributes and no money is involved. For the mathematical modelling of satisfaction level Eucli ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Auction
An auction is usually a process of Trade, buying and selling Good (economics), goods or Service (economics), services by offering them up for Bidding, bids, taking bids, and then selling the item to the highest bidder or buying the item from the lowest bidder. Some exceptions to this definition exist and are described in the section about different #Types, types. The branch of economic theory dealing with auction types and participants' behavior in auctions is called auction theory. The open ascending price auction is arguably the most common form of auction and has been used throughout history. Participants bid openly against one another, with each subsequent bid being higher than the previous bid. An auctioneer may announce prices, while bidders submit bids vocally or electronically. Auctions are applied for trade in diverse #Contexts, contexts. These contexts include antiques, Art auction, paintings, rare collectibles, expensive wine auction, wines, commodity, commodities, l ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Natural Ordering
{{disambiguation ...
Natural order may refer to: Science * Natural order (philosophy), concept in philosophy * Natural order hypothesis, hypotheses of second-language acquisition * ''Ordo naturalis'', Latin for "natural order" once used to describe plant families * In enumeration, a natural ordering in which a set of items might be enumerated * The natural order defined for the monus operation, on monoids and semirings Music * ''Natural Order'' (album), 1990 album by Hellbastard Card games * Natural order (cards), the standard ranking of cards within a suit e.g. from Ace (high) to Deuce (low) or Deuce (high) to Seven (low) See also * Natural sort order In computing, natural sort order (or natural sorting) is the ordering of strings in alphabetical order, except that single- and multi-digit numbers are treated atomically, i.e., as if they were a single character, and compared between themselves ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Forest (graph Theory)
In graph theory, a tree is an undirected graph in which any two vertices are connected by path, or equivalently a connected acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees. A directed tree, oriented tree,See .See . polytree,See . or singly connected networkSee . is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. The various kinds of data structures referred to as trees in computer science have underlying graphs that are trees in graph theory, although such data structures are generally rooted trees. A rooted tree may be directed, called a directed rooted tree, either making all its edges point away from the root—in which case it is called an arborescence or out-tree—or ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ascending-price Mechanism
An English auction is an open-outcry ascending dynamic auction. It proceeds as follows. * The auctioneer opens the auction by announcing a suggested opening bid, a starting price, or a reserve for the item on sale. * Then the auctioneer accepts increasingly higher bids from the floor and sometimes from other sources, for example online or telephone bids. The auctioneer usually determines the minimum increment of bids, often making them larger as bidding reaches higher levels. * The highest bidder at any given moment is considered to have the standing bid, which can only be displaced by a higher bid from a competing buyer. * If no competing bidder challenges the standing bid within the time allowed by the auctioneer, the standing bid becomes the winner, and the item is sold to the highest bidder at a price equal to their bid. *If no bidder accepts the starting price, the auctioneer either begins to lower the starting price in increments, or bidders are allowed to bid prices lower ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Direct-revelation Mechanism
The revelation principle is a fundamental result in mechanism design, social choice theory, and game theory which shows it is always possible to design a strategy-resistant implementation of a social decision-making mechanism (such as an electoral system or market).Gibbard, A. 1973. Manipulation of voting schemes: a general result. Econometrica 41, 587–601. It can be seen as a kind of mirror image to Gibbard's theorem. The revelation principle says that if a social choice function can be implemented with some non-honest mechanism—one where players have an incentive to lie—the same function can be implemented by an incentive-compatible (honesty-promoting) mechanism with the same equilibrium outcome (payoffs). The revelation principle shows that, while Gibbard's theorem proves it is impossible to design a system that will always be fully invulnerable to strategy (if we do not know how players will behave), it ''is'' possible to design a system that encourages honesty given a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Directed Acyclic Graph
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called ''arcs''), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling). Directed acyclic graphs are also called acyclic directed graphs or acyclic digraphs. Definitions A graph is formed by vertices and by edges connecting pairs of vertices, where the vertices can be any kind of object that is connected in pairs by edges. In the case of a directed graph, each edg ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Supply Chain
A supply chain is a complex logistics system that consists of facilities that convert raw materials into finished products and distribute them to end consumers or end customers, while supply chain management deals with the flow of goods in distribution channels within the supply chain in the most efficient manner. In sophisticated supply chain systems, used products may re-enter the supply chain at any point where residual value is recyclable. Supply chains link value chains. Suppliers in a supply chain are often ranked by "tier", with first-tier suppliers supplying directly to the client, second-tier suppliers supplying to the first tier, and so on. The phrase "supply chain" may have been first published in a 1905 article in ''The Independent (New York City), The Independent'' which briefly mentions the difficulty of "keeping a supply chain with India unbroken" during the British expedition to Tibet. Overview A typical supply chain can be divided into two stages namely, produ ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Group Strategyproof
In mechanism design, a strategyproof (SP) mechanism is a game form in which each player has a weakly-dominant strategy, so that no player can gain by "spying" over the other players to know what they are going to play. When the players have private information (e.g. their type or their value to some item), and the strategy space of each player consists of the possible information values (e.g. possible types or values), a truthful mechanism is a game in which revealing the true information is a weakly-dominant strategy for each player. An SP mechanism is also called dominant-strategy-incentive-compatible (DSIC), to distinguish it from other kinds of incentive compatibility. A SP mechanism is immune to manipulations by individual players (but not by coalitions). In contrast, in a group strategyproof mechanism, no group of people can collude to misreport their preferences in a way that makes every member better off. In a strong group strategyproof mechanism, no group of people can col ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Trade Reduction Mechanism
Trade involves the transfer of goods and services from one person or entity to another, often in exchange for money. Economists refer to a system or network that allows trade as a market. Traders generally negotiate through a medium of credit or exchange, such as money. Though some economists characterize barter (i.e. trading things without the use of money) as an early form of trade, money was invented before written history began. Consequently, any story of how money first developed is mostly based on conjecture and logical inference. Letters of credit, paper money, and non-physical money have greatly simplified and promoted trade as buying can be separated from selling, or earning. Trade between two traders is called bilateral trade, while trade involving more than two traders is called multilateral trade. In one modern view, trade exists due to specialization and the division of labor, a predominant form of economic activity in which individuals and groups concentrat ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Incentive Compatibility
In game theory and economics, a mechanism is called incentive-compatible (IC) if every participant can achieve their own best outcome by reporting their true preferences. For example, there is incentive compatibility if high-risk clients are better off in identifying themselves as high-risk to insurance firms, who only sell discounted insurance to high-risk clients. Likewise, they would be worse off if they pretend to be low-risk. Low-risk clients who pretend to be high-risk would also be worse off. The concept is attributed to the Russian-born American economist Leonid Hurwicz. Typology There are several different degrees of incentive-compatibility: * The stronger degree is dominant-strategy incentive-compatibility (DSIC). This means that truth-telling is a weakly-dominant strategy, i.e. you fare best or at least not worse by being truthful, regardless of what the others do. In a DSIC mechanism, strategic considerations cannot help any agent achieve better outcomes than the tru ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |