Conference item
Learning convex partitions and computing game-theoretic equilibria from best response queries
- Abstract:
-
Suppose that an m-simplex is partitioned into n convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance ε from that point. We present two algorithms for this task: Constant-Dimension Generalised Binary Search (CD-GBS), which for constant m uses poly(n,log(1ε)) queries, and Constant-Region Generalised Binary Search (CR-GBS...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 413.4KB)
-
- Publisher copy:
- 10.1007/978-3-030-04612-5_12
Authors
Funding
+ Mexican National Council of Science and
Technology
More from this funder
Funding agency for:
Marmolejo Cossío, F
Bibliographic Details
- Publisher:
- Springer, Cham Publisher's website
- Journal:
- WINE 2018: The 14th Conference on Web and Internet Economics Journal website
- Volume:
- 11316
- Pages:
- 168-187
- Series:
- Lecture Notes in Computer Science
- Host title:
- WINE 2018: Web and Internet Economics
- Publication date:
- 2018-11-21
- Acceptance date:
- 2018-09-24
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
941351
- ISBN:
- 9783030046125
Item Description
- Keywords:
- Pubs id:
-
pubs:941351
- UUID:
-
uuid:6b643ee2-10ef-4658-b710-ea21d6d4ceba
- Local pid:
- pubs:941351
- Deposit date:
- 2018-11-13
Terms of use
- Copyright holder:
- Springer Nature Switzerland AG
- Copyright date:
- 2018
- Notes:
- Copyright © 2018 Springer Nature Switzerland AG. This is the accepted manuscript version of the paper. The final version is available online from Springer at: https://doi.org/10.1007/978-3-030-04612-5_12
If you are the owner of this record, you can report an update to it here: Report update to this record