TW201337820A

TW201337820A - Refined Dutch auction method

Info

Publication number: TW201337820A
Application number: TW101140218A
Authority: TW
Inventors: hua-yan Li; Zhi-Xian Chen; xue-zhen Pan
Original assignee: hua-yan Li; Zhi-Xian Chen; xue-zhen Pan
Priority date: 2012-03-13
Filing date: 2012-10-30
Publication date: 2013-09-16

Abstract

Refined Dutch auction method of the present invention, the Department include: (A) the user is first set to auction the subject of the starting price, for a more bidders bidding; (B) the subject of the tender consideration for setting auction, so the auction price according to decreasing amount of specific rules; (C) must conform to set the end of the auction to allow one to more users; With such a design, flexible application of the auction method can achieve lower the auction by sales pressure and achieve in line with the purposes of the user ask price of the auction.

Description

Refined Dutch auction method

本發明係提供一種拍賣方法，尤指其技術上提供一種系統或使用者所設定的競標遞減規則，而該方法係提供買方、拍賣系統店家及賣方三方均可滿足之拍賣系統，使其達到欲出售標的方得以拍賣期望的金額、拍賣系統方或使用者取得佣金及投標方將以低於市價金額購得標的者之目的之精煉荷蘭式拍賣方法。
The invention provides an auction method, in particular to provide a bidding and decrement rule set by a system or a user, and the method provides an auction system that can be satisfied by the buyer, the auction system store and the seller. The sale of the subject party is possible to auction the desired amount, the auction system party or the user to obtain commissions and the refined Dutch auction method in which the bidder will purchase the target at a price below the market price.

