ICS 2010 - PDF Preprint Papers

ICS 2010 International Conference on Supercomputing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICS-2010 Paper

click to vote

ICS
2010
Tsinghua U.

505views Distributed And Parallel Com...» more ICS 2010»

Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities

14 years 8 months ago

Download www.cc.gatech.edu

We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...

Vijay V. Vazirani, Mihalis Yannakakis

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	505	Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities	claim
2	366	A New Look at Selfish Routing	claim
3	327	Robustness of the Learning with Errors Assumption	claim
4	268	Local Algorithms for Finding Interesting Individuals in Large Networks	claim
5	265	Weight Distribution and List-Decoding Size of Reed-Muller Codes	claim
6	229	Overlapping communication and computation by using a hybrid MPI/SMPSs approach	claim
7	223	Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization	claim
8	218	Distribution-Specific Agnostic Boosting	claim
9	216	Clustering performance data efficiently at massive scales	claim
10	214	Large-scale FFT on GPU clusters	claim
11	211	Memory Consistency Conditions for Self-Assembly Programming	claim
12	205	A New Approach to Strongly Polynomial Linear Programming	claim
13	200	The auction: optimizing banks usage in Non-Uniform Cache Architectures	claim
14	199	A New Approximation Technique for Resource-Allocation Problems	claim
15	195	Streamlining GPU applications on the fly: thread divergence elimination through runtime thread-data remapping	claim
16	194	Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior	claim
17	188	Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?	claim
18	188	A query language for understanding component interactions in production systems	claim
19	179	Non-Malleable Codes	claim
20	176	Analytical Tools for Natural Algorithms	claim
21	165	Bounds on the Quantum Satisfiability Threshold	claim
22	164	Reaching Consensus on Social Networks	claim
23	163	Effectively Polynomial Simulations	claim
24	160	Handling task dependencies under strided and aliased references	claim
25	158	Decomposable and responsive power models for multicore processors using performance counters	claim
26	156	Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract)	claim
27	156	InterferenceRemoval: removing interference of disk access for MPI programs through data replication	claim
28	153	Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions	claim
29	153	Cryptographic Complexity Classes and Computational Intractability Assumptions	claim
30	153	Cache Replacement Policies for Multicore Processors	claim
31	151	Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol	claim
32	150	ParaLearn: a massively parallel, scalable system for learning interaction networks on FPGAs	claim
33	149	Circuit Lower Bounds, Help Functions, and the Remote Point Problem	claim
34	147	Timing local streams: improving timeliness in data prefetching	claim
35	146	On the Power of a Unique Quantum Witness	claim
36	145	Space-Efficient Estimation of Robust Statistics and Distribution Testing	claim
37	144	Playing Games without Observing Payoffs	claim
38	143	Are Stable Instances Easy?	claim
39	142	Symmetric LDPC Codes and Local Testing	claim
40	140	Speeding up Nek5000 with autotuning and specialization	claim
41	138	Global Alignment of Molecular Sequences via Ancestral State Reconstruction	claim
42	137	Bounding Rationality by Discounting Time	claim
43	135	On the Construction of One-Way Functions from Average Case Hardness	claim
44	134	Proof-Carrying Data and Hearsay Arguments from Signature Cards	claim
45	134	Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction	claim
46	134	An approach to resource-aware co-scheduling for CMPs	claim
47	133	Quantifying performance benefits of overlap using MPI-2 in a seismic modeling application	claim
48	133	Compiler and runtime support for enabling generalized reduction computations on heterogeneous parallel configurations	claim
49	132	Cache oblivious parallelograms in iterative stencil computations	claim
50	129	Interactive Proofs For Quantum Computations	claim
51	127	Adversarial Leakage in Games	claim
52	123	Hard Instances for Satisfiability and Quasi-one-way Functions	claim
53	119	High-throughput Bayesian network learning using heterogeneous multicore computers	claim
54	117	Robustly Leveraging Collusion in Combinatorial Auctions	claim
55	106	Game Theory with Costly Computation: Formulation and Application to Protocol Security	claim
56	101	Making nested parallel transactions practical using lightweight hardware support	claim
57	99	Robust Perfect Revenue From Perfectly Informed Players	claim
58	97	Pan-Private Streaming Algorithms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers