Incentive Systems in Multi-Level Markets for Virtual Goods
Andreas U. Schmidt
备注：
18 pages, 5 figures; graphics with reduced resolution. Full resolution available on author's homepage. Accepted contribution to the Workshop 'Virtual Goods' at the Conference AXMEDIS 2005, 30. November - 2. December, Florence, Italy
As an alternative to rigid DRM measures, ways of marketing virtual goods through multi-level or networked marketing have raised some interest. This report is a first approach to multi-level markets for virtual goods from the viewpoint of theoretical economy. A generic, kinematic model for the monetary flow in multi-level markets, which quantitatively describes the incentives that buyers receive through resales revenues, is devised. Building on it, the competition of goods is examined in a dynamical, utility-theoretic model enabling, in particular, a treatment of the free-rider problem. The most important implications for the design of multi-level market mechanisms for virtual goods, or multi-level incentive management systems, are outlined.
We propose an incentive mechanism for the sponsored content provider market in which the communication of users can be represented by a graph and the private information of the users is assumed to have a continuous distribution function. The content provider stipulates incentive rewards to encourage users to reveal their private information truthfully and increase their content demand, which leads to an increase in advertising revenue. We prove that all users gain a non-negative utility and disclose their private information truthfully. Moreover, we study the effectiveness and scalability of t…
We present a market-based approach to the Air Traffic Flow Management (ATFM) problem. The goods in our market are delays and buyers are airline companies; the latter pay money to the FAA to buy away the desired amount of delay on a per flight basis. We give a notion of equilibrium for this market and an LP whose solution gives an equilibrium allocation of flights to landing slots as well as equilibrium prices for the landing slots. Via a reduction to matching, we show that this equilibrium can be computed combinatorially in strongly polynomial time. Moreover, there is a special set of equilibr…
The Metaverse is regarded as the next-generation Internet paradigm that allows humans to play, work, and socialize in an alternative virtual world with immersive experience, for instance, via head-mounted display for Virtual Reality (VR) rendering. With the help of ubiquitous wireless connections and powerful edge computing technologies, VR users in wireless edge-empowered Metaverse can immerse in the virtual through the access of VR services offered by different providers. However, VR applications are computation- and communication-intensive. The VR service providers (SPs) have to optimize th…
Market-based conservation instruments, such as payments, auctions or tradable permits, are environmental policies that create financial incentives for landowners to engage in voluntary conservation on their land. But what if ecological processes operate across property boundaries and land use decisions on one property influence ecosystem functions on neighboring sites? This paper examines how to account for such spatial externalities when designing market-based conservation instruments. We use an agent-based model to analyze different spatial metrics and their implications on land use decision…
This paper presents an analysis of competition between generators when incentive-based demand response is employed in an electricity market. Thermal and hydropower generation are considered in the model. A smooth inverse demand function is designed using a sigmoid and two linear functions for modeling the consumer preferences under incentive-based demand response program. Generators compete to sell energy bilaterally to consumers and system operator provides transmission and arbitrage services. The profit of each agent is posed as an optimization problem, then the competition result is found b…
Recently, a novel class of incentive mechanisms is proposed to attract extensive users to truthfully participate in crowd sensing applications with a given budget constraint. The class mechanisms also bring good service quality for the requesters in crowd sensing applications. Although it is so important, there still exists many verification and privacy challenges, including users' bids and subtask information privacy and identification privacy, winners' set privacy of the platform, and the security of the payment outcomes. In this paper, we present a privacy-preserving verifiable incentive me…
In the context of rapid discoveries by leaders in AI, governments must consider how to design regulation that matches the increasing pace of new AI capabilities. Regulatory Markets for AI is a proposal designed with adaptability in mind. It involves governments setting outcome-based targets for AI companies to achieve, which they can show by purchasing services from a market of private regulators. We use an evolutionary game theory model to explore the role governments can play in building a Regulatory Market for AI systems that deters reckless behaviour. We warn that it is alarmingly easy to …
In crowdsourcing markets, there are two different type jobs, i.e. homogeneous jobs and heterogeneous jobs, which need to be allocated to workers. Incentive mechanisms are essential to attract extensive user participating for achieving good service quality, especially under a given budget constraint condition. To this end, recently, Singer et al. propose a novel class of auction mechanisms for determining near-optimal prices of tasks for crowdsourcing markets constrained by the given budget. Their mechanisms are very useful to motivate extensive user to truthfully participate in crowdsourcing m…
In \cite{EK10} the use of VCG in matching markets is motivated by saying that in order to compute market clearing prices in a matching market, the auctioneer needs to know the true valuations of the bidders. Hence VCG and corresponding personalized prices are proposed as an incentive compatible mechanism. The same line of argument pops up in several lecture sheets and other documents related to courses based on Easley and Kleinberg's book, seeming to suggest that computing market clearing prices and corresponding assignments were \emph{not} incentive compatible. Main purpose of our note is to …
The incentive ratio measures the utility gains from strategic behaviour. Without any restrictions on the setup, ratios for linear, Leontief and Cobb-Douglas exchange markets are unbounded, showing that manipulating the equilibrium is a worthwhile endeavour, even if it is computationally challenging. Such unbounded improvements can be achieved even if agents only misreport their utility functions. This provides a sharp contrast with previous results from Fisher markets. When the Cobb-Douglas setup is more restrictive, the maximum utility gain is bounded by the number of commodities. By means of…
Matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market. Here, as in other markets of that kind, market equilibria correspond to feasible, envy free, and bidder optimal outcomes. For settings without budgets such an outcome always exists and can be computed in polynomial-time by the so-called Hungarian Method. Moreover, every mechanism that computes such an outcome is incentive compatible. We show that the Hungarian Method can be modified so that it finds a feasible, envy free, and bidder optimal outcome for settings with budge…
With the proliferation of the digital data economy, digital data is considered as the crude oil in the twenty-first century, and its value is increasing. Keeping pace with this trend, the model of data market trading between data providers and data consumers, is starting to emerge as a process to obtain high-quality personal information in exchange for some compensation. However, the risk of privacy violations caused by personal data analysis hinders data providers' participation in the data market. Differential privacy, a de-facto standard for privacy protection, can solve this problem, but, …
Mobile Crowdsensing has shown a great potential to address large-scale problems by allocating sensing tasks to pervasive Mobile Users (MUs). The MUs will participate in a Crowdsensing platform if they can receive satisfactory reward. In this paper, in order to effectively and efficiently recruit sufficient MUs, i.e., participants, we investigate an optimal reward mechanism of the monopoly Crowdsensing Service Provider (CSP). We model the rewarding and participating as a two-stage game, and analyze the MUs' participation level and the CSP's optimal reward mechanism using backward induction. At …
Privacy is an essential issue in data trading markets. This work uses a mechanism design approach to study the optimal market model to economize the value of privacy of personal data, using differential privacy. The buyer uses a finite number of randomized algorithms to get access to the owners' data in a sequential-composition manner, in which each randomized algorithm is differentially private. Each usage of a randomized algorithm is referred to as a period. Due to the composability of differential privacy, there are inevitable privacy losses accumulated over periods. Hence, we allow the own…
Our aim is to design mechanisms that motivate all agents to reveal their predictions truthfully and promptly. For myopic agents, proper scoring rules induce truthfulness. However, as has been described in the literature, when agents take into account long-term effects of their actions, deception and reticence may appear. No simple rules exist to distinguish between the truthful and the untruthful situations, and a determination has been done in isolated cases only. This is of relevance to prediction markets, where the market value is a common prediction, and more generally in informal public p…
Federated Learning Incentive Mechanism under Buyers' Auction Market
University of Electronic Science and Technology of China（电子科技大学）；Beihang University（北京航空航天大学）；National Taiwan University（台湾大学）；Jiangxi University of Finance and Economics（江西财经大学）
An operator-assisted user-provided network (UPN) has the potential to achieve a low cost ubiquitous Internet connectivity, without significantly increasing the network infrastructure investment. In this paper, we consider such a network where the network operator encourages some of her subscribers to operate as mobile Wi-Fi hotspots (hosts), providing Internet connectivity for other subscribers (clients). We formulate the interaction between the operator and mobile users as a two-stage game. In Stage I, the operator determines the usage-based pricing and quota-based incentive mechanism for the…
We present a mechanism design, coupling an online collaboration software and a prediction market, which allows tracking down the very roots of individual incentives, actions and how these behaviors influence collective intelligence in terms of knowledge production as a public good. We show that the incentive mechanism efficiently engages users without further governance structure, and doesn't crowd out intrinsic motivation. Furthermore, it enables a powerful and robust creative destruction process, which helps quickly filter out irrelevant knowledge. While still at an early stage, this mechani…
Prediction markets are designed to elicit information from multiple agents in order to predict (obtain probabilities for) future events. A good prediction market incentivizes agents to reveal their information truthfully; such incentive compatibility considerations are commonly studied in mechanism design. While this relation between prediction markets and mechanism design is well understood at a high level, the models used in prediction markets tend to be somewhat different from those used in mechanism design. This paper considers a model for prediction markets that fits more straightforwardl…
Two-sided matching markets have long existed to pair agents in the absence of regulated exchanges. A common example is school choice, where a matching mechanism uses student and school preferences to assign students to schools. In such settings, forming preferences is both difficult and critical. Prior work has suggested various prediction mechanisms that help agents make decisions about their preferences. Although often deployed together, these matching and prediction mechanisms are almost always analyzed separately. The present work shows that at the intersection of the two lies a previously…
The high penetration of Renewable Energy Sources in modern smart grids necessitated the development of Demand Response (DR) mechanisms as well as corresponding innovative services for the emerging flexibility markets. From a game theoretic perspective, the basic key performance indicators (KPIs) for such DR mechanisms are efficiency in terms of social welfare, practical applicability, and incentive guarantees, in the sense of making it a dominant strategy for each user to act truthfully according to his/her preferences, leaving no room for cheating. In this paper, we propose a DR architecture,…
"Big data" gives markets access to previously unmeasured characteristics of individual agents. Policymakers must decide whether and how to regulate the use of this data. We study how new data affects incentives for agents to exert effort in settings such as the labor market, where an agent's quality is initially unknown but is forecast from an observable outcome. We show that measurement of a new covariate has a systematic effect on the average effort exerted by agents, with the direction of the effect determined by whether the covariate is informative about long-run quality or about a shock t…
In this paper we formulate a contract design problem where a primary license holder wishes to profit from its excess spectrum capacity by selling it to potential secondary users/buyers. It needs to determine how to optimally price the excess spectrum so as to maximize its profit, knowing that this excess capacity is stochastic in nature, does not come with exclusive access, and cannot provide deterministic service guarantees to a buyer. At the same time, buyers are of different {\em types}, characterized by different communication needs, tolerance for the channel uncertainty, and so on, all of…
Federated Learning for Data Market: Shapley-UCB for Seller Selection and Incentives
School of Intelligent Systems Engineering, Sun Yat-Sen University（中山大学智能系统工程学院）；Department of Computing, The Hong Kong Polytechnic University（香港理工大学计算机系）
We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand curves which depends on a non-parametric market-noise distribution, and buyers may potentially submit corrupted bids (relative to true valuations) to manipulate the seller's pricing policy for more favorable reserve prices in the future. We focus on designing the seller's learning policy to set contextual reserve prices where the seller's goal is to minimize re…
Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A crucial assumption in all these studies is that the influence probabilities are known to the social planner. This assumption is unrealistic since the influence probabilities are usually private information of the individual agents and strategic agents may not reveal them truthfully. Moreover, the influence probabilities could vary significantly with the type …
We consider the situation where multiple transportation service providers cooperate to offer an integrated multi-modal platform to enhance the convenience to the passengers through ease in multi-modal journey planning, payment, and first and last mile connectivity. This market structure allows the multi-modal platform to coordinate profits across modes and also provide incentives to the passengers. Accordingly, in this paper, we use cooperative game theory coupled with the hyperpath-based stochastic user equilibrium framework to study such a market. We assume that the platform sets incentives …
We investigate a type of emerging user-assisted mobile applications or services, referred to as Dynamic Mobile Ad-hoc Crowd Service (DMACS), such as collaborative streaming via smartphones or location privacy protection through a crowd of smartphone users. Such services are provided and consumed by users carrying smart mobile devices (e.g., smartphones) who are in close proximity of each other (e.g., within Bluetooth range). Users in a DMACS system dynamically arrive and depart over time, and are divided into multiple possibly overlapping groups according to radio range constraints. Crucial to…
Mature internet advertising platforms offer high-level campaign management tools to help advertisers run their campaigns, often abstracting away the intricacies of how each ad is placed and focusing on aggregate metrics of interest to advertisers. On such platforms, advertisers often participate in auctions through a proxy bidder, so the standard incentive analyses that are common in the literature do not apply directly. In this paper, we take the perspective of a budget management system that surfaces aggregated incentives -- instead of individual auctions -- and compare first and second pric…
Sloan School of Management, Massachusetts Institute of Technology（麻省理工学院斯隆管理学院）；University of Southern California（南加州大学）；Google Research（谷歌研究院）
Motivated by pricing in ad exchange markets, we consider the problem of robust learning of reserve prices against strategic buyers in repeated contextual second-price auctions. Buyers' valuations for an item depend on the context that describes the item. However, the seller is not aware of the relationship between the context and buyers' valuations, i.e., buyers' preferences. The seller's goal is to design a learning policy to set reserve prices via observing the past sales data, and her objective is to minimize her regret for revenue, where the regret is computed against a clairvoyant policy …
We propose and analyze differentially private (DP) mechanisms for call auctions as an alternative to the complex and ad-hoc privacy efforts that are common in modern electronic markets. We prove that the number of shares cleared in the DP mechanisms compares favorably to the non-private optimal and provide a matching lower bound. We analyze the incentive properties of our mechanisms and their behavior under natural no-regret learning dynamics by market participants. We include simulation results and connections to the finance literature on market impact.
We consider the problem of optimal bidding for virtual trading in two-settlement electricity markets. A virtual trader aims to arbitrage on the differences between day-ahead and real-time market prices; both prices, however, are random and unknown to market participants. An online learning algorithm is proposed to maximize the cumulative payoff over a finite number of trading sessions by allocating the trader's budget among his bids for K options in each session. It is shown that the proposed algorithm converges, with an almost optimal convergence rate, to the global optimal corresponding to t…