「拍賣」是財產權利轉讓的一種方式，古希臘歷史學家西羅多德在他所著作的「歷史」中，指出拍賣活動最早可追溯到西元前五百年（西元前五世紀）的古巴比倫。古巴比倫城當時在每年一度都會舉行適婚女子的拍賣活動，每逢此時，人們將會把美麗女子送往市場，投標者將會紛紛出價，以求得到心儀的女孩子。
而「拍賣」（auction）一詞源自於拉丁語，意思是「增加」，即在拍賣交易中公開價格，並且不斷向上增加價格，務求能得到拍賣的標的。而現代的拍賣與傳統的拍賣存在了一些差距，像秘密投標方法的拍賣就不存在著公開性，而拍賣實際上更深層的意義及他的理論基礎來自於「信息經濟學」及數學家馮紐曼所創的理論「賽局理論」（Game theory）之核心思想，認為拍賣本身是一個博弈的過程。
一個古代清朝的瓷器花瓶，經過挖掘開挖出來，他並沒有實際的價值，但是會有一群古董收藏家會想要收藏。而花瓶持有人不知道該以多少金額的價格出售花瓶，欲購買花瓶的收藏家也不知道該以多少金額的價格購買花瓶，所以持有花瓶的賣家提供花瓶進行拍賣活動，使得眾多想購買古董花瓶的收藏買家能進行「出價」，因為持有花瓶的賣家把花瓶拿出來拍賣，使得想收藏花瓶的古董買家能夠對花瓶出價，所以這個花瓶因此訂出了價格，所以「拍賣等於訂價」。持有花瓶的賣家心中，可能想賣100萬元。想購買花瓶的買家心中，可能想買50萬元，然而賣家持有的花瓶可能以80萬元賣出，想購買花瓶的買家可能以70萬元買入。如果賣家持有的花瓶，以80萬元賣出，低於了賣家想賣的100萬元，賣家會認為他損失了20萬元，又如果想購買花瓶的買家，以70萬元得標，高於了買家想買的50萬元，買家會認為他損失了20萬元；花瓶因為拍賣的過程，使得買家可能買貴了，或使得賣家可能賣便宜了，因此拍賣有風險存在，所以拍賣等於博弈。綜上所言，可以得知拍賣等於訂價等於博弈，而在賽局理論的核心思想可以得知納許及貝葉斯、哈尚義等經濟學家、機率統計學家創造了四種均衡點，能創造出新型的拍賣方法，這四種均衡點分別為完全資訊靜態賽局納許均衡點（Nash epuilibrium）、完全資訊動態賽局子博弈精煉納許均衡點（Subgame perfect Nash equilibrium）、不完全資訊靜態賽局貝葉斯納許均衡點（Bayesian Nash equilibrium）、不完全資訊動態賽局精煉貝葉斯納許均衡點（Perfect Bayesian Nash equilibrium），透過以上四種均衡點可以知道各種拍賣方法的得標機會以及可行性。
拍賣模式常見的典型拍賣方法包括了英國式拍賣方法、荷蘭式拍賣方法、秘密投標方法及雙式拍賣方法等四種型態。依競價過程公開與否，Krishna 在2002年將拍賣分為公開形式（Open Format）及密封形式（Sealed-Bid Format）兩大類，每種競標機制之競價過程、進行方式及決標方法本發明人彙整如下：
一、公開競價
公開競價之競價過程中，依照價格變動方式，分為英國式拍賣及荷蘭式拍賣：
1、英國式拍賣（British Auction）：
係指拍賣方對於欲拍賣之標的設定起標價格，亦可對拍賣之標的設定公開或不公開之保留價格（Reserve Price），該標的之價格由低至高的公開予參與拍賣的競標者競價，競標者可多次重覆提高出價，直至剩下最後一位出價者出價，不再有其他競標者與之競爭時，得標者為最終出價之競標者，得標價格為其最終出價，若所有競標者均未到達所設定之保留價格，拍賣方擁有不出售標的之權利。英國式拍賣法常見於一般拍賣場及古董、藝術市場。
2、荷蘭式拍賣（Dutch Auction）：
又稱減價式拍賣、逆向拍賣、混合式拍賣或無聲拍賣。此拍賣方法創於荷蘭的鬱金香拍賣場而得名。拍賣方將欲拍賣之標的設定較高之價格，並設定固定遞減金額，拍賣過程中，標的之價格依一定時間之間隔及事先確定之固定遞減金額，由高價往低價逐步遞減，若拍賣方為人工拍賣時，遞減金額則不受限，由拍賣師依情況遞減，直至有競標者表示願意接受該價格而聲明願意購買時，標的之價格隨即停止遞減，得標者即為首先聲明購買之競標者，得標價格即為其停止遞減時之價格。此種拍賣方法常以拍賣鐘來公開進行，拍賣鐘所顯示的價格逐步遞減，首先按鍵或舉手時的競標者為得標者，得標價格為其舉手或按鍵時停止遞減之價格。荷蘭式拍賣因有減價之特點，故競標者往往坐等觀望，企盼標的價格不斷減低，導致現場競爭氣氛不夠熱烈，因此有「無聲拍賣」的名聲。荷蘭式拍賣中亦有金額向上遞增之情況，若拍賣過程中同時有兩位以上之競標者，在標的價格遞減時，均在同一價位聲明願意購買，則拍賣即停止遞減標的之金額，拍賣方立即將拍賣機制轉為增價型態，此後競相加價的過程一直持續，直至無其他競標者與之競爭為止，得標者為其最終出價之競標者，得標價格為其最終之出價。實際上，大多情況下的荷蘭式拍賣法是增價和減價混合進行的，故亦稱為「混合式拍賣」。荷蘭式拍賣常應用於品質可能變化、容易腐爛的、有時效性的，或者品質良莠不齊的物品，例如水果、蔬菜、魚類、鮮花、煙草、票卷等。
二、秘密投標
依照得標者支付的價格不同，分為第一價格密封式拍賣及第二價格密封式拍賣：
1、第一價格密封式拍賣（first-price Auction）：
又稱最高價密封式拍賣或秘密投標。拍賣方對於欲拍賣之標的設定起標價格及投標期限，競標者將心中願意給付的保留價格寫在密封的標單中，而且僅能提出一次標價，並且不能再修正其標價，於截止日期前，將標單遞交至拍賣方，拍賣方將標單收齊後，於開標日將所有標單一併拆封，公開進行比價，得標者為其出價最高之競標者，得標價格為其標單之出價，並依其價付款。此種拍賣法廣泛應用於土地、公用工程的競標上。
2、第二價格密封式拍賣（Second-Price Auction）：
又稱維氏拍賣（Vickrey Auction）或次高價密封式拍賣。此拍賣機制由William Vickrey於西元1961年所提出，並於西元1966年獲頒經濟學諾貝爾獎。此種拍賣方法以最高價得標、次高價付款方式進行。拍賣方對於欲拍賣之標的設定起標價格及投標期限，競標者將心中願意給付的保留價格寫在密封的標單中，於截止日期前，將標單遞交至拍賣方，拍賣方將標單收齊後，於開標日將所有標單一併拆封，公開進行比價，得標者為其出價最高之競標者，得標價格為所有投標單之次高價。雙式拍賣方法，係指將拍賣的方法由逆向操作使用，由某一位買家提出一項欲購買的商品，由眾多的賣方競爭價格，最低願賣價格者得標，因此賣方將會彼此競爭，屬於特殊的拍賣模式。
而在現今社已進入網際網路資訊及通訊發達蓬勃發展的社會，拍賣方式不斷推陳出新，已不僅限於四種典型之傳統拍賣方式，已由網際網路所取代，現代絕大多數的網路拍賣均於屬英國式拍賣方法，例如著名的yahoo!奇摩拍賣，但是此種拍賣市場是屬於CtoC的市場區塊，現在網路拍賣競爭激烈，已有更多特殊拍賣方法不斷推陳出新。
秘密投標式拍賣方法之中，也有一種屬於價格可上下出價的方法，此種方法於該場拍賣開標之前，預設一個結束時間，時間進行倒數計時的動作，同時由投標者進行投標動作，投標者可以投標開始之後下達投標信號，而此投標信號的價格由投標者任意出價，價格範圍在該標的初始設定的價格範圍內，假定標的價格為一萬元，則投標者可以在此一萬元的金額之內任意出價，在初始設定的時間結束時，由該拍賣場所設定的決標方式判讀得標者。而此種決標方法大致上可以分為兩種決標方式，第一種是最高而且唯一的出價者得標，第二則是最低而且唯一的出價者得標，因此在拍賣進行的過程當中，重複價格者將會出局，必須進行重新投標的動作，而投標者在每一次的拍賣競標過程當中，每一次發出投標信號時，都需要支付特定的代價，例如手續費、點數卡或紅利點數等等。但是投標者在投標的過程當中，無法得知其他投標者所下達投標信號的價格，因此屬於秘密投標式的屬性，假定此種方法投標者在進行出價時，1至100的數字都已經被其他參與的投標者投標過，此時投標過的投標者的投標價格將會向上增加，而在往後假定101至200之間的數字都無投標者下達投標信號，201至300之間都被投標者下達投標信號時，投標者亦可向下於101至200之間的數字下達投標信號，在此時，投標信號的價格又呈現減少狀態，因此此種拍賣方法不屬於荷蘭式拍賣方法的固定遞減範圍之內，也不屬於荷蘭式拍賣方法中的混合式拍賣方法。混合式拍賣方法的技術特徵在於，賣方將標的價格遞減至一定階段，有投標者下達投標信號時，則標的往後只會呈現遞增的狀態，而非向上及向下，因此可上下出價的拍賣方法為秘密投標式價格不定向出價方法，例如專利編號I305629號案之「殺價式拍賣方法」。
無論是線上購物或傳統購物，賣家總是希望能將東西賣的價錢越高越好，而買家總是希望能買到的東西價錢能越低越好。
以專利編號508963號案之「動態降價之通訊拍賣方法及裝置」為例，其主要是利用消費者電話詢價的通訊收入為主要經營利潤，並於每隔T秒的時間區內，提撥此時間區內的部分通訊收入，作為拍賣商的補貼金額，使商品的價格可以逐漸遞減。惟，這種利用通訊收入遞減標價的方式，會因為不同消費者撥打電話時的操作習性及反應速度，而產生不同的通訊收入，有付費不透明、無法預期降價空間的狀況，很容易使消費者產生不信任的心理，且另外操作電話的方式，尤其是必須輸入會員帳號、密碼等等大量資料時，會顯得相當麻煩及耗費時間，而不具實用性及方便性。
以專利編號第484078號案之「線上拍賣之逆向競標方法」為例，該方法屬於典型荷蘭式拍賣方法中的賣方自動遞減標的售價（遞減金額=市價-底價/競標時間），而決標方法為投標者在標的價格降幅內及初始設定的結束時間結束內進行出價，隨即結標，惟，這種方式雖然可以使商品的標價向下遞減，但是此種方法仍然設有底價（經濟學上稱之為保留價格），且此保留價格為不公開之秘密價格，因此該標的價格無論由賣方如何降價，都不會低於保留價格，也因為有保留價格，只要一人出價，競標的活動就結束，且在「設有底價」的情況下，消費者只可能買到貴的商品，不可能買到便宜的商品。因此投標者也永遠買不到便宜的標，是為一大缺失，如假定標的市價18,000元，則保留價格為12000元(保密項目)，因此投標者永遠無法買到低於12,000元以下價格之拍賣標的。
以專利編號第200612286號案之「遞減競標購物方法」為例，該方法屬於秘密投標式拍賣方法結合荷蘭式拍賣方法所衍生之新型拍賣方法，該方法與專利編號508963之方法類似，有異曲同工之妙，但是差異在於後者經營主要利潤是來自於通訊電信收入，並且由通訊收入遞減商品金額，而前者方法為下標預付額為主要經營收入，兩種方法皆是投標者先行預付一筆費用，由此費用提撥一定金額，使標的價格遞減，而只要投標者支付通訊電信費及支付手續費用以後，才能知道目前標的被遞減的當前金額，投標者只能選擇當前金額是否滿意，滿意即可以當前標的金額直接購買標的，此種方法與荷蘭式拍賣方法的差異，在於荷蘭式拍賣方法是屬於公開式的競標拍賣方法，投標者能在透明化的遞減金額下，選擇願意購買的遞減價格點，而此兩種方法皆需要支付費用（通訊電信費或預付的特定代價），才始得知目前標的遞減的金額以及投標人數，並且無法預期降價空間，當有投標者進行購買動作時，將會直接進行結標動作，而使得其他投標者無法明確知道下標時機點，只能以前次支付代價時所知道的線上人數及金額作為投標的參考依據，運氣成分較重，使得得標的機會大幅降低。
以專利編號第200836122號案之「遞減式拍賣方法」為例，該方法為典型荷蘭式拍賣方法，只是將技術應用於線上拍賣系統而已，此種方法為賣家自動將標的價格降價，而決標方式為投標者只要投標時，即刻結標，或者系統預設時間倒數截止時，則自動流標。
以專利編號第M422128號案之「網路競標系統」為例，該方法屬於荷蘭式拍賣方法所衍生的「賣方出價方法」，而該方法之投標價格如果當競標價格進入該資料庫儲存器中的「該目前競標價格資料等於該得標計算模組內存之預設得標資料時」，決定該目前競標價格資料所屬之投標者為得標者，代表了拍賣系統方在該場拍賣競標開始之前為該場拍賣標的預設了保留價格，因此如果投標者支付了一特定代價進行投標動作，最後一位投標者及倒數第二位以上之投標者如果競爭激烈，他們都支付了許多的代價，將會造成對倒數第二位以前的投標者不公平下標的情況，因為倒數第二位以前的投標者，並沒有表示不想繼續支付特定代價繼續參與該場拍賣投標的意願，卻被強制結標，所以此種決標方法對於得標者以外願意繼續參與投標的投標者不公平。
以「槌樂&幸運星」網站之遞減式拍賣方法為例，該方法屬於荷蘭式拍賣方法中的混合式拍賣方法的衍生方法，但此種拍賣方法亦在網站投標規則中，標的金額向下遞減至最低以後（價格：0），標的金額轉為向上遞增價格，而決標方式是到達系統方所設定的最高價格時，強制進行結標，因此同樣的設定了「保留價格（底價）」的缺陷。最後一位投標者被強制結標時，對於之前的投標者都不公平，其原因是因為，在存在保留價格的規則中，被強制結標時，其他的投標者，並無表示不願意進行繼續投標的行為，除了被強制結標的得標者為，反而其他的投標者已經支付了許多的投標代價，卻不能繼續進行投標動作。
惟，其上述習知之拍賣系統仍存在有下列主要缺失：
在昔日技術中，不論是哪一種新衍生的拍賣方法，幾乎均有保留價格之缺失，消費者永遠無法購買到低於保留價格之標的物。
在昔日技術中，有保留價格之方法，投標者在標的價格達到保留價格時，都將被強制結標，使得得標者以外的投標者，無法繼續支付特定代價進行投標動作。
英國式拍賣方法的價格，因為沒有支付代價的特點，將會使得拍賣標的價格漫天喊價，使得投標者永遠不可能購得便宜的商品，並且將產生「贏家的詛咒（專有名詞）」效果。
荷蘭式拍賣方法的價格，於投標者進行出價時，同時結標，相當於最基本的拍賣訂價，屬於該標的之最高價格。
荷蘭式拍賣方法中的混合式拍賣方法，同樣的因為沒有支付特定代價的規定，因此價格如同英國式拍賣方法，將可能使得標的價格漫天喊價。
在沒有支付特定代價時進行下標的拍賣方法，拍賣標的如果因為漫天喊價，而可能因為拍賣競爭激烈，使得投標者下標超出自身能力範圍時，容易使得拍賣標的造成流標現象。
是以，針對上述習知結構所存在之問題點，如何開發一種更具理想實用性之創新結構，實消費者所殷切企盼，亦係相關業者須努力研發突破之目標及方向。
有鑑於此，發明人本於多年從事相關產品之製造開發與設計經驗，針對上述之目標詳加設計與審慎評估後，終得一確具實用性之本發明。
"Auction" is a way of transferring property rights. The ancient Greek historian Silodod pointed out in his "history" that the auction activities can be traced back to the first five hundred years before the BC (the fifth century BC). . At the time, the city of Babylon in Cuba once held an auction for marriageable women. At this time, people will send beautiful women to the market, and bidders will bid for the girls they want.
The word "auction" is derived from Latin, meaning "increase", that is, the price is disclosed in the auction transaction, and the price is continuously increased upwards in order to obtain the target of the auction. However, there are some gaps between modern auctions and traditional auctions. There is no openness in auctions like secret bidding methods, and the actual deeper meaning of auctions and his theoretical basis come from "information economics" and mathematician Feng. The core idea of the theory "Game theory" created by Newman is that the auction itself is a game process.
An ancient Qing Dynasty porcelain vase, excavated and excavated, he has no practical value, but there will be a group of antique collectors who want to collect. The vase holder does not know how much the price of the vase should be sold. The collector who wants to buy the vase does not know how much the price to buy the vase, so the seller holding the vase provides the vase for the auction, making many want to buy Buyers of antique vases can make "bids" because the seller who holds the vase takes the vase out of the auction, so that the antique buyer who wants to collect the vase can bid on the vase, so the vase sets the price, so "the auction equals Pricing." The seller who holds the vase may want to sell 1 million yuan. Buyers who want to buy vases may want to buy 500,000 yuan. However, the vases held by the seller may be sold for 800,000 yuan. Buyers who want to buy vases may buy 700,000 yuan. If the seller holds the vase and sells it at 800,000 yuan, which is lower than the one million that the seller wants to sell, the seller will think that he has lost 200,000 yuan, and if he wants to buy the vase buyer, he will get the prize of 700,000 yuan. , higher than the buyer wants to buy 500,000 yuan, the buyer will think that he lost 200,000 yuan; the vase because of the auction process, so that the buyer may buy expensive, or make the seller may sell cheap, so the auction is risky Exist, so the auction is equal to the game. In summary, it can be known that the auction equals the price equal to the game, and the core idea of the game theory can be learned that Naxi and Bayes, Hashanyi and other economists and probability statisticians have created four equilibrium points. , can create a new type of auction method, these four equilibrium points are the complete information static game Nash epuilibrium, the complete information dynamic game subgame perfect Nash equilibrium (Subgame perfect Nash equilibrium), no Full information static game Bayesian Nash equilibrium, Perfect Bayesian Nash equilibrium, through the above four equilibrium points, you can know the various auction methods The chances of winning and the feasibility.
The typical auction methods commonly used in the auction mode include the British auction method, the Dutch auction method, the secret bidding method and the double auction method. According to the open bidding process, Krishna divided the auction into two categories: Open Format and Sealed-Bid Format in 2002. The bidding process, the way of implementation and the method of awarding each bidding mechanism were inventors. The summary is as follows:
1. In the bidding process of open bidding and open bidding, according to the price change method, it is divided into British auction and Dutch auction:
1. British Auction (British Auction):
Refers to the auctioneer's bid price for the target of the auction, or the reserve price of the auction target, which is open or undisclosed. The price of the target is from low to high bidding to the bidders participating in the auction. The bidder can repeatedly raise the bid multiple times until the last bidder remains, and no other bidders compete with it. The winner is the bidder of the final bid, and the bid price is the final bid. All bidders have not reached the set reserve price, and the auctioneer has the right not to sell the subject. British auction methods are common in general auctions and antiques and art markets.
2. Dutch Auction:
Also known as discounted auctions, reverse auctions, hybrid auctions or silent auctions. This auction method was named after the Dutch auction of tulips. The auctioneer will set a higher price for the target of the auction and set a fixed declining amount. During the auction, the price of the target will be gradually reduced from the high price to the low price according to the interval between the certain time and the fixed deduction amount determined in advance. For the manual auction, the deductible amount is not limited, and is reduced by the auctioneer according to the situation. When the bidder expresses his willingness to accept the price and declares that he is willing to purchase, the price of the target will stop decreasing. The winner is the first to declare the purchase. For the bidder, the bid price is the price at which it stops declining. Such an auction method is often carried out publicly by the auction clock. The price displayed by the auction clock is gradually reduced. The bidder who first presses or raises the hand is the winner, and the bid price is the price at which the bid is stopped when the hand is raised or the button is pressed. Because of the price reduction characteristics of Dutch auctions, bidders often wait and see, and hope that the price of the target will continue to decrease, resulting in a lack of enthusiastic on-site competition. Therefore, there is a reputation of “silent auction”. In the Dutch auction, there is also an upward increase in the amount. If there are more than two bidders at the same time in the auction process, when the target price is decremented, they are willing to purchase at the same price, then the auction will stop deducting the amount of the bid, the auctioneer The auction mechanism was immediately converted to a price increase pattern. Since then, the process of increasing the price has continued until no other bidders compete with them. The winner is the bidder for his final bid, and the bid price is the final bid. In fact, in most cases, the Dutch auction method is a combination of price increase and price reduction, so it is also called "mixed auction". Dutch auctions are often used for items that may vary in quality, perishable, time-sensitive, or of varying quality, such as fruits, vegetables, fish, flowers, tobacco, and tickets.
Second, the secret bidding is divided into the first price sealed auction and the second price sealed auction according to the price paid by the winning bidder:
1. First-price auction:
Also known as the highest price sealed auction or secret bidding. The auctioneer sets the bidding price and the bidding period for the target to be auctioned, and the bidder writes the reserved price that the user is willing to pay in the sealed list, and can only propose the price once, and can not correct the price, before the deadline. The bid will be submitted to the auctioneer. After the auctioneer collects the bills, all the bids will be opened and unsealed on the bid opening date, and the bid will be publicly offered. The bidder will be the bidder with the highest bid, and the bid price will be the bid. Single bid and pay at the price. This kind of auction method is widely used in the bidding of land and public works.
2. Second-price sealed auction (Second-Price Auction):
Also known as Vickrey Auction or sub-high price sealed auction. This auction mechanism was proposed by William Vickrey in 1961 and was awarded the Nobel Prize in Economics in 1966. This kind of auction method is carried out at the highest price and the second highest price. The auctioneer sets the bidding price and the bidding period for the target to be auctioned. The bidder will write the reserved price that the willingness to pay in the sealed list. Before the deadline, the bid will be submitted to the auctioneer, and the auctioneer will place the order. After the collection, all the singles will be opened and unsealed on the opening date, and the price will be publicly disclosed. The winner will be the highest bidder, and the bid price will be the highest price of all bids. The double auction method refers to the method of auction being used by the reverse operation. A buyer proposes a commodity to be purchased, and the sellers compete for the price, and the lowest bidder wins the bid, so the sellers will each other Competition is a special auction mode.
In today's society, which has entered the development of Internet information and communication, the auction method has been continuously updated. It is not limited to the four typical traditional auction methods. It has been replaced by the Internet. Most modern online auctions. They are all British auction methods, such as the famous yahoo! Chimo auction, but this auction market belongs to the CtoC market block. Nowadays, online auction competition is fierce, and more special auction methods have been introduced.
Among the secret bidding auction methods, there is also a method of bidding up and down the price. This method presets an end time and time to count down the time before the bid opening of the auction, and the bidder performs the bidding action and bids. The bidding signal can be issued after the bidding starts, and the price of the bidding signal is arbitrarily bid by the bidder, and the price range is within the initial set price range of the target. If the bid price is 10,000 yuan, the bidder can be 10,000 yuan here. Any bid within the amount of the amount, at the end of the initial set time, the winner is judged by the award method set by the auction site. And this method of awarding can be roughly divided into two types of awarding methods. The first is the highest and the only bidder wins the bid, and the second is the lowest and only bidder wins the bid, so during the auction process The repeat price will be out, and the re-bidding action must be carried out. The bidder will pay a specific price, such as handling fee, credit card or bonus, every time the bidding signal is sent during each auction bidding process. Points and so on. However, during the bidding process, the bidder cannot know the price of the bidding signal issued by other bidders, and therefore belongs to the secret bidding attribute. It is assumed that the bidders of this method are already using the other numbers from 1 to 100. The bidders who participated in the bidding have been bidding. At this time, the bid price of the bidders who have bidding will increase upwards, and in the future, it is assumed that no bidders will issue bid signals between 101 and 200, and bids will be bid between 201 and 300. When the bidding signal is issued, the bidder can also issue the bidding signal to the number between 101 and 200. At this time, the price of the bidding signal is reduced again, so the auction method is not fixed by the Dutch auction method. Within the scope of declining, it is not a hybrid auction method in the Dutch auction method. The technical feature of the hybrid auction method is that the seller decrements the target price to a certain stage. When the bidder issues a bidding signal, the target will only show an increasing state instead of up and down, so the auction can be bidding up and down. The method is a secret bidding price non-targeted bidding method, such as the "price-price auction method" of Patent No. I305629.
Whether it's online shopping or traditional shopping, sellers always want to sell things as high as possible, and buyers always want to buy things that can be as low as possible.
Take the example of "Dynamic price reduction communication auction method and device" in the case of Patent No. 508963, which mainly uses the communication revenue of consumer telephone inquiry as the main operating profit, and allocates it in the time zone every T seconds. Part of the communication revenue in this time zone, as the subsidy amount of the auctioneer, can gradually reduce the price of the commodity. However, this way of using the revenue to declining the price of the communication will result in different communication revenues due to the operational habits and response speeds of different consumers when making calls. It is easy to make consumers pay for opaque and unpredictable price reduction. There is a feeling of distrust, and the way to operate the phone, especially when you have to input a large amount of information such as member accounts, passwords, etc., can be quite cumbersome and time consuming, and not practical and convenient.
For example, in the case of the reverse auction method for online auctions in Patent No. 484078, this method belongs to the seller's automatic declining price in the typical Dutch auction method (decreasing amount = market price - reserve price / bidding time), and the award The method is for the bidder to bid within the target price drop and the end of the initial set end time, and then the bid is concluded. However, although this method can lower the price of the commodity downward, the method still has a reserve price (economics). It is called the reserve price), and the reserve price is the secret price that is not disclosed. Therefore, the price of the target will not be lower than the reserve price regardless of the seller’s price reduction, and because there is a reserve price, as long as one person bids, the bidding activity At the end, and in the case of "with a reserve price", consumers can only buy expensive goods, and it is impossible to buy cheap goods. Therefore, the bidder will never buy a cheap label, which is a big mistake. If the market price of the target is 18,000 yuan, the reserve price is 12,000 yuan (secret item), so the bidder can never buy the price below 12,000 yuan. Auction target.
Taking the “Declining bidding shopping method” in Patent No. 200612286 as an example, this method belongs to the new auction method derived from the secret bid auction method combined with the Dutch auction method. This method is similar to the method of Patent No. 508963, and has the same method. Wonderful, but the difference is that the latter's main profit is from the revenue of telecommunications, and the amount of goods is deducted from the revenue of the communication. The former method is the substandard prepayment as the main operating income. Both methods are for the bidder to prepay a fee. This fee is charged a certain amount, so that the target price is decremented, and as long as the bidder pays the communication telecommunication fee and the payment processing fee, the current amount of the current target is decremented. The bidder can only choose whether the current amount is satisfactory, and the satisfaction can be current. The difference between the target amount and the Dutch auction method is that the Dutch auction method is an open auction method, and the bidder can select the declining price point that is willing to purchase under the transparent declining amount. Both methods require payment of fees ( The telecommunication fee or the specific consideration paid in advance, only the amount of the current declining amount and the number of bidders are known, and the price reduction space cannot be expected. When the bidder performs the purchase action, the bidding action will be directly performed, and other bids will be made. The person can't clearly know the timing of the subscript. Only the online number and amount known in the previous payment of the price can be used as the reference basis for the bid. The luck component is heavier, which greatly reduces the chances of winning the bid.
Take the example of the “decremental auction method” in Patent No. 200836122, which is a typical Dutch auction method, but only applies the technology to the online auction system. This method automatically reduces the price of the target by the seller, and decides the price. The method is that the bidder automatically signs when it is bidding immediately, or when the system preset time counts down.
Taking the "Internet bidding system" of Patent No. M422128 as an example, the method belongs to the "seller bidding method" derived from the Dutch auction method, and the bid price of the method is entered into the database storage when the bid price is entered. "When the current bid price data is equal to the default bid data of the bid calculation module memory", it is determined that the bidder to which the current bid price data belongs is the winner, which represents the auction system party starting the bidding in the auction. The reserve price was preset for the auction target, so if the bidder paid a specific price for the bidding action, the last bidder and the second-to-last bidder would pay a lot of price if the competition was fierce. Will result in an unfair subscript to the second-to-laster bidder, because the second-to-last second-time bidder did not express the willingness to continue to pay the specified price to continue to participate in the auction bid, but was forced to end Therefore, such a method of awarding is unfair to bidders who are willing to continue to participate in the bidding other than the winner.
Taking the declining auction method of the website "槌乐&Lucky Star" as an example, this method belongs to the derivative method of the hybrid auction method in the Dutch auction method, but this auction method is also in the website bidding rules, the amount of the target is downward. After decrementing to the lowest (price: 0), the target amount is converted to the upward price, and the method of awarding is to force the settlement when the highest price set by the system is reached, so the same "set reserve price (base price)" is set. Defects. When the last bidder was forced to conclude the bid, it was unfair to the previous bidders because the other bidders did not indicate that they were unwilling to proceed when the bidding rules were enforced. The act of continuing the bidding, except for the successful bidder, is that the other bidders have already paid a lot of bidding costs, but they cannot continue the bidding action.
However, the above-mentioned conventional auction system still has the following major defects:
In the past technology, no matter which kind of new derivative auction method, almost all of the reserved price is missing, consumers can never buy the target below the reserve price.
In the past technology, there is a method of retaining the price. When the bidder reaches the reserve price, the bidder will be forced to complete the bidding, so that the bidder other than the bidder can not continue to pay the specific bid for the bidding action.
The price of the British auction method, because of the lack of payment of the price, will make the price of the auction target soar, so that the bidder will never be able to buy cheap goods, and will produce the "winner's curse (proper noun)" effect .
The price of the Dutch auction method, when bidders bid, is also closed, which is equivalent to the most basic auction price, which belongs to the highest price of the target.
The hybrid auction method in the Dutch auction method, similarly because there is no provision for paying a specific price, so the price is like the British auction method, which may make the price of the target skyrocket.
If the auction method is subscripted without paying a specific price, if the auction target is called because of the skyrocketing price, it may be because the auction competition is fierce, which makes the bidder's subscript exceed the scope of its own ability, which easily causes the auction target to cause the flow label phenomenon.
Therefore, in view of the problems existing in the above-mentioned conventional structure, how to develop an innovative structure that is more ideal and practical, the consumers are eagerly awaiting, and the relevant industry must strive to develop the goal and direction of breakthrough.
In view of this, the inventor has been engaged in the manufacturing development and design experience of related products for many years, and after detailed design and careful evaluation of the above objectives, the invention has finally become practical.

