𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A nearly perfect market?

✍ Scribed by Erik Brynjolfsson; Astrid A. Dick; Michael D. Smith

Book ID
106508073
Publisher
Springer US
Year
2009
Tongue
English
Weight
522 KB
Volume
8
Category
Article
ISSN
1570-7156

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

cover
A Nearly Perfect Copy
✍ Amend, Allison πŸ“‚ Fiction πŸ“… 2013 πŸ› Knopf Doubleday Publishing Group 🌐 en-US βš– 316 KB

**Richly drawn and sharply observed,_A Nearly Perfect Copy_ is a smart and affecting novel of family and forgery set amidst the rarefied international art world. ** Elm Howells has a loving family and a distinguished career at an elite Manhattan auction house. But after a tragic loss throws her

cover
A Nearly Perfect Copy
✍ Amend, Allison πŸ“‚ Fiction πŸ“… 2013 πŸ› Knopf Doubleday Publishing Group 🌐 en-US βš– 316 KB

**Richly drawn and sharply observed,_A Nearly Perfect Copy_ is a smart and affecting novel of family and forgery set amidst the rarefied international art world. ** Elm Howells has a loving family and a distinguished career at an elite Manhattan auction house. But after a tragic loss throws her

cover
Very Nearly Perfect
✍ Greywood, Miranda πŸ“‚ Fiction πŸ“… 2020 πŸ› Daisy Chain Publishing 🌐 English βš– 101 KB πŸ‘ 2 views
Graphene: A Nearly Perfect Fluid
Graphene: A Nearly Perfect Fluid
✍ MΓΌller, Markus; Schmalian, JΓΆrg; Fritz, Lars πŸ“‚ Article πŸ“… 2009 πŸ› The American Physical Society 🌐 English βš– 257 KB
cover
A Nearly Perfect Copy: A Novel
✍ Amend, Allison πŸ“‚ Fiction πŸ“… 2013 πŸ› Nan A. Talese 🌐 English βš– 234 KB

**Richly drawn and sharply observed, *A Nearly Perfect Copy* is a smart and affecting novel of family and forgery set amidst the rarefied international art world.**Elm Howells has a loving family and a distinguished career at an elite Manhattan auction house. But after a tragic loss throws her into

Nearly perfect sets in graphs
Nearly perfect sets in graphs
✍ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 871 KB

In a graph G = (V, E), a set of vertices S is nearly perfect if every vertex in V-S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and efficient dominating sets. We say a nearly perfect set S is 1-minimal