اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGini Index based Initial Coin Offering Mechanism
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As a fundraising method, Initial Coin Offering (ICO) has raised billions of dollars for thousands of startups in the past two years. Existing ICO mechanisms place more emphasis on the short-term benefits of maximal fundraising while ignoring the problem of unbalanced token allocation, which negatively impacts subsequent fundraising and has bad effects on introducing new investors and resources. We propose a new ICO mechanism which uses the concept of Gini index for the very first time as a mechanism design constraint to control allocation inequality. Our mechanism maintains an elegant and straightforward structure. It allows the agents to modify their bids as a price discovery process, while limiting the bids of whales. We analyze the agents equilibrium behaviors under our mechanism. Under natural technical assumptions, we show that most agents have simple dominant strategies and the equilibrium revenue approaches the optimal revenue asymptotically in the number of agents. We verify our mechanism using real ICO dataset we collected, and confirm that our mechanism performs well in terms of both allocation fairness and revenue.
قيم البحث
اقرأ أيضاً
We propose an extended version of Gini index defined on the set of infinite utility streams, $X=Y^mathbb{N}$ where $Ysubset mathbb{R}$. For $Y$ containing at most finitely many elements, the index satisfies the generalized Pigou-Dalton transfer principles in addition to the anonymity axiom.
The complex networks approach has been gaining popularity in analysing investor behaviour and stock markets, but within this approach, initial public offerings (IPO) have barely been explored. We fill this gap in the literature by analysing investor
clusters in the first two years after the IPO filing in the Helsinki Stock Exchange by using a statistically validated network method to infer investor links based on the co-occurrences of investors trade timing for 69 IPO stocks. Our findings show that a rather large part of statistically similar network structures form in different securities and persist in time for mature and IPO companies. We also find evidence of institutional herding.
Federated learning (FL) has shown great potential for addressing the challenge of isolated data islands while preserving data privacy. It allows artificial intelligence (AI) models to be trained on locally stored data in a distributed manner. In orde
r to build an ecosystem for FL to operate in a sustainable manner, it has to be economically attractive to data owners. This gives rise to the problem of FL incentive mechanism design, which aims to find the optimal organizational and payment structure for the federation in order to achieve a series of economic objectives. In this paper, we present a VCG-based FL incentive mechanism, named FVCG, specifically designed for incentivizing data owners to contribute all their data and truthfully report their costs in FL settings. It maximizes the social surplus and minimizes unfairness of the federation. We provide an implementation of FVCG with neural networks and theoretic proofs on its performance bounds. Extensive numerical experiment results demonstrated the effectiveness and economic reasonableness of FVCG.
We develop and extend a line of recent works on the design of mechanisms for heterogeneous tasks assignment problem in crowdsourcing. The budgeted market we consider consists of multiple task requesters and multiple IoT devices as task executers; whe
re each task requester is endowed with a single distinct task along with the publicly known budget. Also, each IoT device has valuations as the cost for executing the tasks and quality, which are private. Given such scenario, the objective is to select a subset of IoT devices for each task, such that the total payment made is within the allotted quota of the budget while attaining a threshold quality. For the purpose of determining the unknown quality of the IoT devices, we have utilized the concept of peer grading. In this paper, we have carefully crafted a truthful budget feasible mechanism; namely TUBE-TAP for the problem under investigation that also allows us to have the true information about the quality of the IoT devices. The simulations are performed in order to measure the efficacy of our proposed mechanism.
Mining in the blockchain requires high computing power to solve the hash puzzle for example proof-of-work puzzle. It takes high cost to achieve the calculation of this problem in devices of IOT, especially the mobile devices of IOT. It consequently r
estricts the application of blockchain in mobile environment. However, edge computing can be utilized to solve the problem for insufficient computing power of mobile devices in IOT. Edge servers can recruit many mobile devices to contribute computing power together to mining and share the reward of mining with these recruited mobile devices. In this paper, we propose an incentivizing mechanism based on edge computing for mobile blockchain. We design a two-stage Stackelberg Game to jointly optimize the reward of edge servers and recruited mobile devices. The edge server as the leader sets the expected fee for the recruited mobile devices in Stage I. The mobile device as a follower provides its computing power to mine according to the expected fee in Stage. It proves that this game can obtain a uniqueness Nash Equilibrium solution under the same or different expected fee. In the simulation experiment, we obtain a result curve of the profit for the edge server with the different ratio between the computing power from the edge server and mobile devices. In addition, the proposed scheme has been compared with the MDG scheme for the profit of the edge server. The experimental results show that the profit of the proposed scheme is more than that of the MDG scheme under the same total computing power.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