有鑑於習知拍賣方式仍有存在不完善處，發明人經長時間不斷的研究開發，終於研發出此種能達到降低欲出售標的者銷售壓力及拍賣使用者獲得利潤並達到符合拍賣者期待之賣價之目的。
本發明精煉荷蘭式拍賣方法，其係包括:(A)使用者先設定一至多個拍賣標的(全新、二手或服務)之起標價，供一至多個競標者投標；(B)設定拍賣標的之投標代價(即競標手續費，可為金錢、紅利、虛擬貨幣、不動產、動產、有價證券、商品)，使拍賣價格依特定規則遞減金額；以及(C)設定拍賣結束必須符合至一至多個條件。
本發明之主要目的在於藉由上述之方式，競標者若想標到拍賣標的，則必須與其他競標者次競標，而每次競標都必須支付一次競標代價（例如：競標手續費、紅利點數等），透過競標者相互競標，直到拍賣時間結束，由最後競標者得標，而能達到降低拍賣者銷售壓力並達到符合拍賣者期待之賣價目的。
為了能讓審查員能更易於瞭解本發明精煉荷蘭式拍賣方法之特點，請參閱以下圖式及本發明精煉荷蘭式拍賣方法之實施方式說明。
In view of the imperfections in the conventional auction method, the inventors have been researching and developing for a long time, and finally developed such a way to reduce the sales pressure of the sellers who want to sell and the profits of the auction users and meet the expectations of the auctioneers. The purpose of the sale price.
The invention refines the Dutch auction method, which comprises: (A) the user first sets the starting price of one or more auction targets (new, second-hand or service) for bidding by one or more bidders; (B) setting the auction target The bidding cost (ie, the bidding fee, which may be money, bonus, virtual currency, real estate, movable property, marketable securities, commodities), such that the auction price is decremented according to a specific rule; and (C) the auction end must meet one or more conditions. .
The main purpose of the present invention is that, in the above manner, if the bidder wants to mark the auction target, it must bid with other bidders, and each bid must pay a bid price (for example: bidding fee, bonus point) Etc., through the bidders bidding each other until the end of the auction time, the final bidder won the bid, and can reduce the auctioneer sales pressure and meet the auctioneer's expectation of the sale price.
In order to make it easier for the examiner to understand the features of the refined Dutch auction method of the present invention, please refer to the following figures and the description of the embodiments of the refined Dutch auction method of the present invention.

