Randomized gossip algorithms
- Stephen P. Boyd, Arpita Ghosh, B. Prabhakar, D. Shah
- Computer ScienceIEEE Transactions on Information Theory
- 1 June 2006
This work analyzes the averaging problem under the gossip constraint for an arbitrary network graph, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
Universally utility-maximizing privacy mechanisms
- Arpita Ghosh, T. Roughgarden, Mukund Sundararajan
- Computer ScienceSymposium on the Theory of Computing
- 17 November 2008
Every potential user u, no matter what its side information and preferences, derives as much utility from M* as from interacting with a differentially private mechanism Mu that is optimally tailored to u, subject to differential privacy.
Crowdsourced judgement elicitation with endogenous proficiency
- Anirban Dasgupta, Arpita Ghosh
- EconomicsThe Web Conference
- 4 March 2013
The main idea behind the mechanism is to use the presence of multiple tasks and ratings to estimate a reporting statistic to identify and penalize low-effort agreement, which rewards agents for agreeing with another 'reference' report on the same task, but also penalizes for blind agreement by subtracting out this statistic term.
Input-Output Approach in an Allocation System
- Arpita Ghosh
- Economics
- 1 February 1958
An input-output transaction matrix may be conceived in terms of an equilibrium position of two sets of interacting forces. The broadest way in which we can define them is 'to denote one set of forces…
Gossip algorithms: design, analysis and applications
- Stephen P. Boyd, Arpita Ghosh, B. Prabhakar, D. Shah
- Computer ScienceProceedings IEEE 24th Annual Joint Conference of…
- 13 March 2005
This work analyzes the averaging problem under the gossip constraint for arbitrary network, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
Minimizing Effective Resistance of a Graph
- Arpita Ghosh, Stephen P. Boyd, A. Saberi
- Computer Science, MathematicsSIAM Review
- 1 February 2008
It is shown that optimal allocation of the edge weights can reduce the total effective resistance of the graph (compared to uniform weights) by a factor that grows unboundedly with the size of thegraph.
Selling privacy at auction
- Arpita Ghosh, Aaron Roth
- Computer Science, EconomicsACM Conference on Economics and Computation
- 5 November 2010
It is shown that generically, no individually rational mechanism can compensate individuals for the privacy loss incurred due to their reported valuations for privacy, and modeling it correctly is one of the many exciting directions for future work.
Bidding for Representative Allocations for Display Advertising
- Arpita Ghosh, R. McAfee, K. Papineni, Sergei Vassilvitskii
- EconomicsWorkshop on Internet and Network Economics
- 5 October 2009
This work characterize what allocations can be implemented with randomized bidding, namely those where the desired share obtained at each price is a non-increasing function of price.
Who moderates the moderators?: crowdsourcing abuse detection in user-generated content
- Arpita Ghosh, Satyen Kale, R. McAfee
- Computer ScienceACM Conference on Economics and Computation
- 5 June 2011
This paper introduces a framework to address the problem of moderating online content using crowdsourced ratings, and presents efficient algorithms to accurately detect abuse that only require knowledge about the identity of a single 'good' agent, who rates contributions accurately more than half the time.
Superposter behavior in MOOC forums
- Jonathan Huang, Anirban Dasgupta, Arpita Ghosh, Jane Manning, Marc Sanders
- PsychologyACM Conference on Learning @ Scale
- 4 March 2014
It is found that superposters display above-average engagement across Coursera, enrolling in more courses and obtaining better grades than the average forum participant; additionally, students who are super posters in one course are significantly more likely to be superposter in other courses they take.
...
...