85 citations · 86 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2012★ 1 cited
Computing Best-Response Strategies in Infinite Games of Incomplete Information
Daniel Reeves, Michael P. Wellman
We describe an algorithm for computing best response strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents' ty…
cs.GT2012
Self-Confirming Price Prediction for Bidding in Simultaneous Ascending Auctions
Anna Osepayshvili, Michael P. Wellman, Daniel Reeves +1
Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction t…