搜索结果：Goods

We study a simple problem of allocating common-value goods. The designer seeks to allocate the goods to as many unit-demand agents as possible without monetary transfers, while agents, who possess partial private information about the goods, are willing to receive them only when the goods are of high value. Mechanisms screen each agent's private information using the information of other agents, and in doing so shape what agents learn from other agents about the value of the goods. The optimal mechanism can be summarized by two parameters: one adjusts the allocation probability, while the other governs the amount of learning induced by allocation. Although the designer prefers to allocate the goods, the optimal mechanism excludes some agents and, as a result, may withhold allocation even when all agents would be willing to receive them. The optimal mechanism has the same structure even when payments are available, but it may not exclude any agent and may involve strictly positive payments that are decreasing in allocation.

Peer produced goods such as online knowledge bases and free/libre open source software rely on contributors who often choose their tasks regardless of consumer needs. These goods are susceptible to underproduction: when popular goods are relatively low quality. Although underproduction is a common feature of peer production, very little is known about how to counteract it. We use a detailed longitudinal dataset from English Wikipedia to show that more experienced contributors -- including those who contribute without an account -- tend to contribute to underproduced goods. A within-person analysis shows that contributors' efforts shift toward underproduced goods over time. These findings illustrate the value of retaining contributors in peer production, including those contributing without accounts, as a means to counter underproduction.

We study the fair allocation of indivisible goods with variable groups. In this model, the goal is to partition the agents into groups of given sizes and allocate the goods to the groups in a fair manner. We show that for any number of groups and corresponding sizes, there always exists an envy-free up to one good (EF1) outcome, thereby generalizing an important result from the individual setting. Our result holds for arbitrary monotonic utilities and comes with an efficient algorithm. We also prove that an EF1 outcome is guaranteed to exist even when the goods lie on a path and each group must receive a connected bundle. In addition, we consider a probabilistic model where the utilities are additive and drawn randomly from a distribution. We show that if there are $n$ agents, the number of goods $m$ is divisible by the number of groups $k$, and all groups have the same size, then an envy-free outcome exists with high probability if $m = ω(\log n)$, and this bound is tight. On the other hand, if $m$ is not divisible by $k$, then an envy-free outcome is unlikely to exist as long as $m = o(\sqrt{n})$.

We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each provided good must justify its cost by being utilized by sufficiently many agents, leading to strong complementarities in the "preferences" of goods. Furthermore, goods that are in high demand given other already-provided goods must also be provided. The question of the existence of a stable solution (a menu of public goods to be provided) exhibits a rich combinatorial structure. We uncover sufficient conditions and necessary conditions for guaranteeing the existence of a stable solution, and derive both positive and negative results for strategyproof stable matching.

When individuals interact in groups, the evolution of cooperation is traditionally modeled using the framework of public goods games. These models often assume that the return of the public good depends linearly on the fraction of contributors. In contrast, in real life public goods interactions, the return can depend on the size of the investor pool as well. Here, we consider a model in which the multiplication factor (marginal per capita return) for the public good depends linearly on how many contribute, which results in a nonlinear model of public goods. This simple model breaks the curse of dominant defection found in linear public goods interactions and gives rise to richer dynamical outcomes in evolutionary settings. We provide an in-depth analysis of the more varied decisions by the classical rational player in nonlinear public goods interactions as well as a mechanistic, microscopic derivation of the evolutionary outcomes for the stochastic dynamics in finite populations and in the deterministic limit of infinite populations. This kind of nonlinearity provides a natural way to model public goods with diminishing returns as well as economies of scale.

We consider the problem of fairly allocating a combination of divisible and indivisible goods. While fairness criteria like envy-freeness (EF) and proportionality (PROP) can always be achieved for divisible goods, only their relaxed versions, such as the ''up to one'' relaxations EF1 and PROP1, can be satisfied when the goods are indivisible. The ''up to one'' relaxations require the fairness conditions to be satisfied provided that one good can be completely eliminated or added in the comparison. In this work, we bridge the gap between the two extremes and propose ''up to a fraction'' relaxations for the allocation of mixed divisible and indivisible goods. The fraction is determined based on the proportion of indivisible goods, which we call the indivisibility ratio. The new concepts also introduce asymmetric conditions that are customized for individuals with varying indivisibility ratios. We provide both upper and lower bounds on the fractions of the modified item in order to satisfy the fairness criterion. Our results are tight up to a constant for EF and asymptotically tight for PROP.

