Related papers: Fair Data-Exchange Mechanisms
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the agents. The task is to partition the graph into $k$…
We construct an empirically founded model of a repo trade intermediated by two broker-dealers and prove multiple equilibrium and the existence of equilibrium at the joint profit maximizing volume of trade. We then present a smart contract…
We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic…
We design and analyze attention games that incentivize validators to check computation results. We show that no pure strategy Nash equilibrium of the game without outside parties exists by a simple argument. We then proceed to calculate the…
In modern transportation networks, adversaries can manipulate routing algorithms using false data injection attacks, such as simulating heavy traffic with multiple devices running crowdsourced navigation applications, to mislead vehicles…
Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of…
Within a common arbitrage-free semimartingale financial market we consider the problem of determining all Nash equilibrium investment strategies for $n$ agents who try to maximize the expected utility of their relative wealth. The utility…
We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking where a network of players, abstracted as a directed graph, aim to minimize their own local cost functions non-cooperatively. Considering the…
A set of divisible resources becomes available over a sequence of rounds and needs to be allocated immediately and irrevocably. Our goal is to distribute these resources to maximize fairness and efficiency. Achieving any non-trivial…
With recent development of artificial intelligence, it is more common to adopt AI agents in economic activities. This paper explores the economic actions of agents, including human agents and AI agents, in an economic game of trading…
We study balanced exchange problems in which agents with responsive preferences are endowed with multiple indivisible objects and can trade without transfers (e.g. shift exchange, time-banking). Eliciting full preferences over bundles is…
This paper characterises optimal incentive schemes for ESG disclosure in a continuous-time principal-agent setting. We model a risk-averse principal (e.g., a platform or standard-setter) contracting with a team of heterogeneous agents whose…
The hidden-action model captures a fundamental problem of principal-agent theory and provides an optimal sharing rule when only the outcome but not the effort can be observed. However, the hidden-action model builds on various explicit and…
The continuous penetration of distributed energy resources (DER) in the electric power grid is driving a new paradigm shift towards transactive energy system (TES), an active and more sustainable system characterized by distributed…
With the digitalization of the financial market, dealers are increasingly handling market-making activities by algorithms. Recent antitrust literature raises concerns on collusion caused by artificial intelligence. This paper studies the…
One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that a bundle allocated to an agent may affect the utilities of other…
A tournament on $n$ agents is a complete oriented graph with the agents as vertices and edges that describe the win-loss outcomes of the $\binom{n}{2}$ matches played between each pair of agents. The winner of a tournament is determined by…
We present a fully-distributed algorithm for Nash equilibrium seeking in aggregative games over networks. The proposed scheme endows each agent with a gradient-based scheme equipped with a tracking mechanism to locally reconstruct the…