Results 21 to 30 of about 4,555 (277)
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy [PDF]
Algorithmic Game Theory, 2022 . 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 the number ...
Edith Elkind +2 more
semanticscholar +1 more source
Price of anarchy for auction revenue [PDF]
Proceedings of the fifteenth ACM conference on Economics and computation, 2014 This paper develops tools for welfare and revenue analyses of Bayes-Nash equilibria in asymmetric auctions with single-dimensional agents. We employ these tools to derive price of anarchy results for social welfare and revenue. Our approach separates the standard smoothness framework into two distinct parts, isolating the analysis common to any auction
Jason D. Hartline +2 more
openaire +3 more sources
The price of anarchy in large games [PDF]
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016 Game-theoretic models relevant for computer science applications usually feature a large number of players. The goal of this paper is to develop an analytical framework for bounding the price of anarchy in such models. We demonstrate the wide applicability of our framework through instantiations for several well-studied models, including simultaneous ...
Michal Feldman +4 more
openaire +2 more sources
The Price of Anarchy in Basketball [PDF]
Journal of Quantitative Analysis in Sports, 2010 Optimizing the performance of a basketball offense may be viewed as a network problem, wherein each play represents a "pathway" through which the ball and players may move from origin (the in-bounds pass) to goal (the basket). Effective field goal percentages from the resulting shot attempts can be used to characterize the efficiency of each pathway ...
openaire +2 more sources
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games
Mathematics of Operations Research, 2022 The price of anarchy (PoA) is a standard measure to quantify the inefficiency of equilibria in nonatomic congestion games. Most publications have focused on worst-case bounds for the PoA.
Zijun Wu, Rolf Moehring
semanticscholar +1 more source
The Price of Anarchy in Auctions
Journal of Artificial Intelligence Research, 2017 This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal solutions and are accordingly limited to relatively stylized settings.
Tim Roughgarden +2 more
openaire +3 more sources
Price of Anarchy for Greedy Auctions [PDF]
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010 We consider auctions in which greedy algorithms, paired with first-price or critical-price payment rules, are used to resolve multi-parameter combinatorial allocation problems. We study the price of anarchy for social welfare in such auctions. We show for a variety of equilibrium concepts, including Bayes-Nash equilibrium and correlated equilibrium ...
Brendan Lucier, Allan Borodin
openaire +2 more sources
Quantifying the efficiency of price-only contracts in push supply chains over demand distributions of known supports [PDF]
, 2013 In this paper, we quantify the efficiency of price-only contracts in supply chains with demand distributions by imposing prior knowledge only on the support, namely, those distributions with support [a, b] for 0 < a
Xu, Dachuan, Chen, Bo, Du, Donglei
core +1 more source
The price of anarchy in bertrand games [PDF]
Proceedings of the 10th ACM conference on Electronic commerce, 2009 The Internet is composed of multiple economically-independent service providers that sell bandwidth in their networks so as to maximize their own revenue. Users, on the other hand, route their traffic selfishly to maximize their own utility. How does this selfishness impact the efficiency of operation of the network? To answer this question we consider
Shuchi Chawla 0001, Feng Niu
openaire +1 more source
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy [PDF]
, 2017 We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user chooses a machine trying to minimize her own cost, and such selfish behavior typically results in some equilibrium which is not globally optimal: An equilibrium is an allocation
Cong Chen 0004, Paolo Penna, Yinfeng Xu
openaire +2 more sources