Sciweavers

16404 search results - page 2932 / 3281
» A set coverage problem
Sort
View
ATMOS
2008
101views Optimization» more  ATMOS 2008»
15 years 8 months ago
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
Spyros C. Kontogiannis, Christos D. Zaroliagis
AAAI
2010
15 years 8 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
144
Voted
AAAI
2010
15 years 8 months ago
Asymmetric Spite in Auctions
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
Ankit Sharma, Tuomas Sandholm
AAAI
2010
15 years 8 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer
BCS
2008
15 years 8 months ago
Overcoming Software Fragility with Interacting Feedback Loops and Reversible Phase Transitions
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
Peter Van Roy
« Prev « First page 2932 / 3281 Last » Next »