House allocation with fractional endowments

This paper studies a generalization of the well known house allocation problem in which agents may own fractions of different houses summing to an arbitrary quantity, but have use for only the equivalent of one unit of a house. It departs from the classical model by assuming that arbitrary quantities of each house may be available to the market. Justified envy considerations arise when two agents have the same initial endowment, or when an agent is in some sense disproportionately rewarded in comparison to her peers. For this general model, an algorithm is designed to find a fractional allocation of houses to agents that satisfies ordinal efficiency, individual rationality, and no justified envy. The analysis extends to the full preference domain. Individual rationality, ordinal efficiency, and no justified envy conflict with weak strategyproofness. Moreover, individual rationality, ordinal efficiency and strategyproofness are shown to be incompatible. Finally, two reasonable notions of envy-freeness, no justified envy and equal-endowment no envy, conflict in the presence of ordinal efficiency and individual rationality. All of the impossibility results hold in the strict preference domain.     

Least manipulable Envy-free rules in economies with indivisibilities

We consider envy-free and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In finite economies, we identify under classical preferences each agent’s maximal gain from manipulation. Using this result we find the envy-free and budget-balanced allocation rules which are least manipulable for each preference profile in terms of any agent’s maximal gain. If preferences are quasi-linear, then we can find an envy-free and budget-balanced allocation rule such that for any problem, the maximal utility gain from manipulation is equalized among all agents.     

Natural implementation with semi-responsible agents in pure exchange economies

We study Nash implementation by natural price–quantity mechanisms in pure exchange economies when agents have intrinsic preferences for responsibility. An agent has an intrinsic preference for responsibility if she cares about truth-telling that is in line with the goal of the mechanism designer besides her material well-being. A semi-responsible agent is an agent who, given what her opponents do, acts in an irresponsible manner when a responsible behavior poses obstacles to her material well-being. The class of efficient allocation rules that are Nash implementable is identified provided that there is at least one agent who is semi-responsible. The Walrasian rule is shown to belong to that class.     

Nash equilibria in optimal reinsurance bargaining

We introduce a strategic behavior in reinsurance bilateral transactions, where agents choose the risk preferences they will appear to have in the transaction. Within a wide class of risk measures, we identify agents’ strategic choices to a range of risk aversion coefficients. It is shown that at the strictly beneficial Nash equilibria, agents appear homogeneous with respect to their risk preferences. While the game does not cause any loss of total welfare gain, its allocation between agents is heavily affected by the agents’ strategic behavior. This allocation is reflected in the reinsurance premium, while the insurance indemnity remains the same in all strictly beneficial Nash equilibria. Furthermore, the effect of agents’ bargaining power vanishes through the game procedure and the agent who gets more welfare gain is the one who has an advantage in choosing the common risk aversion at the equilibrium.     

Group activity selection problem with approval preferences

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences in a way that is socially optimal and/or stable. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model where agents’ preferences are binary, i.e., each agent classifies all pairs of the form ‘(activity, group size)’ into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents’ preferences satisfy certain natural constraints.     

Manipulation games in economies with indivisible goods

In this paper we study the strategic aspects of the No-Envy solution for the problem of allocating a finite set of indivisible goods among a group of agents when monetary compensations are possible. In the first part of the paper we consider the case where each agent receives, at most, one indivisible good. We prove that the set of equilibrium allocations of any direct revelation game associated with a subsolution of the No-Envy solution coincides with the set of envy-free allocations for the true preferences. Under manipulation all the subsolutions of the No-Envy solution are equivalent. In the second part of the paper, we allow each agent to receive more than one indivisible good. In this situation the above characterization does not hold any more. We prove that any Equal Income Walrasian allocation for the true preferences can be supported as an equilibrium allocation of any direct revelation game associated with subsolutions of the No-Envy solution, but also non-efficient allocations can be supported.     

Government formation in a two dimensional policy space

