172 citations
- Courant Institute of Mathematical SciencesUS3 papers
- Cornell UniversityUS2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- University of PisaIT2 papers
- University of WaterlooCA2 papers
- Amsterdam University of the ArtsNL1 paper
- Columbia UniversityUS1 paper
- Fraunhofer-GesellschaftDE1 paper
- Georgia Institute of TechnologyUS1 paper
- Harvard University PressUS1 paper
11 papers · 1 filter
Quasi-Proportional Mechanisms: Prior-free Revenue Maximization
Vahab Mirrokni, S. Muthukrishnan, Uri Nadav
Inspired by Internet ad auction applications, we study the problem of allocating a single item via an auction when bidders place very different values on the item. We formulate thi…
Harnessing the Deep Web: Present and Future
Jayant Madhavan, Loredana Afanasiev, Lyublena Antova +1
Over the past few years, we have built a system that has exposed large volumes of Deep-Web content to Google.com users. The content that our system exposes contributes to more than…
How opinions are received by online communities: A case study on Amazon.com helpfulness votes
Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinets, Jon Kleinberg +1
There are many on-line settings in which users publicly express opinions. A number of these offer mechanisms for other users to evaluate these opinions; a canonical example is Amaz…
Efficiency of (Revenue-)Optimal Mechanisms
Gagan Aggarwal, Gagan Goel, Aranyak Mehta
We compare the expected efficiency of revenue maximizing (or {\em optimal}) mechanisms with that of efficiency maximizing ones. We show that the efficiency of the revenue maximizin…
Quantum Annealing for Variational Bayes Inference
Issei Sato, Kenichi Kurihara, Shu Tanaka +2
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simul…
Quantum Annealing for Clustering
Kenichi Kurihara, Shu Tanaka, Seiji Miyashita
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an anne…