相关论文: Smooth Inequalities and Equilibrium Inefficiency i…

We introduce the Funding Game, in which $m$ identical resources are to be allocated among $n$ selfish agents. Each agent requests a number of resources $x_i$ and reports a valuation $\tilde{v}_i(x_i)$, which verifiably {\em lower}-bounds…

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…

A central goal in algorithmic game theory is to analyze the performance of decentralized multiagent systems, like communication and information networks. In the absence of a central planner who can enforce how these systems are utilized,…

We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good…

We study the problem of achieving decentralized coordination by a group of strategic decision makers choosing to engage or not in a task in a stochastic setting. First, we define a class of symmetric utility games that encompass a broad…

Algorithmic decision-making in societal contexts, such as retail pricing, loan administration, recommendations on online platforms, etc., can be framed as stochastic optimization under bandit feedback, which typically requires…

We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the…

We study bottleneck routing games where the social cost is determined by the worst congestion on any edge in the network. Bottleneck games have been studied in the literature by having the player's utility costs to be determined by the…

We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The $n$ nodes are connected by a static network and each node can decide individually to become a gateway to the…

We broaden the basis of non-cooperative game theory by considering miscoordination on a solution concept. For any solution concept, we extend the solution set of a strategic-form game to a transition set. This set contains profiles where…

This paper investigates the efficiency loss in social cost caused by strategic bidding behavior of individual participants in a supply-demand balancing market, and proposes a mechanism to fully recover equilibrium social optimum via…

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 the efficiency of the proportional allocation mechanism, that is widely used to allocate divisible resources. Each agent submits a bid for each divisible resource and receives a fraction proportional to her bids. We quantify the…

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

We model a system of n asymmetric firms selling a homogeneous good in a common market through a pay-as-bid auction. Every producer chooses as its strategy a supply function returning the quantity S(p) that it is willing to sell at a minimum…

The goal in this paper is to approximate the Price of Stability (PoS) in stochastic Nash games using stochastic approximation (SA) schemes. PoS is amongst the most popular metrics in game theory and provides an avenue for estimating the…

We investigate the price of anarchy (PoA) in non-atomic congestion games when the total demand $T$ gets very large. First results in this direction have recently been obtained by \cite{Colini2016On, Colini2017WINE, Colini2017arxiv} for…

We study selfish routing games where users can choose between regular and priority service for each network edge on their chosen path. Priority users pay an additional fee, but in turn they may travel the edge prior to non-priority users,…

The price of anarchy and price of stability are three well-studied performance metrics that seek to characterize the inefficiency of equilibria in distributed systems. The distinction between these two performance metrics centers on the…