We formulate the problem of fair and efficient completion of indivisible goods, defined as follows: Given a partial allocation of indivisible goods among agents, does there exist an allocation of the remaining goods (i.e., a completion) that satisfies fairness and economic efficiency guarantees of interest? We study the computational complexity of the completion problem for prominent fairness and efficiency notions such as envy-freeness up one good (EF1), proportionality up to one good (Prop1), maximin share (MMS), and Pareto optimality (PO), and focus on the class of additive valuations as well as its subclasses such as binary additive and lexicographic valuations. We find that while the completion problem is significantly harder than the standard fair division problem (wherein the initial partial allocation is empty), the consideration of restricted preferences facilitates positive algorithmic results for threshold-based fairness notions (Prop1 and MMS). On the other hand, the completion problem remains computationally intractable for envy-based notions such as EF1 and EF1+PO even under restricted preferences.

This paper develops a theory of competitive equilibrium with indivisible goods based entirely on economic conditions on demand. The key idea is to analyze complementarity and substitutability between bundles of goods, rather than merely between goods themselves. This approach allows us to formulate sufficient, and essentially necessary, conditions for equilibrium existence, which unify settings with complements and settings with substitutes. Our analysis has implications for auction design.

The problem of arriving at a principled method of pricing goods and services was very satisfactorily solved for conventional goods; however, this solution is not applicable to digital goods. This paper studies pricing of a special class of digital goods, which we call {\em semantically substitutable digital goods}. After taking into consideration idiosyncrasies of goods in this class, we define a market model for it, together with a notion of equilibrium. We prove existence of equilibrium prices for our market model using Kakutani's fixed point theorem. The far reaching significance of a competitive equilibrium is made explicit in the Fundamental Theorems of Welfare Economics. There are basic reasons due to which these theorems are not applicable to digital goods. This naturally leads to the question of whether the allocations of conventional goods are rendered inefficient or "socially unfair" in the mixed economy we have proposed. We prove that that is not the case and that in this sense, the intended goal of Welfare Economics is still achieved in the mixed economy.

We study fair allocation of indivisible public goods subject to cardinality (budget) constraints. In this model, we have n agents and m available public goods, and we want to select $k \leq m$ goods in a fair and efficient manner. We first establish fundamental connections between the models of private goods, public goods, and public decision making by presenting polynomial-time reductions for the popular solution concepts of maximum Nash welfare (MNW) and leximin. These mechanisms are known to provide remarkable fairness and efficiency guarantees in private goods and public decision making settings. We show that they retain these desirable properties even in the public goods case. We prove that MNW allocations provide fairness guarantees of Proportionality up to one good (Prop1), $1/n$ approximation to Round Robin Share (RRS), and the efficiency guarantee of Pareto Optimality (PO). Further, we show that the problems of finding MNW or leximin-optimal allocations are NP-hard, even in the case of constantly many agents, or binary valuations. This is in sharp contrast to the private goods setting that admits polynomial-time algorithms under binary valuations. We also design pseudo-pol

Public organizations need innovative approaches for managing common goods and to explain the dynamics linking the (re)generation of common goods and organizational performance. Although system dynamics is recognised as a useful approach for managing common goods, public organizations rarely adopt the system dynamics for this goal. The paper aims to review the literature on the system dynamics and its recent application, known as dynamic performance management, to highlight the state of the art and future opportunities on the management of common goods. The authors analyzed 144 documents using a systematic literature review. The results obtained outline a fair number of documents, countries and journals involving the study of system dynamics, but do not cover sufficient research on the linking between the (re)generation of common goods and organizational performance. This paper outlines academic and practical contributions. Firstly, it contributes to the theory of common goods. It provides insight for linking the management of common goods and organizational performance through the use of dynamic performance management approach. Furthermore, it shows scholars the main research oppor

