Invitation games and the price of stability

DOI10.1145/2554797.2554808MaRDI QIDQ2988870zbMATH OpenOpenAlexFDO

Authors Moshe Tennenholtz, Uriel Feige

Publication date 19 May 2017

Published in Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2554797.2554808

zbMATH Keywords

multi-player gamesprisoner's dilemmasub-game perfect equilibrium

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) 2-person games (91A05) (n)-person games, (n>2) (91A06)

Recommendations

• The Price of Stochastic Anarchy
• Improved equilibria via public service advertising
• Coordination games on graphs
• Equilibria and efficiency loss in games on networks
• The Price of Stability for Network Design with Fair Cost Allocation

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

This page was built for publication: Invitation games and the price of stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988870)