output
20022025
most citedNon-Abelian Anyons and Topological Quantum Computation

7k citations

Showing 2012 · cs.GTShow all

7 papers · 2 filters

cs.GT20125 cited

Envy Freedom and Prior-free Mechanism Design

Nikhil R. Devanur, Jason D. Hartline, Qiqi Yan

We consider the provision of an abstract service to single-dimensional agents. Our model includes position auctions, single-minded combinatorial auctions, and constrained matching…

cs.GT201245 cited

Budget Optimization for Sponsored Search: Censored Learning in MDPs

Kareem Amin, Michael Kearns, Peter Key +1

We consider the budget optimization problem faced by an advertiser participating in repeated sponsored search auctions, seeking to maximize the number of clicks attained under that…

cs.GT201215 cited

Deterministic MDPs with Adversarial Rewards and Bandit Feedback

Raman Arora, Ofer Dekel, Ambuj Tewari

We consider a Markov decision process with deterministic state transition dynamics, adversarially generated rewards that change arbitrarily from round to round, and a bandit feedba…

cs.GT20122 cited

Simultaneous Auctions are (almost) Efficient

Michal Feldman, Hu Fu, Nick Gravin +1

Simultaneous item auctions are simple procedures for allocating items to bidders with potentially complex preferences over different item sets. In a simultaneous auction, every bid…

cs.GT20127 cited

Combinatorial Auctions with Restricted Complements

Ittai Abraham, Moshe Babaioff, Shaddin Dughmi +1

Complements between goods - where one good takes on added value in the presence of another - have been a thorn in the side of algorithmic mechanism designers. On the one hand, comp…

cs.GT20121 cited

Optimal Mechanisms for Selling Information

Moshe Babaioff, Robert Kleinberg, Renato Paes Leme

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data provid…