• Corpus ID: 14541846

Stability scores: measuring coalitional stability

@inproceedings{Feldman2011StabilitySM,
  title={Stability scores: measuring coalitional stability},
  author={Michal Feldman and R. Meir and Moshe Tennenholtz},
  booktitle={Adaptive Agents and Multi-Agent Systems},
  year={2011}
}
We introduce a measure for the level of stability against coalitional deviations, called stability scores, which generalizes widely used notions of stability in non-cooperative games. We use the proposed measure to compare various Nash equilibria in congestion games, and to quantify the effect of game parameters on coalitional stability. For our main results, we apply stability scores to analyze and compare the Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG) ad auctions. We show… 
View PDF on arXiv
6 Citations
Background Citations
3
Methods Citations
1

Tables from this paper

6 Citations

Optimization and Stability in Games with Restricted Interactions

We study cooperative games where the interaction among agents forming coalitions is restricted according to a known graph, following a model first suggested by Myerson (1977). We give an efficient…

On Coalitions and Stable Winners in Plurality

A tight connection is shown between the Maximin score of a candidate and the highest stability score of the outcomes where this candidate wins, and it is shown that under mild conditions theMaximin winner will also be the winner in the most stable outcome under Plurality.

Mechanisms for stability and welfare: increasing cooperation among self-interested agents (עם תקציר בעברית ושער נוסף: מנגנונים ליציבות ורווחה : הגברת שיתוף פעולה בין סוכנים אנוכיים.)

Too often an interaction among self-interested parties—be it human decision makers, firms, or automated agents—leads to an outcome that is not in the best interest of any of them. Examples include…

Cooperative Product Games

I introduce cooperative product games (CPGs), a cooperative game where every player has a weight, and the value of a coalition is the product of the weights of the players in the coalition. I only…

Computing (and Life) Is All about Tradeoffs - A Small Sample of Some Computational Tradeoffs

  • A. Borodin
  • Computer Science
    Space-Efficient Data Structures, Streams, and Algorithms
  • 2013
A pervasive theme in Compute Science (as in any science or for that matter in life) is tradeoffs, and areas of research consider various issues of tradeoffs involving concepts relating to fairness, privacy, conceptual simplicity, robustness, and self-interest.

Space-Efficient Data Structures, Streams, and Algorithms

It is proved matching upper and lower bounds for the deterministic and randomized query complexity of Θ(n log n) and Θ (n log log n), respectively.

References

SHOWING 1-10 OF 19 REFERENCES

Subsidies, Stability, and Restricted Cooperation in Coalitional Games

This work studies the minimal external subsidy required to stabilize the core of a coalitional game, and proves tight bounds on the ratio between the minimal subsidy and the minimal demand relaxation that each lead to stability.

Honor among thieves: collusion in multi-unit auctions

It is shown how to find core imputations and compute the Shapley value, and thus it is shown that in this setting the colluders can always share the gain from their manipulation in a stable and fair way.

Strong price of anarchy

Partition Equilibrium

It is proved that for any given partition there exists a super-strong equilibrium for resource selection games of identical resources with increasing cost functions, which turns out to lead to positive and applicable results in one of the basic domains studied in the literature.

On revenue in the generalized second price auction

The revenue of the Generalized Second Price auction at equilibrium is considered and it is proved that if agent values are drawn from identical regular distributions, then the GSP auction paired with an appropriate reserve price generates a constant fraction of the optimal revenue.

Coalition-Proof Nash Equilibria I. Concepts

Computational analysis of perfect-information position auctions

By computing Nash equilibria and calculating their expected revenue and social welfare, this paper quantitatively answer questions that theoretical methods have not and examines the larger question of whether GSP is a good choice, compared with the alternatives.

Collusive Bidder Behavior at Single-Object Second-Price and English Auctions

Models of collusive bidder behavior at single-object second-price and English auctions are provided. The ind ependent private values model is generalized to permit the formulatio n of coalitions and…

User modeling in position auctions: re-considering the GSP and VCG mechanisms

A study of position auctions, with an explicit modeling of user navigation through ads, which suggests that the VCG position auction is preferable to the ad publisher upon the GSP position auction in the context of the PPA position auctions model.

Failures of the VCG mechanism in combinatorial auctions and exchanges

This paper gives an example of how additional bidders can make the outcome much worse under the VCG mechanism (but not under a first price mechanism); derive necessary and sufficient conditions for such an effective collusion to be possible under theVCG mechanism; study the computational complexity of deciding whether these conditions hold.