We introduce a system of kinetic equations describing an exchange market consisting of two populations of agents (dealers and speculators) expressing the same preferences for two goods, but applying different strategies in their exchanges. We describe the trading of the goods by means of some fundamental rules in price theory, in particular by using Cobb-Douglas utility functions for the exchange. The strategy of the speculators is to recover maximal utility from the trade by suitably acting on the percentage of goods which are exchanged. This microscopic description leads to a system of linear Boltzmann-type equations for the probability distributions of the goods on the two populations, in which the post-interaction variables depend from the pre-interaction ones in terms of the mean quantities of the goods present in the market. In this case, it is shown analytically that the strategy of the speculators can drive the price of the two goods towards a zone in which there is a marked utility for their group. Also, the general system of nonlinear kinetic equations of Boltzmann type for the probability distributions of the goods on the two populations is described in details. Numerica

Goods trade is a supply chain transaction that involves shippers buying goods from suppliers and carriers providing goods transportation. Shippers are issued invoices from suppliers and carriers. Shippers carry out goods receiving and invoice processing before payment processing of bills for suppliers and carriers, where invoice processing includes tasks like processing claims and adjusting the bill payments. Goods receiving involves verification of received goods by the Shipper's receiving team. Invoice processing is carried out by the Shipper's accounts payable team, which in turn is verified by the accounts receivable teams of suppliers and carriers. This paper presents a blockchain-based accounts payable system that generates claims for the deficiency in the goods received and accordingly adjusts the payment in the bills for suppliers and carriers. Primary motivations for these supply chain organizations to adopt blockchain-based accounts payable systems are to eliminate the process redundancies (accounts payable vs. accounts receivable), to reduce the number of disputes among the transacting participants, and to accelerate the accounts payable processes via optimizations in th

We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting. We prove that an EFM allocation always exists for any number of agents. We also propose efficient algorithms to compute an EFM allocation for two agents and for $n$ agents with piecewise linear valuations over the divisible goods. Finally, we relax the envy-free requirement, instead asking for $ε$-envy-freeness for mixed goods ($ε$-EFM), and present an algorithm that finds an $ε$-EFM allocation in time polynomial in the number of agents, the number of indivisible goods, and $1/ε$.

The problem of fair division of indivisible goods has been receiving much attention recently. The prominent metric of envy-freeness can always be satisfied in the divisible goods setting (see for example \cite{BT95}), but often cannot be satisfied in the indivisible goods setting. This has led to many relaxations thereof being introduced. We study the existence of {\em maximin share (MMS)} allocations, which is one such relaxation. Previous work has shown that MMS allocations are guaranteed to exist for all instances with $n$ players and $m$ goods if $m \leq n+4$. We extend this guarantee to the case of $m = n+5$ and show that the same guarantee fails for $m = n+6$.

The debate surrounding the provision of welfare by state institutions has been widely discussed in the field of political economics since the 1930s. Related research also focuses on welfare supply at an international system level. This article assesses whether international cooperation in the area of sharing remote sensing data leads to the supply of global public goods, which to date has not yet been discussed in related scholarly literature. The supply of global public goods is assessed within the GEO international regime and leads to the use of the non-rivalrous GEOSS, which can be accessed by every socio-economic group in every UN member country including future generations. However, providing the benefit of GEOSS is not always favourable because of the low number of financially participating consumers.

We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (MMS). With only indivisible goods, a full MMS allocation may not exist, but a constant multiplicative approximate allocation always does. We analyze how the MMS approximation guarantee would be affected when the resources to be allocated also contain divisible goods. In particular, we show that the worst-case MMS approximation guarantee with mixed goods is no worse than that with only indivisible goods. However, there exist problem instances to which adding some divisible resources would strictly decrease the MMS approximation ratio of the instance. On the algorithmic front, we propose a constructive algorithm that will always produce an $α$-MMS allocation for any number of agents, where $α$ takes values between $1/2$ and $1$ and is a monotone increasing function determined by how agents value the divisible goods relative to their MMS values.

In this study, we propose the polyhedral clinching auction for indivisible goods, which has so far been studied for divisible goods. As in the divisible setting by Goel et al. (2015), our mechanism enjoys incentive compatibility, individual rationality, and Pareto optimality, and works with polymatroidal environments. A notable feature for the indivisible setting is that the whole procedure can be conducted in time polynomial of the number of buyers and goods. Moreover, we show additional efficiency guarantees, recently established by Sato for the divisible setting: The liquid welfare (LW) of our mechanism achieves more than 1/2 of the optimal LW, and that the social welfare is more than the optimal LW.

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.