Given any allocation of parliament seats among parties, we characterize all the stable government configurations (supported by at least a majority of the parliament) in terms of winning coalitions and policy outcomes. We consider a two dimensional policy space and we assume that there are four parties that care mainly about holding office, and only instrumentally about policy. We find that for any distribution of seats in the parliament only two scenarios are possible: either there is a party that is a member of almost all equilibrium coalitions (dominant party scenario) or there is a party that is never a member of an equilibrium coalition (dominated party scenario). We characterize the key party for each possible scenario and we show that it is sufficient that the key party has intense preferences over one the issues to guarantee the formation of a stable government coalition.     

Stable and Pareto optimal group activity selection from ordinal preferences

In several situations agents need to be assigned to activities on basis of their preferences, and each agent can take part in at most one activity. Often, the preferences of the agents do not depend only on the activity itself but also on the number of participants in the respective activity. In the setting we consider, the agents hence have preferences over pairs “(activity, group size)” including the possibility “do nothing”; in this work, these preferences are assumed to be strict orders. The task will be to find stable assignments of agents to activities, for different concepts of stability such as Nash or core stability, and Pareto optimal assignments respectively. In this respect, particular focus is laid on two natural special cases of agents’ preferences inherent in the considered model, namely increasing and decreasing preferences, where agents want to share an activity with as many (as few, respectively) agents as possible.     

On the contracts between doctors and rural hospitals

We prove that the set of doctors assigned to a hospital with unfilled positions is the same in all stable allocations for a many-to-one matching model with contracts where all hospitals have q-separable preferences. However, the characteristics of the relationships among these agents may differ from one stable allocation to another.     

An alternative characterization of the deferred acceptance algorithm

Kojima and Manea (Econometrica 78(2):633–653, 2010) present two characterizations of when an allocation rule corresponds to the agent-proposing deferred acceptance (DA) algorithm for some substitutable priority rule of the objects being assigned. Building on their results we characterize when an allocation rule is outcome equivalent to the DA algorithm for every substitutable priority rule. In particular, an assignment rule satisfies mutual best (MB) if an agent is always assigned her most preferred object whenever she has the highest priority for it. This mild requirement is a necessary but far from sufficient condition for an assignment rule to be stable. We demonstrate that any allocation mechanism that satisfies MB along with non-wastefulness, population monotonicity and either individually rational monotonicity or weak Maskin monotonicity not only is a stable assignment mechanism but is equivalent to the agent proposing DA algorithm.     

Divide and compromise

We introduce two symmetrized versions of the popular divide-and-choose mechanism for the allocation of a collectively owned indivisible good between two agents when monetary compensation is available. Our proposals retain the simplicity of divide-and-choose and correct its ex-post asymmetry. When there is complete information, i.e., agents know each other well, both mechanisms implement in subgame perfect equilibria a unique allocation that would be obtained by a balanced market. The results hold for general continuous preferences that may not be quasi-linear.     

Formation of segregated and integrated groups

A model of group formation is presented such that the number of groups is fixed, and a person can only join a group if the group’s members approve the person’s joining. Agents have either local status preferences (each agent wants to be the highest status agent in his group) or global status preferences (each agent wants to join the highest status group that she can join). For both preference types, conditions are provided which guarantee the existence of a segregated stable partition such that similar people are grouped together, and conditions are provided which guarantee the existence of an integrated stable partition such that dissimilar people are grouped together. Additionally, in a dynamic framework we show that if a new empty group is added to a segregated stable partition, then integration may occur.     

Two-sided coalitional matchings

In a two-sided coalitional matching problem agents on each side of the market simultaneously form coalitions which then are matched to coalitions from the other market side. We assume that each agent has preferences over groups on his own market side and over groups on the opposite market side. These preferences are combined lexicographically as to examine how the existence of core stable partitions on the distinct market sides, the restriction of agents’ preferences over groups to strict orderings, and the extent to which individual preferences respect common rankings shape the existence of core stable coalitional matchings.     

