Related papers: Multilateral matching with scale economies
Consensus formation is pivotal in multi-agent systems (MAS), balancing collective coherence with individual diversity. Conventional LLM-based MAS primarily rely on explicit coordination, e.g., prompts or voting, risking premature…
This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising…
We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…
This paper explores the emergence of norms in agents' societies when agents play multiple -even incompatible- roles in their social contexts simultaneously, and have limited interaction ranges. Specifically, this article proposes two…
Competition and cooperation are inherent features of any multi-echelon supply chain. The interactions among the agents across the same echelon and that across various echelons influence the percolation of market demand across echelons. The…
A key element to understand complex systems is the relationship between the spatial scale of investigation and the structure of the interrelation among its elements. When it comes to economic systems, it is now well-known that the…
Multiple scales in metapopulations can give rise to paradoxical behaviour: in a conceptual model for a public goods game, the species associated with a fitness cost due to the public good production can be stabilised in the well-mixed limit…
An array system of coupled maps is proposed as a model for economy evolution. The local dynamics of each map or agent is controlled by two parameters. One of them represents the growth capacity of the agent and the other one is a control…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
We consider a general small-scale market for agent-to-agent resource sharing, in which each agent could either be a server (seller) or a client (buyer) in each time period. In every time period, a server has a certain amount of resources…
We revisit the connection between bargaining and equilibrium in exchange economies, and study its algorithmic implications. We consider bargaining outcomes to be allocations that cannot be blocked (i.e., profitably re-traded) by coalitions…
Competing bimodal coalitions among a group of actors are discussed. First, a model from political sciences is revisited. Most of the model statements are found not to be contained in the model. Second, a new coalition model is built. It…
Many scenarios where agents with restrictions compete for resources can be cast as maximum matching problems on bipartite graphs. Our focus is on resource allocation problems where agents may have restrictions that make them incompatible…
The ability of large language models (LLMs) to manage and acquire economic resources remains unclear. In this paper, we introduce \textbf{Market-Bench}, a comprehensive benchmark that evaluates the capabilities of LLMs in…
We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is associated with a subset of vertices --- matches as many of…
Problem solving (e.g., drug design, traffic engineering, software development) by task forces represents a substantial portion of the economy of developed countries. Here we use an agent-based model of cooperative problem solving systems to…
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two…
We investigate the dynamics of a trust game on a mixed population where individuals with the role of buyers are forced to play against a predetermined number of sellers, whom they choose dynamically. Agents with the role of sellers are also…
We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a…
In multiagent systems, agents often have to rely on other agents to reach their goals, for example when they lack a needed resource or do not have the capability to perform a required action. Agents therefore need to cooperate. Then, some…