本發明係提供滿足買方、拍賣系統店家及賣方之一種精煉荷蘭式拍賣方法。為使　貴審查委員對本發明之目的、特徵及功效能夠有更進一步之名瞭解與認識，茲請配合以下圖式說明詳述如後。
請參閱第一圖，圖一係為本發明精煉荷蘭式拍賣方法之無保留價下降模式流程圖。本發明精煉荷蘭式拍賣方法，其係包括:使用者設定拍賣標的(全新、二手或服務)之數量A1、初始之起標價A2、設定預設之拍賣倒數時間A3、設定拍賣倒數延長時間以及冷卻時間A4、設定拍賣標依特定規則遞減金額A5、設定競標者每次投標所需支付之投標代價(即競標手續費，可為金錢、紅利、虛擬貨幣、不動產、動產、有價證券、商品)A6；公佈拍賣資訊並開始拍賣A7；競標者購買點數並儲值A8；競標者選擇拍賣標的並進行競標A9；拍賣標的依據競標者競標次數降價A10；以及拍賣標的競標至無人與之競標或時間截止並符合至一至多個條件，由最後一位競標者得標A11；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。
請參閱圖二，圖二係為本發明精煉荷蘭式拍賣方法之有保留價下降模式流程圖。其與圖一差別之處在於使用者亦可設定該拍賣標的之保留價格A12。其中，該保留價格可為負數值。
本發明精煉荷蘭式拍賣方法，其中，拍賣結束條件可以是拍賣時間、投標總次數、單一競標者或同時數個不同的競標者一同出價、特定時間、或是到達某個特定的金額之上述一至多種。
請參閱圖三，圖三係為本發明精煉荷蘭式拍賣方法之集標下降模式流程圖。本發明精煉荷蘭式拍賣方法，其係包括:使用者設定拍賣標的之數量B1、初始之起標價B2、設定拍賣倒數時間之前之擱置時間及延期次數B3、設定拍賣倒數時間B4、設定拍賣標依特定規則遞減金額B5、設定競標者每次投標所需支付之投標代價B6；公佈拍賣資訊開始拍賣並同時開始集標、擱置時間開始倒數計時B7；競標者購買點數並儲值B8；擱置時間結束則開始拍賣倒數競標者開始進行競標B9；拍賣標的依據競標者競標次數降價B10；以及拍賣標的競標至無人與之競標、時間截止或所有競標者可下標次數用盡時，由最後一位競標者得標B10；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。
請參閱圖四，圖四係為本發明精煉荷蘭式拍賣方法之無保留價回合制下降模式流程圖。
假定「預設之決標人數」為「一人」，每回合均倒數計時十秒鐘，回合倒數計時所有參與競標之競標者均無法得到他人之競標資訊，只能得知該回合之前之競標資訊。回合競標之擱置時間結束後，即進入正式拍賣時間，亦即開始倒數計時第一回合之十秒鐘，若無人競標則進入次回合，若競標人數大於一人亦進入次回合，若回合競標進行中，出現只有「一位」競標者投標，則「符合預設之決標人數」，則該回合即產生決標者；假定預設決標人數為三人，則必須在符合決標人數三人之前不斷進行回合競標，直到某一回合是只有三個人投標，才會產生決標者，亦即三人均為得標者。預設決標人數為三人，因此若回合競標進行中，單一回合只有兩人以下競標或四人以上競標，皆不符合預設之決標人數「三人」，均進入次回合，直至產生幅合預設之決標者「三人」為止。本實施例之意思即為假定使用者起標價設定為為5,000元，每次競標者競標則降價1元，每降一元則為一回合，惟五千個回合內沒有符合預設決標的人數條件，則進入負一回合(-1元)，直至符合預設之決標人數為止，此即為無保留價格之回合制方法。若達負數值之回合而結標，則使用者除須以0元販售標的予得標者以外，另需反向支付投標者該標的負數值，同等代價之決標報酬。
發明精煉荷蘭式拍賣方法，其係包括:使用者先設定一至多個拍賣標的及數量C1，供一至多個競標者投標；設定標的初始之起標價格(可為負數值) C2，設定拍賣標的之投標代價，使拍賣價格依特定規則遞減金額C3，預設拍賣回合倒數時間之前之擱置時間及回合倒數時間C4、設定拍賣標的回合降價區間、幅度以及設定回合決標之人數C5，前述特定規則係為競標者於每一次遞減的金額中以回合制模式進行投標競標行為；公佈拍賣資訊、擱置時間開始倒數計時C6；競標者購買使用者所設定之投標代價並進行儲值C7；於擱置時間結束開始進行回合投標，競標者選擇標的C8；擱置時間倒數計時結束，預設回合時間開始倒數計時並同時降價C9；以及設定拍賣結束必須符合至一至多個條件:該回合是否達成預設決標之人數C10，符合人數則結標，該回合競標者均為得標者C11，得標者依結標金額付款C12，未付款則流標C13；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。
請參閱圖五，圖五係為本發明精煉荷蘭式拍賣方法之有保留價回合制下降模式流程圖。所謂有保留價指是否有總回合數，其與圖四差別之處在於有設定總回合數，如與圖四所述沒有總回合數之限制，回合在產生決標者前，會不斷進行回合競標，直至預設總回合數為止，則不再進行回合競標。本實施例之意思即為假定使用者起標價設定為5,000元，總回合數則設定為五千回合（亦即保留價格），每次競標者競標則降價1元，每降一元則為一回合，因此共有五千個回合，若五千個回合內沒有符合預設決標的人數條件，則至第五千個回合結束會「強制流標」。本發明精煉荷蘭式拍賣方法，其係包括:使用者先設定一至多個拍賣標的及數量D1，供一至多個競標者投標；設定標的初始之起標價格(可為負數值) D2，設定拍賣標的之投標代價，使拍賣價格依特定規則遞減金額D3，預設拍賣回合倒數時間之前之擱置時間及回合倒數時間D4、設定拍賣標的回合降價區間以及幅度D5、設定該標的競標者可下標次數及可購買次數D6、設定總回合數(起標價之降幅度至保留價格時結束、決定總回合數)以及回合競標之決標人數D7，前述特定規則係為競標者於每一次遞減的金額中以回合制模式進行投標競標行為；公佈拍賣資訊、擱置時間開始倒數計時D8；競標者購買使用者所設定之投標代價並進行儲值D9、設定該標的競標者可下標次數及可購買次數D10；於擱置時間結束開始進行回合投標，競標者選擇標的D11；擱置時間倒數計時結束，預設回合時間開始倒數計時並同時降價D12；以及設定拍賣結束必須符合至一至多個條件:該回合是否達成預設決標之人數D13，符合人數則結標，該回合競標者均為得標者D14，得標者依結標金額付款D15，未付款則流標D16；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。
請參閱圖六，圖六係為本發明精煉荷蘭式拍賣方法之無保留價混合模式流程圖。本發明精煉荷蘭式拍賣方法，其係包括:使用者先設定一至多個拍賣標的及數量E1，供一至多個競標者投標；設定標的初始之起標價格(可為負數值) E2，設定拍賣倒數延長時間或冷卻時間E3、設定拍賣標的回合降價區間以及幅度E4、設定拍賣標的之底限(可為負數值)E5、設定到達降價底限之遞增區間及幅度E6、設定每次投標競標者所需支付之代價E7；公佈拍賣資訊並開始拍賣E8；競標者購買投標所支付之代價並進行儲值E9，此時若時間截止無人投標則流標；競標者選擇欲投標之拍賣標的定進行投標E10；標的之價格依各競標者投標次數降價，若達到底限時則增價E11；標的競爭至無人投標或時間截止，由最後一位競標者得標E12；以及得標者依結標金額付款E13；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。混合模式與下降模式最大差異在於遞減至底限時會遞增，其特色在於本實施例之混合模式是沒有保留價格的，因此可以不斷進行下去，直到沒有其他競標者為止，且保留價格可以為負數值，此為昔日所未曾開發使用過之技術。
請參閱圖七，圖七係為本發明精煉荷蘭式拍賣方法之有保留價混合模式流程圖。其與圖六差別之處在於在於該下降模式是否有設定保留價格。亦即決標之金額有受到強制結標之限制。本發明精煉荷蘭式拍賣方法，其係包括:使用者先設定一至多個拍賣標的及數量F1，供一至多個競標者投標；設定標的初始之起標價格(可為負數值) F2，設定拍賣倒數延長時間或冷卻時間F3、設定拍賣標的回合降價區間以及幅度F4、設定拍賣標的之底限(可為負數值)F5、設定拍賣標的之底限F6、設定到達降價底限之遞增區間及幅度F7、設定每次投標競標者所需支付之代價F8；公佈拍賣資訊並開始拍賣F9；競標者購買投標所支付之代價並進行儲值F10，此時若時間截止無人投標則流標；競標者選擇欲投標之拍賣標的定進行投標F11；標的之價格依各競標者投標次數降價，若達到底限時則增價F12；標的競爭至無人投標或時間截止，由最後一位競標者得標F13；以及得標者依結標金額付款F14；藉由如此之設計，讓一至多個使用者能彈性的應用本拍賣方法，而能達到降低拍賣者銷售壓力並達到符合使用者拍賣之賣價之目的。
本發明精煉荷蘭式拍賣方法，其中，使用者可以為欲出售標的者、欲提供標的者或者系統；上述該系統可以為網站系統、電信系統、APP程式或是視窗應用程式。而該視窗應用程式可以是觸控式下標。
本發明精煉荷蘭式拍賣方法，其中，該遞減之設定可以是使用者自訂或由系統隨機遞減；該遞減金額可以為0或負數(負數表示使用者要反向支付競標者該負數金額同等代價之報酬)。
本發明精煉荷蘭式拍賣方法，其中，該特定規則可以包含在競標開始前，設定限制競標者投標次數、該標的所需之投標次數。
本發明精煉荷蘭式拍賣方法，其中，該特定規則可以為競標者於每一次遞減的金額中以回合制模式進行投標競標行為。
本發明精煉荷蘭式拍賣方法，其中，該起標價可以為該拍賣標的之市價或成本價。
本發明精煉荷蘭式拍賣方法，其中，該起標價可以為該拍賣標的之市價或成本價之特定折數、隨機折數或是參照使用期限及拍賣標的性質之比例折數。
本發明精煉荷蘭式拍賣方法，其中，該拍賣標的可以為有形標的或無形標的或兩者。
本發明精煉荷蘭式拍賣方法，其中，該遞減金額可以依競標的金額依區段等比例遞減。
本發明精煉荷蘭式拍賣方法，其中，使用者可增加設定拍賣時間、拍賣標的說明以及下標次數之上述一至多種
本發明精煉荷蘭式拍賣方法，其中，可增加一擱置設定，用於拍賣開始後設定擱置時間，待擱置時間到後即開始原先預定的拍賣時間。
本發明精煉荷蘭式拍賣方法，其中，在當拍賣標的無人競標或當競標價過高或過低時，使用者可提早結束拍賣時間。
本發明精煉荷蘭式拍賣方法，其中，該得標者可以有特定時間內之得標次數限制。
本發明精煉荷蘭式拍賣方法，其中，使用者可以設定結標之標的之標的得標數量，該得標者可以選擇購買設定數量以內得標之標的數量。
本發明精煉荷蘭式拍賣方法，其中，該購買投標次數之競標者，可以是購買單次投標次數後擁有投標至少一次或數次以上或是可以是購買單次投標次數後，擁有無限投標次數。
本發明精煉荷蘭式拍賣方法，其中，可以隨時顯示下標時間以及已下標之次數。
本發明精煉荷蘭式拍賣方法，其中，該特定規則可以是設定自動投標來進行投標。
本發明精煉荷蘭式拍賣方法，其中，該支付投標代價而購買投標次數之競標者，擁有投標資格，未支付投標代價購買投標次數者，不具有投標資格。
本發明精煉荷蘭式拍賣方法，其中，該方法於實施前，可以有無須支付代價，供競標者練習使用之模擬系統。
本發明精煉荷蘭式拍賣方法，其中，該拍賣擱置時間截止前或拍賣時間開始前，可以是由使用者主動以簡訊、信件、電信、傳真或網路等方式提醒競標者即將進入原先預定的拍賣時間或即將開始競標。
本發明精煉荷蘭式拍賣方法，其中，該提醒或告知時間可以是由競標者自行選擇被提醒或告知之時段或時間點或多個時間點。
本發明精煉荷蘭式拍賣方法，其中，該方法可以為人工實施。
請參閱圖八，圖八係為本發明精煉荷蘭式拍賣方法之第一圖用於電腦網站系統實施結構圖。假設欲拍賣之標的為市價20,000元之智慧型手機一隻（標的數量1件）G1，於拍賣開始前公佈欲出售之拍賣標的之資料G2、拍賣標的之商品圖片G3，起標價格為10,000元G4，投標代價使用者設定為點數每1點(25元)，每次投標代價為點數1點，拍賣結束時間倒數計時設定為24小時G5，倒數計時至最後十秒內則延長拍賣倒數時間5秒鐘，得標運費設定為100元，投標者甲先購買儲值該拍賣網站的點數卡，爾後瀏覽標的，選擇欲競標的標的，開始於其他競標者競標，最後拍賣倒數計時之時間結束或無人與之競爭時，則結束該場拍賣，得標者依其當前標價支付標的價款及支付標的運費，若結標時，該標的之價款為負數，則結標者僅需支付該標的之運費，而該負數值由使用者反項支付同等代價之報償，若投標者未支付運費或棄標，則該場標的之得標者以第二順位遞補得標或流標。
請參閱圖九，圖九係為本發明精煉荷蘭式拍賣方法之第二圖用於電腦網站系統實施結構圖。假設欲拍賣之標的為市價20,000元之智慧型手機一隻（標的數量1件）H1，於拍賣開始前公佈欲出售之拍賣標的之資料H2、拍賣標的商品圖片H3，起標價格為10,000元H4，底價為負10,000元H5，投標代價使用者設定為點數每1點(25元)，每次投標代價為點數1點，拍賣結束時間倒數計時設定為24小時H6，倒數計時至最後十秒內則延長拍賣倒數時間5秒鐘，得標運費設定為100元，投標者甲先購買儲值該拍賣網站的點數卡，爾後瀏覽標的，選擇欲競標的標的，開始於其他競標者競標，最後拍賣倒數計時之時間結束、無人與之競爭或到達拍賣底價時，則結束該場拍賣，得標者依其當前標價支付標的價款及支付標的運費，若結標時，該標的之價款為負數，則結標者僅需支付該標的之運費，而該負數值由使用者反項支付同等代價之報償，若投標者未支付運費或棄標，則該場標的之得標者以第二順位遞補得標或流標。
請參閱圖十，圖十係為本發明精煉荷蘭式拍賣方法之第三圖用於電腦網站系統實施結構圖。假設欲拍賣之標的為市價20,000元之智慧型手機一隻（標的數量1件）I1，於拍賣開始前公佈欲出售之拍賣標的之資料I2、拍賣標的商品圖片I3，起標價格為10,000元I4，底價為負10,000元I5，設定拍賣倒數時間之前之擱置時間及延期次數I6，拍賣結束時間倒數計時設定為24小時I7，設定拍賣標依特定規則遞減金額、設定競標者每次投標代價為點數每1點(25元)；公佈拍賣後依據競標者競標次數降價，直到由最後一位競標者得標。
請參閱圖十一，圖十一係為本發明精煉荷蘭式拍賣方法之第四圖用於電腦網站系統實施結構圖。假設在電腦網站系統上使用回合制的方法，首先，系統先設定投標的報名人數J1，而拍賣的遞減規則是每一回合，標的價格會自動降價一元（降價幅度在每一種標的都可能會不同，假設其他標的是每回合降低兩元），開標之前，會先有擱置期J2，擱置期用來等待系統設定的限制報名人數額滿，假定是2,000人，（也可以不限制報名人數），每一位要報名的人都必須支付手續費（假設是25元），而該場拍賣投標者在報名以後，當開始競標時，即可免費進行投標，但是在拍賣開始之前，該場拍賣會顯示，支付手續費以後，可以免費下標的次數，如果在拍賣過程當中，免費次數使用完畢，投標者可以進行追加的動作，但是追加的動作系統會有限制次數，當預設的擱置期結束後，2,000人均報名額滿，則開始每一回合的競標。在每一回合都會有十秒的倒數時間J3，假定該場拍賣標的之市價是市價20,000元的iphone4S的智慧型手機J4，起標價格是4,000元J5，則拍賣開始第一回合開始，標的價格自動降價成為3,999元，此時十秒會開始倒數，十秒倒數之後，如果該回合只有一人出價，則結標，該投標者即可以3,999元購得該標的，如果該回合十秒倒數截止，有超過一人以上的投標者進行下標動作，則進入下一回合，標的價格降價成為3,998元，因此3,998元的回合開始，同樣十秒倒數計時，以後均以此類推，直至出現唯一投標者。又或者可以是系統限制，該場拍賣出現兩位或三位同標者，視每一場拍賣去決定該場拍賣的決標回合決標人數是幾位。
請參閱圖十二，圖十二係為本發明精煉荷蘭式拍賣方法之第五圖用於電腦網站系統實施結構圖，與圖十二差別之處在於該回合是否有設定保留價格J6（亦即設定總回合數）。
請參閱圖十三，圖十三係為本發明精煉荷蘭式拍賣方法之第六圖用於電腦網站系統實施結構圖。假設欲拍賣之標的為市價20,000元之智慧型手機一隻（標的數量1件）K1，於拍賣開始前公佈欲出售之拍賣標的之資料K2、拍賣標的之商品圖片K3，起標價格為(可為負數值) 10,000元K4，投標代價使用者設定為點數每1點(25元)，每次投標代價為點數1點，設定拍賣倒數延長時間或冷卻時間為1小時K5、設定拍賣標的回合降價區間以及幅度、設定到達降價底限之遞增區間及幅度；拍賣標的競爭至無人投標或時間截止，由最後一位競標者得標。
請參閱圖十四，圖十四係為本發明精煉荷蘭式拍賣方法之第七圖用於電腦網站系統實施結構圖，假設欲拍賣之標的為市價20,000元之智慧型手機一隻（標的數量1件）L1，於拍賣開始前公佈欲出售之拍賣標的之資料L2、拍賣標的商品圖片L3，起標價格為10,000元L4，距離拍賣時間為24小時L5(即為擱置時間)，降價底限為-10,000元L6以及增價底限為10,000元L7。
請參閱圖十五，圖十五係為本發明精煉荷蘭式拍賣方法用於APP微型應用程式實施結構圖，在智慧型手機使用時，欲拍賣之投標者，可先進行二維條碼掃描P1，下載該拍賣系統至手機之中P2，讓投標者能在搭公車、捷運、路邊休息等等時間，均能進行下標動作，並能在隨時隨地都能觀察目前拍賣之標的價格及動態。
本發明係為一種由上述精煉荷蘭式拍賣方法所獲得之系統。
本發明係為一種由上述精煉荷蘭式拍賣方法所獲得之裝置。
以上所述僅是藉由較佳實施例詳細說明本發明精煉荷蘭式拍賣方法，然而對於該實施例所作的任何修改與變化，例如標的之數量，起標價之價格或特定規則之遞減方式等等之變化均不脫離本發明之精神與範圍。
由以上詳細說明可使熟知本項技藝者明瞭本發明的確可達成前述之目的，實已符合專利法之規定，爰依法提出發明專利申請。
The present invention provides a refined Dutch auction method that satisfies buyers, auction system stores, and sellers. In order to enable your review committee to have a better understanding and understanding of the purpose, features and effects of the present invention, please refer to the following diagram for a detailed description.
Please refer to the first figure, which is a flow chart of the unreserved price drop mode of the refined Dutch auction method of the present invention. The invention refines the Dutch auction method, which comprises: the user sets the quantity of the auction target (new, second-hand or service) A1, the initial bid price A2, sets the preset auction countdown time A3, sets the auction countdown extension time and cools Time A4, set the auction target according to the specific rule deduction amount A5, set the bidding cost for the bidder to pay each bid (ie bidding fee, which can be money, bonus, virtual currency, real estate, movable property, securities, commodity) A6 Announce the auction information and start auction A7; the bidder purchases the points and stores the value A8; the bidder selects the auction target and bids A9; the auction target is based on the bidder's bidding price reduction A10; and the auction target bids to the unmanned bidding or time Up to and in compliance with one or more conditions, the last bidder will be awarded A11; by this design, one or more users can flexibly apply this auction method, and can reduce the auctioneer sales pressure and achieve compliance The purpose of the user's auction price.
Please refer to FIG. 2, which is a flow chart of the reserved price drop mode of the refined Dutch auction method of the present invention. The difference from FIG. 1 is that the user can also set the reserve price A12 of the auction target. Wherein, the reserved price can be a negative value.
The invention refines the Dutch auction method, wherein the auction end condition may be an auction time, a total number of bids, a single bidder or a plurality of different bidders simultaneously bidding, a specific time, or reaching a certain amount of the above-mentioned one to a certain amount A variety.
Please refer to FIG. 3, which is a flow chart of the set-down mode of the refined Dutch auction method of the present invention. The invention refines the Dutch auction method, which comprises: the user sets the quantity of the auction target B1, the initial bid price B2, sets the hold time and the delay number B3 before the auction countdown time, sets the auction countdown time B4, sets the auction target The specific rule decrement amount B5, set the bidding cost B6 required for each bid of the bidder; announce the auction information to start the auction and start the bidding at the same time, hold the time to start the countdown B7; the bidder purchases the points and stores the value B8; At the end of the auction, the countdown bidder begins to bid B9; the auction target is based on the number of bidders bidding B10; and the auction target bids to no one with the bid, the time limit or all bidders can count the number of bids, the last one The bidder wins the bid B10; by such design, one or more users can flexibly apply the auction method, and can achieve the purpose of reducing the sales pressure of the auctioneer and meeting the selling price of the user auction.
Please refer to FIG. 4, which is a flow chart of the non-reserved price turn-down mode of the refined Dutch auction method of the present invention.
Assume that the "predetermined number of people to be awarded" is "one person". Each round is counted down for ten seconds. All the bidders who participated in the bidding will not be able to get the bidding information of others. Only the bidding information before the round can be known. . After the expiration of the round bid, the official auction time will be entered, that is, the first round of the countdown will be started for ten seconds. If there is no bidding, the second round will be entered. If the number of bidders is greater than one, the second round will be entered. If the round is in progress, the round is in progress. If there is only one "one" bidder bidding, then "the number of people who meet the default number of awards" will result in a winner; if the number of default bids is three, it must be in accordance with the number of winners. People continue to bid for the round before, until only one person bids in a round, the winner will be produced, that is, the three are the winners. The number of default bids is three. Therefore, if the round bid is in progress, only two bidders or more than four bids in a single round will not meet the default number of "three people", and all will enter the second round until the second round. The winner of the preset is "three people". The meaning of this embodiment is that the user's bid price is set to 5,000 yuan, and the price is reduced by 1 yuan for each bidder's bid, and one round for each dollar, but there is no number of people who meet the preset award within 5,000 rounds. , then enter a negative round (-1 yuan) until the number of people who meet the default decision, this is the turn-based method of unreserved price. If the rounding of the negative value is completed, the user shall, in addition to selling the target to the winning bidder at 0 yuan, reversely pay the negative value of the bidder and the award of the same price.
The invention refines the Dutch auction method, which comprises: the user first setting one or more auction targets and the quantity C1 for one or more bidders to bid; setting the initial initial bid price (which can be a negative value) C2, setting the auction target The bidding cost, the auction price is decremented by the specific rule C3, the set-off time before the countdown of the auction round and the countdown time C4, the rounding price reduction interval of the auction target, the amplitude and the number of people setting the round decision C5, the specific rules mentioned above The bidder bids in the turn-based mode for each bidder's amount; the auction information is published, the hold time begins to count down C6; the bidder purchases the bid price set by the user and stores the value C7; At the end of the round start bid, the bidder selects the target C8; the hold time countdown ends, the preset round time starts counting down and simultaneously reduces the price C9; and the auction end must meet the one or more conditions: whether the round reaches the preset award The number of people is C10, and the number of people who meet the number is the same. The bidders of this round are the winners C11. The successful bidder pays C12 according to the settlement amount, and the unpaid payment is C13; by this design, one or more users can flexibly apply the auction method, and can reduce the auctioneer sales pressure and reach the user auction. The purpose of the sale price.
Please refer to FIG. 5, which is a flow chart of the reserve price turn-down mode of the refined Dutch auction method of the present invention. The so-called reserve price refers to whether there is a total number of rounds. The difference between it and the figure 4 is that there is a total number of rounds. If there is no limit on the total number of rounds as shown in Figure 4, the round will continue to round before the winners are produced. Bidding, until the default total number of rounds, no round bidding. The meaning of this embodiment is that the user's bid price is set to 5,000 yuan, and the total number of rounds is set to 5,000 rounds (that is, the reserve price). Each bidder's bid is reduced by 1 yuan, and each dollar is reduced by one round. Therefore, there are 5,000 rounds. If there are no conditions for the number of people who meet the default criteria within 5,000 rounds, then the end of the fifth round will be "forced flow". The invention refines the Dutch auction method, which comprises: the user first sets one or more auction targets and the quantity D1 for one or more bidders to bid; setting the initial initial bid price (which can be a negative value) D2, setting the auction The bidding price of the bid, the auction price is decremented by the specific rule D3, the set-up time and the countdown time D4 before the countdown time of the auction round, the rounding price reduction interval of the auction target and the amplitude D5, and the number of times the bidder of the bid can be subscripted And the number of purchases D6, the total number of rounds set (the number of declines from the starting price to the end of the reserve price, the total number of rounds determined) and the number of rounds of the round bid D7, the specific rules mentioned above are the bidders in each decrement Bidding bidding behavior is carried out in the turn-based mode; auction information is published, the hold-down time starts counting down D8; the bidder purchases the bidding price set by the user and carries out the stored value D9, the number of times the bidder can set the bid and the number of purchases D10 At the end of the hold time, the round bid is started, the bidder selects the target D11; the hold time countdown ends. Set the rounding time to start the countdown and reduce the price D12 at the same time; and set the end of the auction to meet one or more conditions: whether the number of people who reached the preset award in the round D13, the number of people in the match is the same, and the bidders of the round are the winners. D14, the successful bidder pays D15 according to the settlement amount, and the unpaid payment flowmark D16; by this design, one or more users can flexibly apply the auction method, and can reduce the auctioneer sales pressure and achieve the use. The purpose of the auction price.
Please refer to FIG. 6 , which is a flow chart of the unreserved price mixing mode of the refined Dutch auction method of the present invention. The invention refines the Dutch auction method, which comprises: the user first setting one or more auction targets and the quantity E1 for bidding by one or more bidders; setting the initial starting price of the target (may be a negative value) E2, setting the auction Countdown extension time or cooling time E3, set auction target rounding price reduction interval and amplitude E4, set the bottom of the auction target (can be negative value) E5, set the increment range and amplitude E6 of the arrival price reduction limit, set the bidder for each bid The consideration to be paid E7; the auction information is announced and the auction E8 is started; the bidder purchases the consideration paid by the bid and carries out the stored value E9. At this time, if the time is closed, no bid is issued; the bidder selects the auction target to bid. E10; the price of the target is reduced according to the number of bids of each bidder. If the limit is reached, the price will increase by E11; if the target is competitive to no bid or the time limit, the last bidder will be awarded E12; and the winner will pay according to the amount of the bid. E13; With such a design, one or more users can flexibly apply the auction method, and can reduce the auctioneer sales pressure and achieve the symbol The purpose of the selling price of auction users. The biggest difference between the mixed mode and the falling mode is that it is incremented when it is decremented to the bottom limit. The feature is that the hybrid mode of this embodiment has no reserved price, so it can be continued until there is no other bidder, and the reserved price can be a negative value. This is a technology that has not been developed in the past.
Please refer to FIG. 7 , which is a flow chart of the reserved price mixed mode of the refined Dutch auction method of the present invention. The difference from Figure 6 is whether the drop mode has a set reserve price. That is, the amount of the award is subject to mandatory closing. The invention refines the Dutch auction method, which comprises: the user first sets one or more auction targets and the quantity F1 for one or more bidders to bid; setting the initial initial bid price (which can be a negative value) F2, setting the auction The reciprocal extension time or cooling time F3, the rounding price reduction interval and the amplitude F4 of the auction target, the bottom limit of the auction target (may be a negative value) F5, the bottom limit of the auction target F6, the increment range and the amplitude of the set price limit. F7. Set the price F8 required for each bidder; publish the auction information and start auctioning F9; the bidder purchases the consideration paid by the bid and carries out the stored value F10. At this time, if the time is closed, no bid is submitted; the bidder chooses The auction target for bidding shall be subject to bidding F11; the price of the bid shall be reduced according to the number of bids of each bidder, and if the bid limit is reached, the price will increase by F12; if the bid is competitive to no bid or the time limit, the last bidder will be awarded F13; The successful bidder pays F14 according to the settlement amount; by this design, one or more users can flexibly apply the auction method, and can achieve the reduction Sales pressure and sellers to achieve compliance with the purpose of selling price of auction users.
The invention refines the Dutch auction method, wherein the user can be the person who wants to sell the subject, the subject or the system to be offered; the system can be a website system, a telecommunication system, an APP program or a window application. The window application can be a touch subscript.
The invention refines the Dutch auction method, wherein the decrement setting can be user-defined or randomly decremented by the system; the decrement can be 0 or a negative number (a negative number indicates that the user wants to reversely pay the bidder the same amount of the negative amount) Remuneration).
The present invention refines the Dutch auction method, wherein the specific rule may include setting a limit number of bidder bids and a number of bids required for the bid before the bidding starts.
The invention refines the Dutch auction method, wherein the specific rule can be used for the bidding behavior of the bidder in the turn-based mode in each decremented amount.
The invention refines the Dutch auction method, wherein the starting price can be the market price or the cost price of the auction target.
The invention refines the Dutch auction method, wherein the bid price may be a specific fold of the market price or cost price of the auction target, a random fold number or a proportional fold with reference to the use period and the nature of the auction target.
The present invention refines the Dutch auction method, wherein the auction target may be tangible or invisible or both.
The invention refines the Dutch auction method, wherein the decrement amount can be decremented according to the amount of the bid according to the extent of the section.
The invention refines the Dutch auction method, wherein the user can add one or more of the above-mentioned refined Dutch auction methods of the present invention for setting the auction time, the description of the auction target, and the number of subscripts, wherein a hold setting can be added for the auction start Set the hold time, and the original scheduled auction time will start after the time has elapsed.
The present invention refines the Dutch auction method in which the user can end the auction time early when the auction target is unmanned or when the bid price is too high or too low.
The present invention refines the Dutch auction method in which the winner can have a limit on the number of times the target is awarded within a certain time.
The invention refines the Dutch auction method, wherein the user can set the target number of the target of the label, and the winner can choose to purchase the number of the target within the set number.
The invention refines the Dutch auction method, wherein the bidder who purchases the number of bids may have the number of bids at least once or more after purchasing a single bid number or may be an unlimited number of bids after purchasing a single bid number.
The invention refines the Dutch auction method, wherein the subscript time and the number of subscripts can be displayed at any time.
The present invention refines the Dutch auction method, wherein the specific rule may be to set an automatic bid to bid.
The present invention refines the Dutch auction method, wherein the bidder who purchases the bidding amount by paying the bidding price has the bidding qualification, and the bidding purchase price is not paid, and does not have the bidding qualification.
The invention refines the Dutch auction method, wherein the method can be used by the bidder to practice the simulation system before the implementation.
The invention refines the Dutch auction method, wherein before the auction hold time expires or before the auction time starts, the user may actively remind the bidder to enter the originally scheduled auction by SMS, letter, telecommunication, fax or internet. Time or upcoming bidding.
The present invention refines the Dutch auction method, wherein the reminder or notification time may be a time period or a time point or a plurality of time points selected by the bidder to be reminded or informed.
The present invention refines the Dutch auction method, wherein the method can be performed manually.
Please refer to FIG. 8 , which is the first diagram of the refined Dutch auction method of the present invention for the implementation of the computer website system. Assume that the target of the auction is a smart phone with a market price of 20,000 yuan (1 quantity of the target) G1. Before the auction starts, the information of the auction target G2 and the auction target product G3 are announced. The bid price is 10,000 yuan. G4, the bidding price user is set to 1 point (25 yuan) for each point, the bid price is 1 point for each bid, the countdown time of the auction end time is set to 24 hours G5, and the countdown to the last ten seconds is extended. The time is 5 seconds, the bidding freight is set to 100 yuan, the bidder A first purchases the stored value of the auction site's point card, then browses the target, selects the target to be bid, starts bidding with other bidders, and finally counts down the auction. When the time is over or no one is competing with it, the auction is ended. The bidder pays the target price and the freight of the target according to the current price. If the price of the target is negative when the price is closed, the bidder only needs to pay the price. The freight rate of the target, and the negative value is paid by the user for the same consideration. If the bidder fails to pay the freight or discards the bid, the winner of the subject will be awarded the second pick or Mark.
Please refer to FIG. 9 , which is a second diagram of the refined Dutch auction method of the present invention for the implementation of the computer website system. Assume that the target of the auction is a smart phone with a market price of 20,000 yuan (1 quantity of the target) H1. Before the auction starts, the information of the auction target H2 and the auction target product picture H3 are announced. The bid price is 10,000 yuan H4. The reserve price is negative 10,000 yuan H5, the bidding price user is set to 1 point per point (25 yuan), the bid price is 1 point for each bid, and the auction end time countdown is set to 24 hours H6, countdown to last ten Within seconds, the auction reciprocal time is extended for 5 seconds, and the winning shipping fee is set to 100 yuan. The bidder A first purchases the stored value of the auction site's credit card, then browses the target, selects the target to be bid, and starts bidding with other bidders. When the time of the last auction countdown ends, no one competes with it or reaches the auction reserve price, the auction is ended. The bidder pays the target price and the standard freight according to the current price. If the bid is closed, the price of the target is For a negative number, the bidder only needs to pay the freight of the target, and the negative value is paid by the user for the same consideration. If the bidder fails to pay the freight or discards the mark, the target The winner will be awarded the second or second prize.
Please refer to FIG. 10, which is the third diagram of the refined Dutch auction method of the present invention for the implementation of the computer website system. Assume that the target of the auction is a smart phone with a market price of 20,000 yuan (1 quantity of the target) I1. Before the auction, the information of the auction target I2, the auction target product picture I3, and the bid price of the auction item are 10,000 yuan I4. The reserve price is negative 10,000 yuan I5, set the hold time and delay number I6 before the auction countdown time, the auction end time countdown is set to 24 hours I7, set the auction target to decrement according to the specific rules, set the bidder's bid price for each bid. The number is every 1 point (25 yuan); after the auction is announced, the price is reduced according to the number of bidders bidding until the last bidder wins the bid.
Please refer to FIG. 11. FIG. 11 is a fourth structural diagram of the refined Dutch auction method of the present invention for the implementation of a computer website system. Assume that the turn-based method is used on the computer website system. First, the system first sets the number of bids for the bid J1, and the declining rule for the auction is that each round, the price of the bid will be automatically reduced by one yuan (the price reduction may be different for each type of target). Assume that the other targets are reduced by two yuan per round. Before the bid opening, there will be a shelving period of J2. The shelving period is used to wait for the system to set the limit of the number of applicants, which is assumed to be 2,000 people (or the number of applicants may not be restricted). Everyone who wants to register must pay a handling fee (assuming 25 yuan), and the auction bidder can bid freely when bidding starts, but before the auction starts, the auction will be held. It shows that after the payment of the handling fee, the number of times the subscript can be deduced freely. If the free number of times is used during the auction process, the bidder can perform additional actions, but the additional action system will have a limit number of times, after the preset hold period is over. If 2,000 people are enrolled in full, they will start bidding for each round. There will be a ten-second countdown time J3 in each round. Assuming that the market price of the auction target is the iphone4S smart phone J4 with a market price of 20,000 yuan, the starting price is 4,000 yuan J5, then the auction begins the first round, the target price The automatic price reduction becomes 3,999 yuan. At this time, the ten seconds will start to count down. After ten seconds of reciprocal, if there is only one person bidding for the round, then the bidder can purchase the target for 3,999 yuan. If the round ten seconds countdown, If a bidder with more than one person performs the subscript action, the next round will be entered, and the price of the target will be reduced to 3,998 yuan. Therefore, the round of 3,998 yuan will start, and the countdown of the same ten seconds will be followed by the same bidder until the only bidder appears. Or it may be a system limitation. There are two or three same bidders in the auction. The number of people who decide on the auction to determine the number of rounds of the auction is several.
Please refer to Figure 12, which is the fifth diagram of the refined Dutch auction method of the present invention for the implementation of the computer website system. The difference from Figure 12 is whether the round has a set reserve price of J6 (ie, Set the total number of rounds).
Please refer to FIG. 13, which is a sixth structural diagram of the refined Dutch auction method of the present invention for the implementation of a computer website system. Assume that the target of the auction is a smart phone with a market price of 20,000 yuan (the number of the target is 1) K1. Before the auction, the information of the auction target K2 and the auction target product K3 are announced. The bid price is ( For a negative value) 10,000 yuan K4, the bidding cost user is set to the number of points per 1 point (25 yuan), each bid price is 1 point, set the auction reciprocal extension time or cooling time is 1 hour K5, set the auction target The round-off price range and the range, the increment range and the range of the set price limit to reach the price reduction; the auction target competition to no-bid or time-off, the last bidder won the bid.
Please refer to Figure 14. Figure 14 is the seventh diagram of the refined Dutch auction method of the present invention for the implementation of the computer website system structure structure, assuming that the target of the auction is a smart phone with a market price of 20,000 yuan (the number of targets 1 L1, before the auction starts, the information of the auction target to be sold L2, the auction product image L3, the bid price is 10,000 yuan L4, the auction time is 24 hours L5 (that is, the hold time), the price reduction limit is - 10,000 yuan L6 and the price increase limit is 10,000 yuan L7.
Please refer to FIG. 15 , which is a structural diagram of the implementation of the APP micro-application for the refined Dutch auction method of the present invention. When using the smart phone, the bidder who wants to auction may first perform a two-dimensional barcode scanning P1. Download the auction system to the mobile phone P2, so that the bidder can carry out the bidding action when taking the bus, the MRT, the roadside rest, etc., and can observe the current auction price and dynamics anytime and anywhere. .
The present invention is a system obtained by the above-described refined Dutch auction method.
The present invention is an apparatus obtained by the above-described refined Dutch auction method.
The above description is only a detailed description of the refined Dutch auction method of the present invention by the preferred embodiment, however, any modifications and variations to the embodiment, such as the number of the subject matter, the price of the bid price or the decrement of the specific rules, etc., etc. Changes may be made without departing from the spirit and scope of the invention.
From the above detailed description, those skilled in the art can understand that the present invention can achieve the foregoing objects, and has already met the requirements of the Patent Law, and has filed an invention patent application according to law.

A1．．．使用者設定拍賣標的之數量A1. . . User sets the number of auction targets

A2．．．設定初始之起標價A2. . . Set the initial starting price

A3．．．設定預設之拍賣倒數時間A3. . . Set the default auction countdown time

A4．．．設定拍賣倒數延長時間以及冷卻時間A4. . . Set auction reciprocal extension time and cooling time

A5．．．設定拍賣標依特定規則遞減金額A5. . . Set the auction target to decrement according to the specific rules

A6．．．設定競標者每次投標所需支付之投標代價A6. . . Set the bidding cost for each bidder's bid

A7．．．公佈拍賣資訊並開始拍賣A7. . . Publish auction information and start auction

A8．．．競標者購買點數並儲值A8. . . Bidders buy points and store value

A9．．．競標者選擇拍賣標的並進行競標A9. . . The bidder chooses the auction target and bids

A10．．．拍賣標的依據競標者競標次數降價A10. . . The auction target is based on the bidder bidding price reduction

A11．．．拍賣標的競標至無人與之競標或時間截止並符合至一至多個條件，由最後一位競標者得標A11. . . Auction bidding to no one with the bid or time limit and meet one or more conditions, the last bidder won the bid

A12．．．設定初始之起標價以及保留價格(可為負數值)A12. . . Set the initial starting price and the reserve price (may be negative)

B1．．．使用者設定拍賣標的之數量B1. . . User sets the number of auction targets

B2．．．設定初始之起標價以及保留價格(可為負數值)B2. . . Set the initial starting price and the reserve price (may be negative)

B3．．．設定拍賣倒數時間之前之擱置時間及延期次數B3. . . Set the hold time and number of delays before the auction countdown time

B4．．．設定拍賣倒數時間B4. . . Set the auction countdown time

B5．．．設定拍賣標依特定規則遞減金額B5. . . Set the auction target to decrement according to the specific rules

B6．．．設定競標者每次投標所需支付之投標代價B6. . . Set the bidding cost for each bidder's bid

B7．．．公佈拍賣資訊開始拍賣並同時開始集標、擱置時間開始倒數計時B7. . . Announce the auction information and start the auction. At the same time, start collecting the bids and set the time to start counting down.

B8．．．競標者購買點數並儲值B8. . . Bidders buy points and store value

B9．．．擱置時間結束則開始拍賣倒數競標者開始進行競標B9. . . At the end of the hold time, the auction countdown bidder begins to bid.

B10．．．拍賣標的依據競標者競標次數降價B10. . . The auction target is based on the bidder bidding price reduction

B11．．．拍賣標的競標至無人與之競標、時間截止或所有競標者可下標次數用盡時，由最後一位競標者得標B11. . . When the auction target bids to no one with the bid, the time limit or all bidders can use the number of subscripts, the last bidder wins the bid

C1．．．使用者先設定一至多個拍賣標的及數量C1. . . The user first sets the number and quantity of one or more auction targets.

C2．．．設定標的初始之起標價格C2. . . Set the initial starting price of the target

C3．．．設定拍賣標的之投標代價，使拍賣價格依特定規則遞減金額C3. . . Set the bidding price of the auction target so that the auction price is decremented according to the specific rules.

C4．．．預設拍賣回合倒數時間之前之擱置時間及回合倒數時間C4. . . Preset the auction time before the countdown time and the countdown time

C5．．．設定拍賣標的回合降價區間、幅度以及設定回合決標之人數C5. . . Set the rounding price range, the range of the auction target, and the number of people who set the round

C6．．．公佈拍賣資訊、擱置時間開始倒數計時C6. . . Announce auction information, set aside time to count down

C7．．．競標者購買使用者所設定之投標代價並進行儲值C7. . . The bidder purchases the bidding price set by the user and performs the stored value

C8．．．於擱置時間結束開始進行回合投標，競標者選擇標的C8. . . At the end of the hold time, the round bid is started, and the bidder selects the target.

C9．．．擱置時間倒數計時結束，預設回合時間開始倒數計時並同時降價C9. . . The countdown time is over, the preset round time starts counting down and the price is reduced at the same time.

C10．．．該回合是否達成預設決標之人數C10. . . Whether the number of people who reached the preset award in the round

C11．．．符合人數則結標，該回合競標者均為得標者C11. . . The number of people who meet the number is the same, and the bidders of the round are the winners.

C12．．．得標者依結標金額付款C12. . . The successful bidder pays according to the settlement amount

C13．．．未付款則流標C13. . . Flow not marked

D1．．．使用者先設定一至多個拍賣標的及數量D1. . . The user first sets the number and quantity of one or more auction targets.

D2．．．設定標的初始之起標價格D2. . . Set the initial starting price of the target

D3．．．設定拍賣標的之投標代價，使拍賣價格依特定規則遞減金額D3. . . Set the bidding price of the auction target so that the auction price is decremented according to the specific rules.

D4．．．預設拍賣回合倒數時間之前之擱置時間及回合倒數時間D4. . . Preset the auction time before the countdown time and the countdown time

D5．．．設定拍賣標的回合降價區間以及幅度D5. . . Set the rounding price range and range of the auction target

D6．．．設定每次競標者投標所需支付之代價D6. . . Set the price to be paid for each bidder's bid

D7．．．設定總回合數以及回合競標之決標人數D7. . . Set the total number of rounds and the number of rounds for the round of bids

D8．．．公佈拍賣資訊、擱置時間開始倒數計時D8. . . Announce auction information, set aside time to count down

D9．．．競標者購買使用者所設定之投標代價並進行儲值D9. . . The bidder purchases the bidding price set by the user and performs the stored value

D10．．．設定該標的競標者可下標次數及可購買次數D10. . . Set the number of times the bidder can bid and the number of purchases

D11．．．於擱置時間結束開始進行回合投標，競標者選擇標的D11. . . At the end of the hold time, the round bid is started, and the bidder selects the target.

D12．．．擱置時間倒數計時結束，預設回合時間開始倒數計時並同時降價D12. . . The countdown time is over, the preset round time starts counting down and the price is reduced at the same time.

D13．．．該回合是否達成預設決標之人數D13. . . Whether the number of people who reached the preset award in the round

D14．．．符合人數則結標，該回合競標者均為得標者D14. . . The number of people who meet the number is the same, and the bidders of the round are the winners.

D15．．．得標者依結標金額付款D15. . . The successful bidder pays according to the settlement amount

D16．．．結束D16. . . End

E1．．．使用者先設定一至多個拍賣標的及數量E1. . . The user first sets the number and quantity of one or more auction targets.

E2．．．設定標的初始之起標價格E2. . . Set the initial starting price of the target

E3．．．設定拍賣倒數延長時間或冷卻時間E3. . . Set auction reciprocal extension time or cooling time

E4．．．設定拍賣標的降價區間以及幅度E4. . . Set the price range and range of the auction target

E5．．．設定拍賣標的之底限E5. . . Set the bottom limit of the auction target

E6．．．設定到達降價底限之遞增區間及幅度E6. . . Set the increment range and range of the arrival price limit

E7．．．設定每次投標競標者所需支付之代價E7. . . Set the price to be paid for each bidder

E8．．．公佈拍賣資訊並開始拍賣E8. . . Publish auction information and start auction

E9．．．競標者購買投標所需支付之代價並進行儲值E9. . . The price paid by the bidder to purchase the bid and the stored value

E10．．．競標者選擇欲投標之拍賣標的定進行投標E10. . . The bidder selects the auction target to be bidding and bids

E11．．．標的之價格依各競標者投標次數降價，若達到底限時則增價E11. . . The price of the target is reduced according to the number of bids of each bidder, and if the limit is reached, the price will increase.

E12．．．標的之價格依各競標者投標次數降價，若達到底限時則增價E12. . . The price of the target is reduced according to the number of bids of each bidder, and if the limit is reached, the price will increase.

E13．．．標的競爭致無人投標或時間截止，由最後一位競標者得標E13. . . The target competition leads to no bid or time limit, and the last bidder wins the bid.

E14．．．得標者依結標金額付款E14. . . The successful bidder pays according to the settlement amount

G1．．．智慧型手機一隻G1. . . Smart phone

G2．．．拍賣標的之資料G2. . . Auction target information

G3．．．拍賣標的之商品圖片G3. . . Auction image

G4．．．起標價格G4. . . Starting price

G5．．．倒數計時設定G5. . . Countdown setting

H1．．．智慧型手機一隻H1. . . Smart phone

H2．．．拍賣標的之資料H2. . . Auction target information

H3．．．拍賣標的之商品圖片H3. . . Auction image

H4．．．起標價格H4. . . Starting price

H5．．．底價H5. . . Reserve price

H6．．．倒數計時H6. . . countdown

I1．．．智慧型手機一隻I1. . . Smart phone

I2．．．拍賣標的之資料I2. . . Auction target information

I3．．．拍賣標的之商品圖片I3. . . Auction image

I4．．．起標價格I4. . . Starting price

I5．．．底價I5. . . Reserve price

I6．．．擱置時間及延期次數I6. . . Shelving time and number of delays

I7．．．倒數計時I7. . . countdown

J1．．．報名人數J1. . . Number of applicants

J2．．．擱置期J2. . . Shelving period

J3．．．倒數時間J3. . . Countdown time

J4．．．智慧型手機J4. . . Smart phone

J5．．．起標價格J5. . . Starting price

J6．．．保留價格J6. . . Reserve price

K1．．．智慧型手機一隻K1. . . Smart phone

K2．．．拍賣標的之資料K2. . . Auction target information

K3．．．拍賣標的之商品圖片K3. . . Auction image

K4．．．起標價格K4. . . Starting price

K5．．．延長時間K5. . . Extension of time

L1．．．智慧型手機一隻L1. . . Smart phone

L2．．．拍賣標的之資料L2. . . Auction target information

L3．．．拍賣標的之商品圖片L3. . . Auction image

L4．．．起標價格L4. . . Starting price

L5．．．拍賣時間L5. . . Auction time

L6．．．降價底限L6. . . Price reduction limit

L7．．．增價底限L7. . . Price increase limit

P1．．．二維條碼掃描P1. . . 2D barcode scanning

P2．．．下載該拍賣系統至手機之中P2. . . Download the auction system to your phone

第一圖係為本發明精煉荷蘭式拍賣方法之無保留價下降模式流程圖
第二圖係為本發明精煉荷蘭式拍賣方法之有保留價下降模式流程圖
第三圖係為本發明精煉荷蘭式拍賣方法之集標下降模式流程圖
第四圖係為本發明精煉荷蘭式拍賣方法之無保留價回合制下降模式流程圖
第五圖係為本發明精煉荷蘭式拍賣方法之有保留價回合制下降模式流程圖
第六圖係為本發明精煉荷蘭式拍賣方法之無保留價混合模式流程圖
第七圖係為本發明精煉荷蘭式拍賣方法之有保留價混合模式流程圖
第八圖係為本發明精煉荷蘭式拍賣方法之第一圖用於電腦網站系統實施結構圖
第九圖係為本發明精煉荷蘭式拍賣方法之第二圖用於電腦網站系統實施結構圖
第十圖係為本發明精煉荷蘭式拍賣方法之第三圖用於電腦網站系統實施結構圖
第十一圖係為本發明精煉荷蘭式拍賣方法之第四圖用於電腦網站系統實施結構圖
第十二圖係為本發明精煉荷蘭式拍賣方法之第五圖用於電腦網站系統實施結構圖
第十三圖係為本發明精煉荷蘭式拍賣方法之第六圖用於電腦網站系統實施結構圖
第十四圖係為本發明精煉荷蘭式拍賣方法之第七圖用於電腦網站系統實施結構圖
第十五圖係為本發明精煉荷蘭式拍賣方法用於APP微型應用程式實施結構圖
The first figure is a flowchart of the unreserved price drop mode of the refined Dutch auction method of the present invention. The second figure is a flow chart of the reserved price drop mode of the refined Dutch auction method of the present invention. The third figure is the refined Dutch style of the present invention. The fourth chart of the auction method's set-down mode is the flow chart of the unreserved price-based turn-down mode of the refined Dutch auction method of the present invention. The fifth figure is the reserve price turn-down of the refined Dutch auction method of the present invention. The sixth diagram of the mode flow chart is a flowchart of the unreserved price mixing mode of the refined Dutch auction method of the present invention. The seventh figure is the flow chart of the reserved price mixed mode of the refined Dutch auction method of the present invention. The first picture of the refined Dutch auction method is used for the implementation of the computer website system. The ninth picture is the second picture of the refined Dutch auction method of the present invention. The structure of the computer website system is shown in the figure. The tenth figure is the invention of the Netherlands. The third figure of the auction method is used for the implementation of the computer website system. The eleventh figure is the fourth picture of the refined Dutch auction method of the present invention. The computer network system implementation structure diagram The twelfth figure is the fifth diagram of the refined Dutch auction method of the present invention for the computer website system implementation structure diagram. The thirteenth diagram is the sixth figure of the refined Dutch auction method of the present invention. The fourteenth figure of the computer website system implementation structure is the seventh figure of the refined Dutch auction method of the present invention for the computer website system implementation structure. The fifteenth figure is the refined Dutch auction method for the APP micro application. Implementation structure

A2．．．設定初始之起標價A2. . . Set the initial starting price

Claims

A refined Dutch auction method that includes:
(A) The user first sets the starting price of one or more auction targets for bidding by one or more bidders;
(B) setting the bidding price of the auction target so that the auction price is decremented according to a specific rule;
(C) setting the end of the auction must meet one or more conditions;
With such a design, one or more users can flexibly apply the auction method, thereby achieving the purpose of reducing the sales pressure of the auctioneer and meeting the selling price of the user's auction.

The refining Dutch auction method as described in claim 1, wherein the auction end condition of step (C) may be auction time, total number of bids, single bidder or several different bidders simultaneously bidding, specific Time, or one or more of the above-mentioned specific amounts.

The refining Dutch auction method as described in claim 1, wherein the user can be the person who wants to sell the subject, the person or system to be offered.

The refined Dutch auction method as described in claim 3, wherein the system can be a website system or a telecommunication system; the system can be an APP program or a window application.

The refined Dutch auction method as described in claim 4, wherein the window application is a touch-sensitive subscript.

The refined Dutch auction method as described in claim 1, wherein the method can be manually implemented.

The refining Dutch auction method as described in claim 1, claim 2, item 3 or item 6, wherein the decrementing setting may be user-defined or randomly decremented by the system; Is 0 or a negative number.

The refining Dutch auction method as described in claim 7, wherein the specific rule may include setting a limit number of bidder bids and a bid count required for the bid before the bidding starts.

The refining Dutch auction method as described in claim 7 wherein the specific rule may be a bidding behavior for the bidder in a turn-based mode in each decremented amount.

The refined Dutch auction method as described in claim 7 wherein the bid price may be the market price or the cost price of the auction target.

The refined Dutch auction method as described in claim 7, wherein the bid price may be a specific discount of the market price or cost price of the auction target, a random fold number or a reference period of use and a nature of the auction target. Folding number.

The refining Dutch auction method as described in claim 1, claim 2, item 3 or item 6, wherein the auction object may be tangible or invisible or both.

A refined Dutch auction method as described in claim 7 wherein the auction target may be tangible or intangible or both.

For example, the refined Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the bid price may be the market price or cost price of the auction target.

For example, the refined Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the bid price may be a specific number of folds or random folds of the market price or cost price of the auction target. The number is either a reference to the period of use and the proportion of the nature of the auction target.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the specific rule user can set the price reduction range, the decrement interval, and the single decrement amount of the auction target. Or one or more of the above-mentioned ranges of declining amounts.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the declining amount may be decremented according to the amount of the bid.

For example, in the refining Dutch auction method described in claim 7, wherein the declining amount may be decremented according to the amount of the bid.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the user can increase the one or more of the set auction time, the description of the auction target, and the number of subscripts.

The refining Dutch auction method as described in claim 7 wherein the user can increase the one or more of the set auction time, the description of the auction target, and the number of subscripts.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein a set of holds can be added for setting the hold time after the start of the auction, and the waiting time is after the hold. That is, the original scheduled auction time begins.

For example, in the refining Dutch auction method described in claim 7, wherein a set-up setting may be added for setting the hold time after the auction starts, and the originally scheduled auction time is started after the hold-up time.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein a cooling setting may be added, which sets the cooling time after the new bid, the cooling time to be cooled. Go to the auction process again.

For example, in the refining Dutch auction method described in claim 7, wherein a cooling setting may be added, which sets the cooling time after the new bidding, and the cooling time is up to the subsequent auction process.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the user can also set the reserve price of the auction item.

The refining Dutch auction method as described in claim 7 wherein the user can also set a reserve price for the auction target.

A refined Dutch auction method as described in claim 30, wherein the reserve price can be a negative value.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein when the auction target is unmanned or when the bid price is too high or too low, the user may End the auction time early.

For example, in the refining Dutch auction method described in claim 7, wherein the user may end the auction time early when the auction target is unmanned or when the bid price is too high or too low.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, the setting of an extension setting may be added to be used when a new bid occurs at the end of the auction time. Add an extension time outside the set auction time.

For example, in the refining Dutch auction method described in claim 7, wherein the setting of an extension may be added to increase an extension time outside the set auction time when a new bid occurs at the end of the auction time.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the winner can have a limit on the number of times of bidding within a certain time period.

For example, the refined Dutch auction method described in claim 7 of the patent application, wherein the winner can have a limit on the number of times of bidding within a certain time.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the user can set the number of the target of the subject of the label, the winner can choose Purchase the quantity of the target within the set quantity.

For example, in the refining Dutch auction method described in claim 7, wherein the user can set the target quantity of the target of the label, and the winner can choose to purchase the quantity of the target within the set quantity.

For example, the refined Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the bidder who purchases the number of bids may have bids at least once after purchasing a single bid. Or more than a few times.

The refining Dutch auction method as described in claim 7, wherein the bidder who purchases the number of bids may have bids at least once or more after purchasing a single bid.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the bidder who purchases the number of bids may have an unlimited bid after purchasing a single bid. frequency.

For example, in the refining Dutch auction method described in claim 7, wherein the bidder who purchases the number of bids may have an unlimited number of bids after purchasing a single bid.

For example, in the refined Dutch auction method described in the first, second, third or sixth patent scope, the subscript time and the number of subscripts can be displayed at any time.

For example, the refined Dutch auction method described in claim 7 can display the subscript time and the number of subscripts at any time.

The refined Dutch auction method as described in claim 1, claim 2, item 3, item 4 or item 5, wherein the specific rule may be to set an automatic bid to bid.

The refined Dutch auction method as described in claim 7, wherein the specific rule may be to set an automatic bid to perform the bidding.

For example, in the refining Dutch auction method described in claim 1, item 2, item 3 or item 6, wherein the number of bids for the auction object may be the bid price set by the user and the bidding starts. Previously purchased by the bidder.

For example, in the refining Dutch auction method described in claim 44, the bidder who purchases the bidding amount for paying the bidding price, has the bidding qualification, and does not have the bidding qualification to purchase the bidding number, and does not have the bidding qualification.

For example, the refining Dutch auction method described in claim 1, item 2 or item 3, wherein the method can be used for the bid simulator to practice the simulation system before the implementation.

For example, the refining Dutch auction method described in claim 7 of the patent application, wherein the method can be used for the bid simulator to practice the simulation system before the implementation.

For example, the refined Dutch auction method described in claim 1, item 2 or item 3, wherein the auction is held before the deadline or before the auction time, the user may take the initiative to send a newsletter, letter, telecommunications , fax or internet to remind bidders to enter the original scheduled auction time or to start bidding.

The refining Dutch auction method as described in claim 1, item 2 or item 3, wherein the reminder or notification time may be a time period or a time point or multiples selected by the bidder to be reminded or informed. Time point.

A system obtained by the refined Dutch auction method described in item 1, item 2 or item 3 of the patent scope.

A device obtained by the refined Dutch auction method described in the first, second or third aspect of the patent.

A refined Dutch auction method that includes:
(A) The user first sets the starting price of one or more auction targets for bidding by one or more bidders;
(B) setting the bidding price of the auction target so that the auction price is decremented according to a specific rule, which is the first increment and then the decrement or the first increment and then the decrement or both;
(C) setting the end of the auction must meet one or more conditions;
With such a design, one or more users can flexibly apply the auction method, thereby achieving the purpose of reducing the sales pressure of the auctioneer and meeting the selling price of the user's auction.

The refined Dutch auction method as described in claim 52, wherein the specific rule may include setting a limit number of bidder bids and a bid count required for the bid before the bidding starts.

The refining Dutch auction method as described in claim 52, wherein the auction end condition of step (C) may be auction time, total number of bids, single bidder or several different bidders simultaneously bidding, specific Time, or one or more of the above-mentioned specific amounts.

For example, the refined Dutch auction method described in claim 52, wherein the user can be the subject who wants to sell the subject, the subject or system to be offered.

A refined Dutch auction method as described in claim 52, wherein the system can be a website system or a telecommunications system.

For example, the refined Dutch auction method described in claim 52, wherein the system can be an APP program or a window application.

The refined Dutch auction method as described in claim 52, wherein the window application can be a touch-based subscript.

A refined Dutch auction method as described in claim 52, wherein the method can be manually implemented.

A refined Dutch auction method as described in claim 52, claim 53, 54 or 55 or claim 59, wherein the auction target may be tangible or intangible or both.

The refined Dutch auction method as described in claim 52, 53, 53, 54, or 59, wherein the specific rule may be a round for each bidder in the amount of the decrement The bidding behavior is carried out in the system mode.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the bid price may be the market price or cost price of the auction target.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the bid price may be a specific discount of the market price or the cost price of the auction object. The number, random number, or the proportion of the reference period and the nature of the auction target.

For example, in the refining Dutch auction method described in Item 52, Item 53, Item 54, Item 55 or Item 59, the user can set the price reduction range, the decreasing range, and the single decrement of the auction target. One or more of the above amounts or ranges of declining amounts.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the declining amount may be decremented according to the amount of the bid.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the reminder or notification time may be selected or reminded by the bidder. The time period or time point or multiple time points.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, the user may increase the set auction time, the description of the auction target, and the number of subscripts. One or more of the above.

For example, in the refined Dutch auction method described in Item 52, Item 53, Item 54, Item 55 or Item 59, a set of holds can be added for setting the hold time after the auction starts. The original scheduled auction time begins after the time has elapsed.

For example, in the refined Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein a cooling setting may be added, the setting is set in the cooling time after the new bidding Wait until the cooling time to continue the auction process.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, the user may also set the reserve price of the auction item.

For example, in the refining Dutch auction method described in Article 52, Item 53, Item 54, Item 55 or Item 59 of the patent application, in which when the auction target is unsuccessful or when the bid price is too high or too low The user can end the auction time early.

For example, in the refining Dutch auction method described in Item 52, Item 53, Item 54, Item 55 or Item 59, the setting of an extension may be added to appear at the end of the auction time. An additional time can be added outside the set auction time for new bids.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, the winner may have a limit on the number of times of bidding within a specified time.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the user can set the number of the target of the subject of the label, which is The bidder can choose to purchase the quantity of the target within the set quantity.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the bidder of the number of bids may be purchased after a single bid. Have a bid at least once or more than one time.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the bidder of the number of bids may be purchased after a single bid. With unlimited bids.

For example, in the refined Dutch auction method described in Item 52, Item 53, Item 54, Item 55 or Item 59, the time of subscripting and the number of times of subscripting can be displayed at any time.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the specific rule may be to set an automatic bid to bid.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the number of bids for the auction target may be the bid price set by the user. It is purchased by the bidder before the bidding starts.

For example, the refining Dutch auction method described in the 52nd, 53rd, 54th, 55th or 59th patent application scope, wherein the method can be practiced by the bidder before the implementation The analog system used.

For example, in the refining Dutch auction method described in claim 52, item 53, item 54, item 55 or item 59, wherein the auction is held before the deadline or before the auction time, it may be used. The applicant will take the initiative to remind the bidder to enter the originally scheduled auction time or to start bidding by SMS, letter, telecommunications, fax or internet.

A system obtained by the refined Dutch auction method described in Item 52, Item 53, or Item 55 of the Patent.

A device obtained by the refined Dutch auction method described in claim 52, item 53, or item 55 of the patent.

A refined Dutch auction method that includes:
(A) The user first sets the starting price of one or more auction targets for bidding by one or more bidders;
(B) setting the bidding price of the auction target so that the auction price is decremented according to a specific rule, which is to set the number of biddings for limiting the bidder and the number of bids required for the bid before the bidding starts;
(C) setting the end of the auction must meet one or more conditions;
With such a design, one or more users can flexibly apply the auction method, thereby achieving the purpose of reducing the sales pressure of the auctioneer and meeting the selling price of the user's auction.

The refining Dutch auction method as described in claim 84, wherein the auction end condition of step (C) may be an auction time, a total number of bids, a single bidder or a plurality of different bidders simultaneously bidding, specific Time, or one or more of the above-mentioned specific amounts.

A refined Dutch auction method as described in claim 84, wherein the user can be the subject or the system to be offered the subject.

A refined Dutch auction method as described in claim 86, wherein the system can be a website system or a telecommunications system.

For example, the refined Dutch auction method described in claim 86, wherein the system can be an APP program or a window application.

The refining Dutch auction method as described in claim 88, wherein the window application can be a touch subscript.

A refined Dutch auction method as described in claim 84, wherein the method can be performed manually.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the specific rule may bid for the bidder in a turn-based mode for each decremented amount. Bidding behavior.

The refined Dutch auction method as described in claim 84, claim 85, item 86 or item 90, wherein the auction target may be tangible or intangible or both.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the bid price may be the market price or cost price of the auction target.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the bid price may be a specific discount or random fold of the market price or cost price of the auction target. The number is either a reference to the period of use and the proportion of the nature of the auction target.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the specific rule user can set the price reduction range, the decrement interval, and the single decrement amount of the auction target. Or one or more of the above-mentioned ranges of declining amounts.

For example, in the refined Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent scope, the amount of the deduction may be decremented according to the amount of the bid according to the extent of the section.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the reminder or notification time may be a time period or time selected by the bidder to be reminded or informed. Points or multiple points in time.

For example, in the refining Dutch auction method described in claim 84, claim 85, item 86 or item 90, the user may increase one or more of the above-mentioned setting of the auction time, the description of the auction target, and the number of subscripts.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, a set of holds may be added for setting the hold time after the start of the auction, and the waiting time is after the hold. That is, the original scheduled auction time begins.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, the user may also set the reserve price of the auction item.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein when the auction target is unmanned or when the bid price is too high or too low, the user may End the auction time early.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein the setting of an extension may be added to be used when a new bid occurs at the end of the auction time. Add an extension time outside the set auction time.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, the winner may have a limit on the number of times of bidding within a specified time.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein the number of bids may be limited, the number of bids may be set after the bidding starts or the bidding for additional sales may be set. frequency.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the user can set the target number of the subject of the label, the winner can choose Purchase the quantity of the target within the set quantity.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the bidder who purchases the number of bids may have bids at least once after purchasing a single bid. Or more than a few times.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the bidder who purchases the number of bids may have an unlimited bid after purchasing a single bid number. frequency.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, the subscript time and the number of subscripts can be displayed at any time.

For example, the refining Dutch auction method described in claim 84, claim 85, item 86 or item 90, wherein the specific rule may be to set an automatic bid to bid.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90, wherein the bidding quantity of the auction object may be the bidding price set by the user and the bidding start Previously purchased by the bidder.

For example, the refined Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein the method can be used for the bid simulator to practice the simulation system before the implementation. .

For example, the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein the auction is held before the deadline or before the auction time begins, the user may take the initiative to send a newsletter. , letters, telecommunications, fax or internet to remind bidders to enter the original scheduled auction time or to start bidding.

For example, in the refining Dutch auction method described in claim 84, item 85, item 86 or item 90 of the patent application, wherein the auction start time may be closed at the end of the countdown time or the set-off time is closed, and the bidding success cannot be successful. Next, the user can set the number of delays and recount the countdown.

For example, in the refined Dutch auction method described in Article 84, Item 85, Item 86 or Item 90 of the patent application, in which the end of the number of extensions cannot be successfully set, the user can refund the bid price to the bidder. .

A system obtained by the refined Dutch auction method described in claim 84, item 85 or item 86 of the patent.

A device obtained by the refined Dutch auction method described in claim 84, item 85 or item 86 of the patent.

A refined Dutch auction method that includes:
(A) The user first sets the starting price of one or more auction targets for bidding by one or more bidders;
(B) setting the bidding price of the auction target so that the auction price is decremented according to a specific rule, which is the bidding behavior of the bidder in the turn-based mode in each decremented amount;
(C) setting the end of the auction must meet one or more conditions;
With such a design, one or more users can flexibly apply the auction method, thereby achieving the purpose of reducing the sales pressure of the auctioneer and meeting the selling price of the user's auction.

The refining Dutch auction method as described in claim 117, wherein the auction end condition of step (C) may be auction time, total number of bids, single bidder or several different bidders simultaneously bidding, specific Time, or one or more of the above-mentioned specific amounts.

For example, the refined Dutch auction method described in claim 117, wherein the user can be the subject who wants to sell the subject, the subject or system to be offered.

A refined Dutch auction method as described in claim 119, wherein the system can be a website system or a telecommunications system.

For example, the refined Dutch auction method described in claim 119, wherein the system can be an APP program or a window application.

For example, the refined Dutch auction method described in claim 121, wherein the window application can be a touch-based subscript.

The refined Dutch auction method as described in claim 117, wherein the method can be manually implemented.

A refined Dutch auction method as described in claim 117, 118, 119 or 120, wherein the auction target may be tangible or intangible or both.

For example, the refined Dutch auction method described in claim 117, 118, 119 or 120 of the patent scope, wherein the bid price may be the market price or the cost price of the auction target.

For example, in the refining Dutch auction method described in claim 117, 118, 119 or 120, wherein the bid price may be a specific discount or random fold of the market price or cost price of the auction target. The number is either a reference to the period of use and the proportion of the nature of the auction target.

For example, the refining Dutch auction method described in claim 117, 118, 119 or 120 of the patent scope, wherein the user of the specific rule can set the price reduction range, the decreasing interval, and the single decrement amount of the auction target Or one or more of the above-mentioned ranges of declining amounts.

For example, in the refining Dutch auction method described in claim 117, 118, 119 or 120, the declining amount may be decremented according to the amount of the bid.

For example, in the refining Dutch auction method described in claim 117, 118, 119 or 120, wherein the user can increase the one or more of the set auction time, the description of the auction target, and the number of subscripts.

For example, the refined Dutch auction method described in claim 117, 118, 119 or 120 of the patent scope, wherein the bid limit may be set to be an additional bid or an additional bid after the bid is started. frequency.

For example, the refined Dutch auction method described in claim 117, 118, 119 or 120 of the patent scope, wherein the bidding method of the turn-based model may be the derating amount of the bidder at the auction price The time to count the time of the round.

For example, the refined Dutch auction method described in claim 117, 118, 119 or 120 of the patent scope, wherein the bidding method of the turn-based model may be a repeater in each round. Or limit the unique bidder or one or more bidders as the winner of the successful bidder.

A system obtained by the refined Dutch auction method described in Sections 117, 119 or 120 of the patent.

A device obtained by the refined Dutch auction method described in claim 117, 119 or 120 of the patent.