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
- Version:
- Accepted Manuscript
Actions
Access Document
- Files:
-
-
(pdf, 413.4KB)
-
- Publisher copy:
- 10.1007/978-3-030-04612-5_12
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
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
- Volume:
- 11316
- Pages:
- 168-187
- Series:
- Lecture Notes in Computer Science
- Publication date:
- 2018-11-21
- Acceptance date:
- 2018-09-24
- DOI:
- ISSN:
-
0302-9743
- Pubs id:
-
pubs:941351
- URN:
-
uri:6b643ee2-10ef-4658-b710-ea21d6d4ceba
- UUID:
-
uuid:6b643ee2-10ef-4658-b710-ea21d6d4ceba
- Local pid:
- pubs:941351
- ISBN:
- 978-3-030-04612-5
Item Description
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