activity
20022026
most citedCollaborative Filtering by Personality Diagnosis: A Hybrid Memory- and Model-Based Approach

506 citations · 1.3k across the 28 of their papers we have counts for

collaborators
Showing cs.GTShow all

15 papers · 1 filter

cs.GT2025

Efficiency of Constant Log Utility Market Makers

Maneesha Papireddygari, Xintong Wang, Bo Waggoner +1

Automated Market Makers (AMMs) are used to provide liquidity for combinatorial prediction markets that would otherwise be too thinly traded. They offer both buy and sell prices for…

cs.GT2024

Post-Match Error Mitigation for Deferred Acceptance

Abraham Gale, Amélie Marian, David M. Pennock

Real-life applications of deferred-acceptance (DA) matching algorithms sometimes exhibit errors or changes to the matching inputs that are discovered only after the algorithm has b…

cs.GT2024

Toward Fair and Strategyproof Tournament Rules for Tournaments with Partially Transferable Utilities

David Pennock, Ariel Schvartzman, Eric Xue

A tournament on agents is a complete oriented graph with the agents as vertices and edges that describe the win-loss outcomes of the matches played between each…

cs.GT2021★ 1 cited

Designing a Combinatorial Financial Options Market

Xintong Wang, David M. Pennock, Nikhil R. Devanur +3

Financial options are contracts that specify the right to buy or sell an underlying asset at a strike price by an expiration date. Standard exchanges offer options of predetermined…

cs.GT2021

Log-time Prediction Markets for Interval Securities

Miroslav Dudík, Xintong Wang, David M. Pennock +1

We design a prediction market to recover a complete and fully general probability distribution over a random variable. Traders buy and sell interval securities that pay $1 if the…

cs.GT2021

Incentive-Compatible Forecasting Competitions

Jens Witkowski, Rupert Freeman, Jennifer Wortman Vaughan +2

We initiate the study of incentive-compatible forecasting competitions in which multiple forecasters make predictions about one or more events and compete for a single prize. We ha…

cs.GT2020

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions

Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins

We study the problem of finding personalized reserve prices for unit-demand buyers in multi-unit eager VCG auctions with correlated buyers. The input to this problem is a dataset o…

cs.GT2019★ 50 cited

Truthful Aggregation of Budget Proposals

Rupert Freeman, David M. Pennock, Dominik Peters +1

We consider a participatory budgeting problem in which each voter submits a proposal for how to divide a single divisible resource (such as money or time) among several possible al…

cs.GT2017

Fair Allocation of Indivisible Goods to Asymmetric Agents

Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi +5

We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings.…

cs.GT2016

The Possibilities and Limitations of Private Prediction Markets

Rachel Cummings, David M. Pennock, Jennifer Wortman Vaughan

We consider the design of private prediction markets, financial markets designed to elicit predictions about uncertain events without revealing too much information about market pa…

cs.GT2015

Budget Constraints in Prediction Markets

Nikhil Devanur, Miroslav Dudík, Zhiyi Huang +1

We give a detailed characterization of optimal trades under budget constraints in a prediction market with a cost-function-based automated market maker. We study how the budget con…

cs.GT2013★ 1 cited

Toward a Market Model for Bayesian Inference

David M. Pennock, Michael P. Wellman

We present a methodology for representing probabilistic relationships in a general-equilibrium economic model. Specifically, we define a precise mapping from a Bayesian network wit…

cs.GT2012★ 136 cited

A Utility Framework for Bounded-Loss Market Makers

Yiling Chen, David M Pennock

We introduce a class of utility-based market makers that always accept orders at their risk-neutral prices. We derive necessary and sufficient conditions for such market makers to…

cs.GT2012★ 5 cited

Price Updating in Combinatorial Prediction Markets with Bayesian Networks

David M. Pennock, Lirong Xia

To overcome the #P-hardness of computing/updating prices in logarithm market scoring rule-based (LMSR-based) combinatorial prediction markets, Chen et al. [5] recently used a simpl…

cs.GT2008★ 12 cited

Complexity of Combinatorial Market Makers

Yiling Chen, Lance Fortnow, Nicolas Lambert +2

We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson's popular logarithmic market scoring rule market…