ICALP 2010 - PDF Preprint Papers

ICALP 2010 International Colloquium on Automata

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ICALP-2010 Paper

click to vote

ICALP
2010
Springer

219views Programming Languages» more ICALP 2010»

The Cooperative Game Theory Foundations of Network Bargaining Games

13 years 6 months ago

Download mhbateni.com

We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...

MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...

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	219	The Cooperative Game Theory Foundations of Network Bargaining Games	claim
2	218	Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs	claim
3	216	Probabilistic Automata on Finite Words: Decidable and Undecidable Problems	claim
4	211	On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors	claim
5	209	Automata for Coalgebras: An Approach Using Predicate Liftings	claim
6	185	On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs	claim
7	183	Covering and Packing in Linear Space	claim
8	171	A Topological Approach to Recognition	claim
9	166	On Bisimilarity and Substitution in Presence of Replication	claim
10	165	From Secrecy to Soundness: Efficient Verification via Secure Computation	claim
11	164	Resource Oblivious Sorting on Multicores	claim
12	158	On Approximate Horn Formula Minimization	claim
13	156	New Data Structures for Subgraph Connectivity	claim
14	156	Parameterized Modal Satisfiability	claim
15	152	Cell Probe Lower Bounds and Approximations for Range Mode	claim
16	151	B and D Are Enough to Make the Halpern-Shoham Logic Undecidable	claim
17	150	Informative Labeling Schemes	claim
18	148	Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems	claim
19	148	Compositional Closure for Bayes Risk in Probabilistic Noninterference	claim
20	147	How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)	claim
21	146	Compositionality in Graph Transformation	claim
22	146	On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions	claim
23	144	Data Stream Algorithms for Codeword Testing	claim
24	142	Concurrent Knowledge Extraction in the Public-Key Model	claim
25	142	Energy Parity Games	claim
26	141	On the k-Independence Required by Linear Probing and Minwise Independence	claim
27	138	The Positive Semidefinite Grothendieck Problem with Rank Constraint	claim
28	137	Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals	claim
29	135	Linear Orders in the Pushdown Hierarchy	claim
30	135	Metrical Task Systems and the k-Server Problem on HSTs	claim
31	134	Additive Spanners in Nearly Quadratic Time	claim
32	133	On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi	claim
33	132	Tell Me Where I Am So I Can Meet You Sooner	claim
34	132	Network Design via Core Detouring for Problems without a Core	claim
35	131	Testing Non-uniform k-Wise Independent Distributions over Product Spaces	claim
36	131	Thresholded Covering Algorithms for Robust and Max-min Optimization	claim
37	131	Composition Theorems in Communication Complexity	claim
38	131	Rewriting Measurement-Based Quantum Computations with Generalised Flow	claim
39	130	Example-Guided Abstraction Simplification	claim
40	124	Dynamic Programming for Graphs on Surfaces	claim
41	124	Model Checking Succinct and Parametric One-Counter Automata	claim
42	123	Scalably Scheduling Power-Heterogeneous Processors	claim
43	122	Reachability Games on Extended Vector Addition Systems with States	claim
44	122	The Downward-Closure of Petri Net Languages	claim
45	122	What Is a Pure Functional?	claim
46	121	Pebble Weighted Automata and Transitive Closure Logics	claim
47	120	Mean-Payoff Games and Propositional Proofs	claim
48	120	Better Scalable Algorithms for Broadcast Scheduling	claim
49	120	Choosing, Agreeing, and Eliminating in Communication Complexity	claim
50	120	Noetherian Spaces in Verification	claim
51	119	Tight Thresholds for Cuckoo Hashing via XORSAT	claim
52	119	Scheduling Periodic Tasks in a Hard Real-Time Environment	claim
53	117	The Compositional Structure of Multipartite Quantum Entanglement	claim
54	116	Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests	claim
55	116	Efficient Evaluation of Nondeterministic Automata Using Factorization Forests	claim
56	115	Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata	claim
57	114	Preprocessing of Min Ones Problems: A Dichotomy	claim
58	113	A Sublogarithmic Approximation for Highway and Tollbooth Pricing	claim
59	113	Mergeable Dictionaries	claim
60	112	Clustering with Diversity	claim
61	112	Pumping and Counting on the Regular Post Embedding Problem	claim
62	112	Towards a Theory of Time-Bounded Verification	claim
63	110	Interval Sorting	claim
64	108	SDP Gaps for 2-to-1 and Other Label-Cover Variants	claim
65	108	Finding Is as Easy as Detecting for Quantum Walks	claim
66	106	On p-Optimal Proof Systems and Logics for PTIME	claim
67	104	Graph Homomorphisms with Complex Values: A Dichotomy Theorem	claim
68	104	Polynomial-Space Approximation of No-Signaling Provers	claim
69	102	Exponential Time Complexity of the Permanent and the Tutte Polynomial	claim
70	101	Streaming Algorithms for Independent Sets	claim
71	97	On LR(k)-Parsers of Polynomial Size	claim
72	95	Space-Efficient Scheduling of Stochastically Generated Tasks	claim
73	94	Online Network Design with Outliers	claim
74	92	The Serializability of Network Codes	claim
75	80	Sparse Reliable Graph Backbones	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers