output
20022015
most citedLeftover Hashing Against Quantum Side Information

313 citations

Showing cs.GTShow all

8 papers · 1 filter

cs.GT20153 cited

Efficient Equilibria in Polymatrix Coordination Games

Mona Rahn, Guido Schäfer

We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with…

cs.GT20121 cited

Social Network Games

Sunil Simon, Krzysztof R. Apt

One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXi…

cs.GT2012

Undominated Groves Mechanisms

Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt +1

The family of Groves mechanisms, which includes the well-known VCG mechanism (also known as the Clarke mechanism), is a family of efficient and strategy-proof mechanisms. Unfortuna…

cs.GT201012 cited

The Role of Monotonicity in the Epistemic Analysis of Strategic Games

Krzysztof R. Apt, Jonathan A. Zvesper

It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterat…

cs.GT20091 cited

One-Counter Markov Decision Processes

Tomáš Brázdil, Václav Brožek, Kousha Etessami +2

We study the computational complexity of central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. OC-MDPs…

cs.GT20091 cited

An Online Multi-unit Auction with Improved Competitive Ratio

Sourav Chakraborty, Nikhil Devanur

We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover,…