Some General Results on Equilibrium Prices in Large Random Exchange Economies

In this paper we are concerned with a model of a Walrasian exchange economy in which the preferences and endowments of the agents are random. Stochastic interaction among the agents is formally described in terms of dependency neighborhoods. The main result concerns a characterization of the distribution of market-clearing equilibrium prices in a large economy. The paper establishes conditions for asymptotic normality of appropriately normalized equilibrium prices.     

Bargaining in endogenous trading networks

We study a model in which heterogeneous agents first form a trading network where linking costs are positive but infinitesimally small. Then, a seller and a buyer are randomly selected among the agents to bargain through a chain of intermediaries. We determine both the trading path and the allocation of the surplus among the seller, the buyer and the intermediaries at equilibrium. We show that, under the initiator bargaining protocol, a trading network is pairwise stable if it is a core–periphery network where the core consists of all impatient agents who are linked to each other and the periphery consists of all patient agents who have a single link towards an impatient agent. Once agents do not know the impatience of other agents, each bilateral bargaining session may involve delay. Then, core–periphery networks may not be pairwise stable because agents may prefer to add links for reducing the length of trading paths and so avoiding costly delays in reaching a global agreement.     

Matching patient and physician preferences in designing a primary care facility network

This paper introduces an integer programming model for planning primary care facility networks, which accounts for the interests of different stakeholders while maximizing access to health care. Physician allocation to health-care facilities is explicitly modelled, which allows consideration of physician incentives in the planning phase. An illustrative case study in the Turkish primary care system is presented to show the implications of focusing on patient or physician preferences in the planning phase. A discussion of trade-offs between the different stakeholder preferences and some recommendations for modelling choices to match these preferences are provided. In the context of this case, we found that using an access measure that decays with distance, and incorporating nearest allocation constraints improves performance for all stakeholders. We also show that increasing the number of physicians may have adverse affects on access measures when physician preferences are addressed.     

The cultural Red King effect

Why do minority groups tend to be discriminated against when it comes to situations of bargaining and resource division? In this article, I explore an explanation for this disadvantage that appeals solely to the dynamics of social interaction between minority and majority groups—the cultural Red King effect (Bruner, 2017). As I show, in agent-based models of bargaining between groups, the minority group will tend to get less as a direct result of the fact that they frequently interact with majority group members, while majority group members meet them only rarely. This effect is strengthened by certain psychological phenomenon—risk aversion and in-group preference—is robust on network models, and is strengthened in cases where preexisting norms are discriminatory. I will also discuss how this effect unifies previous results on the impacts of institutional memory on bargaining between groups.     

Planning Urban Recreational Facilities with Integer Goal Programming

Urban planners are often involved in the determination of where recreational facilities (i.e. pools, gymnasia, tennis courts, etc.) should be located within the city. This problem is complicated by the planners' desire to realize certain goals in the allocation process. They desire to build only facilities for which there are sufficient construction funds and which can be operated within a predetermined budget. In addition they desire to satisfy the demands of the residents of the city for different facilities. However, these demands are often conflicting since many urban areas are somewhat segregated with the inner city being predominantly minority/lower income and the outer city consisting of white/upper income groups. These different groups enjoy different types of recreation, and, thus, demand different facilities. Since this is basically an allocation problem with multiple conflicting objectives, goal programming surfaces as an appropriate solution technique. This paper describes an integer (0-1) goal programming model for the recreational allocation problem and demonstrates its use via a case example. The model results specify the facilities which should be constructed that best meet the conflicting goals.     

Experimentation and Learning in Repeated Cooperation

We study an agency model, in which the principal has only incomplete information about the agent's preferences, in a dynamic setting. Through repeated interaction with the agent, the principal learns about the agent's preferences and can thus adjust the inventive system. In a dynamic computational model, we compare different learning strategies of the principal when facing different types of agents. The results indicate that better learning of preferences can improve the situation of both parties, but the learning process is rather sensitive to random disturbances.