MST 2010 - PDF Preprint Papers

MST 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed MST-2010 Paper

click to vote

MST
2010

196views more MST 2010»

Non-Cooperative Cost Sharing Games via Subsidies

12 years 11 months ago

Download www.openu.ac.il

We consider a cost sharing system where users are selfish and act according to their own interest. There is a set of facilities and each facility provides services to a subset of ...

Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ar...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	196	Non-Cooperative Cost Sharing Games via Subsidies	claim
2	187	Distributed Approximation of Capacitated Dominating Sets	claim
3	155	Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks	claim
4	146	The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation	claim
5	140	Approximability of Clausal Constraints	claim
6	122	Self-Referential Justifications in Epistemic Logic	claim
7	121	Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits	claim
8	117	Class Constrained Bin Covering	claim
9	117	The 1-Versus-2 Queries Problem Revisited	claim
10	111	Sturmian Trees	claim
11	110	Facets of the Fully Mixed Nash Equilibrium Conjecture	claim
12	107	Fixed-Parameter Algorithms for Cluster Vertex Deletion	claim
13	106	Constrained-Path Labellings on Graphs of Bounded Clique-Width	claim
14	105	On the Automatizability of Polynomial Calculus	claim
15	103	Border Correlations of Partial Words	claim
16	101	Automatic Presentations and Semigroup Constructions	claim
17	101	Non-Uniform Reductions	claim
18	98	Why Almost All k-Colorable Graphs Are Easy to Color	claim
19	98	Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy	claim
20	95	Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model	claim
21	93	Atomic Congestion Games: Fast, Myopic and Concurrent	claim
22	92	Bijective Linear Time Coding and Decoding for k-Trees	claim
23	86	New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem	claim
24	86	Fixed-Parameter Enumerability of Cluster Editing and Related Problems	claim
25	83	Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?	claim
26	83	Local MST Computation with Short Advice	claim
27	81	Quantum Search with Variable Times	claim
28	79	A Search Algorithm for Subshift Attractors of Cellular Automata	claim
29	79	On Bounded Rational Trace Languages	claim
30	78	Sensitivity of Wardrop Equilibria	claim
31	75	Generic Complexity of Presburger Arithmetic	claim
32	75	W-Hierarchies Defined by Symmetric Gates	claim
33	74	Strong-Diameter Decompositions of Minor Free Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers