Abstract Peer-to-peer (P2P) ridesharing is a form of shared-use mobility that has emerged in
recent decades as a result of enabling of the sharing economy, and the advancement of new …

To overcome incompatibility issues, kidney patients may swap their donors. In international
kidney exchange programmes (IKEPs), countries merge their national patient–donor pools …

Matching games naturally generalize assignment games, a well-known class of cooperative
games. Interest in matching games has grown recently due to some breakthrough results …

We consider multiple partners matching games (G, b, w), where G is a graph with an integer
vertex capacity function b and an edge weighting w. If G is bipartite, these games are called …

Cooperative matching games (Shapley and Shubik) and Network bargaining games
(Kleinberg and Tardos) are games described by an undirected graph, where the vertices …

This thesis navigates the evolving landscape of truck platooning, a transformative
technology resha** the transportation sector. Comprising three interconnected chapters …

A weighted graph is called stable if the maximum weight of an integral matching equals the
cost of a minimum-weight fractional vertex cover. We address the following question: how …

Graph stabilization has raised a family of network design problems that has received
considerable attention recently. Stable graphs are those graphs for which the matching …

A cooperative game (V, ν) is given by a finite set V and a function ν: 2V→ R withν (∅)= 0,
whereV is the set ofn players andν is the characteristic function such that ν (X) denotes the …

An edge-weighted graph G is called stable if the value of a maximum-weight matching
equals the value of a maximum-weight fractional matching. Stable graphs play an important …