相关论文: Cost-sharing in Parking Games

For drivers in ride-hailing companies, allocation within the city is paramount to get matched with rides. This decision depends on many factors, where some of them (such as demand and allocation of others) are unknown for the drivers, but…

We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…

We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that…

In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…

We study a general scenario of simultaneous contests that allocate prizes based on equal sharing: each contest awards its prize to all players who satisfy some contest-specific criterion, and the value of this prize to a winner decreases as…

In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking node p_i has a capacity of…

Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, where agents may fail to participate in the game. In the…

Congestion games constitute an important class of games to model resource allocation by different users. As computing an exact or even an approximate pure Nash equilibrium is in general PLS-complete, Caragiannis et al. (2011) present a…

We study mechanism design for combinatorial cost sharing. Imagine that multiple items or services are available to be shared among a set of interested agents. The outcome of a mechanism in this setting consists of an assignment, determining…

The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…

Cooperative transmission in vehicular networks is studied by using coalitional game and pricing in this paper. There are several vehicles and roadside units (RSUs) in the networks. Each vehicle has a desire to transmit with a certain…

Coalition formation is often modeled as a static equilibrium problem, neglecting the dynamic processes governing how agents self-organize. This paper proposes a dynamic split-and-merge framework that balances two conflicting economic…

How can we design mechanisms to promote efficient use of shared resources? Here, we answer this question in relation to the well-studied class of atomic congestion games, used to model a variety of problems, including traffic routing.…

Data valuation is an essential task in a data marketplace. It aims at fairly compensating data owners for their contribution. There is increasing recognition in the machine learning community that the Shapley value -- a foundational…

A fundamental component of the game theoretic approach to distributed control is the design of local utility functions.Relative to resource allocation problems that are additive over the resources, Part I showed how to design local…

The Shapley value is a common tool in game theory to evaluate the importance of a player in a cooperative setting. In a geometric context, it provides a way to measure the contribution of a geometric object in a set towards some function on…

We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…

This paper proposes a coalitional game theory-based approach for reserve optimization to enable DERs participate in tertiary frequency regulation. A two-stage approach is proposed to effectively and precisely allocate spinning reserve…

A number of techniques have been proposed to explain a machine learning model's prediction by attributing it to the corresponding input features. Popular among these are techniques that apply the Shapley value method from cooperative game…

We consider a variant of the berth allocation problem-i.e., the multi-port berth allocation problem-aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds…