1 citations · 1 across the 5 of their papers we have counts for
Showing 2000 · cs.CEShow all
2 papers · 2 filters
cs.CE2000
Opportunity Cost Algorithms for Combinatorial Auctions
Karhan Akcoglu, James Aspnes, Bhaskar DasGupta +1
Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each…
cs.CE2000
Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity
James Aspnes, David F. Fischer, Michael J. Fischer +2
This paper initiates a study into the century-old issue of market predictability from the perspective of computational complexity. We develop a simple agent-based model for a stock…